Computer Engineering and Applications ›› 2007, Vol. 43 ›› Issue (21): 144-146.

• 网络、通信与安全 • Previous Articles     Next Articles

Dynamic random early detection queue based on priority classification

LIU Gang1,LIAO Ming-tao2,CHEN Ke1   

  1. 1.Department of Computer Science & Tecnology,Maoming College,Maoming,Guangdong 525000,China
    2.School of Electronics and Information Engineering,Xi’an Jiaotong University,Xi’an 710049,China
  • Received:1900-01-01 Revised:1900-01-01 Online:2007-07-21 Published:2007-07-21
  • Contact: LIU Gang

基于优先级分类的动态随机早期检测队列

刘 刚1,廖明涛2,陈 珂1   

  1. 1.茂名学院 计算机科学与技术系,广东 茂名 525000
    2.西安交通大学 电子与信息工程学院,西安 710049
  • 通讯作者: 刘 刚

Abstract: To overcome limitations of Random Early Detection (RED) queue in Quality of Services(QoS) supporting,a improved RED queue is proposed.The queue sets different RED maximum threshold for different packet class based on local priority classification.At the same time,RED maximum thresholds are adjusted according to values of measured QoS parameters for each class.Simulation results show that the improved queue inherits advantages of RED and provides QoS in some degree.

Key words: Random Early Detection, Quality of Service, priority classification

摘要: 针对随机早期检测(RED)算法在服务质量(QoS)保证方面的不足,提出了一种改进队列。该队列基于本地对数据分组的优先级划分,为不同的优先级类别设置不同的RED最大门限值。同时,此系列门限值根据各优先级分组的QoS参数测量值进行动态调整。实验表明,改进的队列继承了RED拥塞控制的优点,提供了一定的QoS保证功能。

关键词: 随机早期检测, 服务质量, 优先级类别