期刊文献+

分布式调度算法在VOQ交换机中的应用

Application of distributed scheduling algorithm in VOQ switch
下载PDF
导出
摘要 为提高高速通信网络的通信效率,针对VOQ交换机,提出在交换机的各个输出端口中进行分布式通信调度(DSA)的策略。DSA算法可直接支持变长数据包通信调度,克服了传统信元交换只能调度定长数据包的缺点,降低了交换机的实现复杂度。仿真结果表明:在各种流量下,DSA算法都比信元调度算法具有更好的调度性能。 To improve the communication efficiency, a new communication-scheduling algorithm named DSA( Distributed Scheduling Algorithm) was put forward in VOQ switch by scheduling high-speed data packet in every output port independently. Compared with other traditional scheduling algorithms, which can only schedule the constant length message, the DSA can directly schedule the communication under variable message length. The simulation results show that the DSA scheduler outperforms iSLIP scheduling algorithm under all traffic. DSA can work efficiently in VOQ switch.
作者 徐晓飞
出处 《计算机应用》 CSCD 北大核心 2006年第8期1788-1790,共3页 journal of Computer Applications
基金 航空电子系统综合技术国防科技重点实验室资助
关键词 虚拟输出队列 通信调度算法 分布式调度算法 Virtual Output Queue(VOQ) communication scheduling algorithm Distributed Scheduling Algorithm(DSA)
  • 相关文献

参考文献5

  • 1LI YH,PANWAR S,CHAO HJ.The Dual Round-Robin Matching Switch with Exhaustive Service[A].2002 Workshop High Performance Switching and Routing(HPSR2002)[C].2002.58-63.
  • 2JIANG Y,HAMDI M.A fully dsynchronized Round-Robin matching scheduler for a VOQ packet switch architecture[A].IEEE communications Society[C].2002.58 -63.
  • 3www.hp.com/go/hpprocure,2003.
  • 4MCKEOWN N.The iSLIP scheduling algorithm for input-queued switches[J].IEEE Transactions on Networking,1999,7(2):188 -201.
  • 5吴俊,陈晴,罗军舟.时隙间迭代的输入队列交换机Round-Robin调度算法[J].软件学报,2005,16(3):375-383. 被引量:11

二级参考文献16

  • 1Karol M, Hluchyj M, Morgan S. Input versus output queuing on a space division switch. IEEE Trans. on Communications, 1987,35(12):1347-1356.
  • 2Mckeown N, Mekkittikul A, Anantharam V, Walrand J. Achieving 100% throughput in an input-queued switch. IEEE Trans. on Communications, 1999,47(8):1260-1267.
  • 3Mekkittikul A, Mckeown N. A practical scheduling algorithm to achieve 100% throughput in input-queued switches. In: Guerin R, ed. Proc. of the IEEE INFOCOM. San Francisco: IEEE Computer Society Press, 1998. 792-799.
  • 4Tabatabaee V, Tassiulas L. MNCM a new class of efficient scheduling algorithms for input buffered switches with no speedup. In: Matta I, ed. Proc. of the IEEE INFOCOM. San Francisco: IEEE Communications Society, 2003. 1406-1413.
  • 5Tassiulas L. Linear complexity algorithms for maximum throughput in radio networks and input queued switches. In: Guerin R, ed. Proc. of the IEEE INFOCOM. San Francisco: IEEE Computer Society Press, 1998. 533-539.
  • 6Giaccone P, Prabhakar B, Shah D. Towards simple, high-performance schedulers for high-aggregate bandwidth switches. In: IEEE Computer Society, ed. Proc. of the INFOCOM 2002. San Francisco: IEEE Press, 2002. 1160-1169.
  • 7Giaccone P, Shah D, Prabhakar B. An implementable parallel scheduler for input-queued switches. IEEE Micro, 2002,22(1):19-25.
  • 8Shah D, Giaccone P, Prabhakar B. Efficient randomized algorithms for input-queued switch scheduling. IEEE Micro, 2002,22(1): 10-18.
  • 9McKeown N. The iSLIP scheduling algorithm for input-queued switches. IEEE Trans. on Networking, 1999,7(2):188-201.
  • 10Serpanos DN, Antoniadis PI. FIRM: A class of distributed scheduling algorithms for high-speed ATM switches with multiple input queues. In: Katzela I, ed. Proc. of the IEEE INFOCOM. Tel Aviv: IEEE Communications Society, 2000. 548-555.

共引文献10

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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