期刊文献+

一种基于Credit的变长分组并行交换网络调度算法

A Scheduling Algorithm Based on Credit in Variable-length Packet Parallel Switching Network
在线阅读 下载PDF
导出
摘要 该文提出了一种新的并行分组交换(PPS)网络调度算法。该算法通过在解复用器处采用以变长分组为业务分配单元的方式消除了信元的乱序问题;通过采用Credit机制进行业务分配,实现了业务到各个交换平面完全公平的分配;各个并行交换单元采用组合输入输出排队,降低了对缓存和交换平面的加速要求,同时可以充分利用现有单Crossbar网络调度算法的研究成果。文中证明了该算法对业务分配的公平性,对高速缓存的需求量以及整个网络的稳定性,仿真进一步证明了该算法具有良好性能。 A new scheduling algorithm in Parallel Packet Switch(PPS) is proposed in this paper . This algorithm eliminates out-of sequence of the cells belonging to a packet by dispatching the traffic with variable-length packet at de-multiplexer. It balances the traffic distribution to each parallel switch by a credit based mechanism. The combined input and output queued(CIOQ) mechanism is adopted with each parallel switch in this algorithm, which not only degrades the speed-up requirement of the buffer and switch, but also takes full advantage of the available research achievements of scheduling algorithm in Crossbar switches. Theoretical analysis is made on the fairness of traffic distributions, the amount of the required high-speed buffer (run in line-speed) and the stability of the network. The simulation analysis shows the good performance of this algorithm further.
出处 《电子与信息学报》 EI CSCD 北大核心 2008年第9期2229-2232,共4页 Journal of Electronics & Information Technology
基金 国家863计划项目(2002AA103062) 综合业务网国家重点实验室开放基金(ISN8-03) 中兴通信股份有限公司技术研究基金(ZXJS200609120159)资助课题
关键词 并行分组交换 Credit机制 业务分配 调度算法 Parallel Packet Switch(PPS) Credit mechanism Traffic dispatch Scheduling algorithm
作者简介 杨君刚:男,1973年生,博士生,讲师,研究方向为大容量路由器交换网络、下一代光网络关键技术. 刘增基:男,1937年生,教授,博士生导师,研究方向为宽带网络关键技术. 赵瑞琴:女,1981年生,博士生,研究方向为无线传感器网络、无线移动自组织网. 雒晓卓:男,1982年生,硕士生,研究方向为光传输设备交换网络调度和保护技术.
  • 相关文献

参考文献9

  • 1Iyer S, Awadallah A, and McKeown N. Analysis of a packet switch with memories running slower than the line rate[C]. IEEE INFOCOM '00, Tel-Aviv, Israel, 2000: 529-537.
  • 2Iyer S and McKeown N. Making Parallel Packet Switches Practical[C]. IEEE INFOCOM'01, Alaska, USA, 2001: 1680- 1687.
  • 3Zhong Hakhan, Xu Du, and Zhu Zhenyu. A parallel packet switch supporting variable-length packets[C]. International Conference on Communications, Circuits and Systems Proceedings. Hong Kong, China, 2005: 613-617.
  • 4Shi Lei and Li Wenjie, et al.. Flow mapping in the load balancing parallel packet switches[C]. Workshop on High Performance Switching and Routing. Hong Kong, China, 2005: 254-258.
  • 5Ganjali Y, Keshavarzian A, and Shah D. Input queued switches: cell switching vs. packet switching[C}. IEEE INFOCOM'03. San Francisco, USA, 2003: 1651-1658.
  • 6McKeown N. iSLIP: A scheduling algorithm for input-queued switches[J]. IEEE/ACM Trans. on Networking, 1999, 7(2): 188-201.
  • 7Prabhakar B and McKeown N. On the speedup required for combined input and output queued switching[J]. Automatica, 1999, 35(12): 1909-1920.
  • 8Dai J G and Prabhakar B. The throughput of data switches with and without speedup[C]. IEEE INFOCOM'00, TelAviv, Israel, 2000: 556-564.
  • 9Goudreau M W, et al.. Scheduling algorithms for input-queued switches: Randomized techniques and experimental evaluation [C]. IEEE INFOCOM'00, TelAviv, Israel, 2000: 1624-1643.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部