多级交换中支持包保序的交换结构及调度算法

胡宇翔; 兰巨龙; 邬钧霆

doi:10.3724/SP.J.1146.2009.00299

多级交换中支持包保序的交换结构及调度算法

doi: 10.3724/SP.J.1146.2009.00299

计量
- 文章访问数: 3174
- HTML全文浏览量: 78
- PDF下载量: 1080
- 被引次数: 0
出版历程
- 收稿日期: 2009-03-09
- 修回日期: 2009-07-27
- 刊出日期: 2010-02-19

The Switch Structure and Scheduling Algorithm for Maintaining Packet Order in Multistage Switching Fabric

摘要

摘要: 现有单级交换结构在其规模的有效扩展方面存在瓶颈。该文提出了一种新的中间级带缓存的高可扩展多级交换结构，并建立了该结构的排队论模型。针对交换网络内部的信元乱序问题，该文基于上述结构提出一种新的包保序算法，该算法通过严格同步输入级和中间级调度指针，能够简单有效地实现信元保序。理论分析结果表明，该结构能够获得100%的吞吐量且实现代价较小。仿真实验表明，该算法不仅能够获得较为理想的高吞吐量，并且在高负载强度下的平均时延性能优势明显。
- 多级交换网络; 交换结构; 包保序; 调度
Abstract: Current single-stage switch structure encounters its bottleneck in scalability. This paper proposes a novel central-stage buffered scalable multistage switch structure, and establishes its mathematical model by queuing theory. For the problem of cell disorder, this paper puts forward a new algorithm to maintaining packet order simply and effectively by controlling the point in input stage and central stage strictly. The results of academic analysis show that this structure could provide 100% throughput which costs less as well. The results of simulation show that this algorithm not only could provide perfect throughput performance, but also take on a better delay performance in heavy load.

HTML全文

参考文献(1)

Oki E, Jing Zhi-gang, and Rojas-Cessa R, et al.. Concurrent round-robin-based dispatching schemes for clos-network switches[J].IEEE/ACM Transactions on Networking.2002, 10(6):830-844[2]Chiussi F M, Kneuer J G, and Kumar V P. Low-cost scalable switching solutions for broadband networking: The ATLANTA architecture and chipset[J]. IEEE Communications Magazine, 1997, 35(12): 44-53.[3]Chrysos N and Katevenisz M. Scheduling in non-blocking buffered three-stage switching fabrics[C]. Proc. IEEE Globecom2006, Francisco, IEEE Computer Society, 2006: 6-13.Wang Feng, Zhu Wen-qi, and Hamdi M. The central-stage buffered clos-network to emulate an OQ switch[C]. Proc. IEEE Globecom2006, Francisco, IEEE Computer Society, 2006: 1-5.[4]Li X and Elhanany I. A scalable frame-based multi-crosspoint packet switching architecture[C]. Proc. HPSR, Brooklyn, USA, 2007: 61-65.盛友招. 排队论及其在现代通信中的应用[M]. 北京: 人民邮电出版社, 2007: 50-55.[5]Shen Yanming, Panwar S S, and Chao H J. Providing 100% throughput in a buffered crossbar switch[C]. Proc. HPSR, Brooklyn, USA. 2007: 1-8.[6]Iyer S and Mckeown N. Making parallel switches practical[C]. Proc. INFOCOM2001, Alaska, IEEE Computer Society, 2001: 1680-1687.[7]杨君刚, 鲍民权, 刘增基等. 一种具有信元保序能力的Clos网络分布式调度算法[J]. 计算机学报, 2008, 31(3): 467-475.Yang Jun-gang, Bao Min-quan, and Liu Zeng-ji, et al.. A distributed scheduling algorithm maintaining cells order for three-stage clos networks[J].Chinese Journal of Computers.2008, 31(3):467-475[8]兰巨龙, 董雨果, 陈越, 温建华. 并行交换中支持包保序的缓存结构及调度算法[J]. 电子学报, 2004, 32(12): 35-38.Lan Ju-long, Dong Yu-guo, Chen Yue, and Wen Jian-hua. The buffer structure and scheduling algorithm for maintaining packet order in the parallel switch[J]. Acta Electronica Sinica, 2004, 32(12): 35-38.

施引文献

资源附件(0)

访问统计