• 研究论文 • 上一篇    下一篇



  1. (西安电子科技大学 综合业务网理论及关键技术国家重点实验室,陕西 西安 710071)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2007-10-20 发布日期:2007-10-25

Routing and scheduling algorithm based on compositive priority computing for high speed switching fabrics

YANG Fan;QIU Zhi-liang;LIU Zeng-ji;YAN Jing

  1. (State Key Lab. of Integrated Service Networks, Xidian Univ., Xi′an 710071, China)
  • Received:1900-01-01 Revised:1900-01-01 Online:2007-10-20 Published:2007-10-25

摘要: 针对输入缓存的交换结构,提出了一种将时延与丢失率相结合计算分组优先级的算法CPC.分组所属队列的队列长度值被分段离散化,与分组的时延优先级进行非线性加权,从而得到既能够反映分组时延又能反映分组队长动态变化的优先级.在此优先级的基础上,提出了输入缓存交换结构中能够兼顾分组时延与分组队长的分组调度算法.将此调度算法用于单Crossbar交换单元和Clos网络,并提出了在Clos网络中按照优先级均衡负载的路由算法.仿真结果表明,该调度算法与路由算法可以在满足实时性分组时延要求的同时有效地减小分组的丢失率.

关键词: 输入缓存, 时延, 丢失率, 优先级, 路由算法

Abstract: An algorithm which computes integrated priority for the packet in the input memory switch is proposed. In this algorithm both the packet delay and packet loss rate are considered to compute packet priority. The length of the packet queue is turned into discrete values and weighted nonlinearly with packet delay priority. So the priority that combines packet delay and dynamic queue length is obtained. A packet scheduling algorithm based on this priority scheme is proposed for the input memory switch. The scheduling algorithm supports both packet delay and packet queue length. The application of this scheduling algorithm in Crossbar and Clos networks is presented. A new routing algorithm for balancing the load of high priority traffic is also proposed. Simulation results show these two algorithms can lower the packet loss rate and guarantee packet delay.

Key words: input memory, delay, loss rate, priority, routing algorithm


  • TN913.24