期刊文献+

存储速率低于链路速率的重端口交换机稳定性分析

Stability Analysis of Duplicated Ports Switch Architecture
下载PDF
导出
摘要 讨论了当存储器速率低于链路速率时重端口交换机的稳定性,通过理论分析证明:当端口重数为d(d>2)时,存储器工作于2/d的链路速率下,重端口交换机在任何满足强大数律的流量下均是稳定的;且获得这种稳定性只需使用极大匹配调度算法.仿真结果表明这种重端口交换机的性能堪与OQ交换机媲美. In this paper, the stability result of DPS with slower memory rate than line rate is established by using fluid model techniques. Provided that the duplicate number of DPS is d and individual memory rate is not less than 2/d line rate, DIES with maximal matching scheduler can achieve stability under almost all kinds of traffics. And simulation results show that the delay performance of DPS with simple maximal matching scheduler is almost as good as OQ(Output-Queueing) switches.
作者 方仲瑄 吴俊
出处 《淮阴师范学院学报(自然科学版)》 CAS 2008年第2期135-139,共5页 Journal of Huaiyin Teachers College;Natural Science Edition
基金 江苏省教育厅自然科学基金资助项目(06KJB520132)
关键词 交换机 输入队列 调度算法 稳定性 switch input-queueing scheduling algorithm stability
  • 相关文献

参考文献8

  • 1[1]Karol M J,Hluchyj M,Morgan S.Input versus output queueing on a space-division packet switch[J].IEEE Traans.On Communications,1987,35(7):1347-1356. 被引量:1
  • 2[2]Dai J M,Prabhakar B.The throughput of data switches with and without speedup[M].In:Proceedings of INFOCOM IEEE Communications Society,2000.556-564. 被引量:1
  • 3吴俊,陈晴,罗军舟.线路速率缓存的重端口交换机方案及行为分析[J].软件学报,2003,14(12):2060-2067. 被引量:4
  • 4[4]McKeown,N.The iSLIP scheduling algorithm for input-queued switches[J].IEEE,Transaction on Networking,1999,7(2):188-201. 被引量:1
  • 5[5]Serpanos D N,Antoniadis P I.FIRM:a class of distributed scheduling algorithms for high-speed ATM switches with multiple input queues[C].In:Proceedings of the IEEE INFOCOM.IEEE Communications Society,2000,548-555. 被引量:1
  • 6[6]Chao H J.Saturn:a terabit packet switch using Dual Round-Robin[J].IEEE Communication Magazine,2000,38(12):78-84. 被引量:1
  • 7[7]Li Y H,Panwar S,Chao H J.On the Performance of a Dual Round-Robin Switch[C].In:Proceedings of the IEEE INFOCOM.IEEE Communications Society,2001.1688-1697. 被引量:1
  • 8[8]Kleinrock L.Nomadic computing and smart spaces[J].IEEE Internet Computing,2000,4(1):52-53. 被引量:1

二级参考文献14

  • 1[1]Karol M, Hluchyj M, Morgan S. Input versus output queuing on a space division switch. IEEE Transactions on Communications, 1987,35(12):1347~1356. 被引量:1
  • 2[2]McKeown N, Anantharam V, Walrand J. Achieving 100% throughput in an input-queued switch. IEEE Transactions on Communications, 1999,47(8):1260~1267. 被引量:1
  • 3[3]Mekkittikul A, Mckeown N. A practical algorithm to achieve 100% throughput in input-queued switches. In: Guerin R, ed. Proceedings of the IEEE INFOCOM'98. San Francisco: IEEE Computer Society Press, 1998. 792~799. 被引量:1
  • 4[4]Prabhakar B, Mckeown N. On the speedup required for combined input- and output-queued switching. In: Proceedings of the 1998 IEEE International Symposium on Information Theory. Cambridge: IEEE Information Theory Society Press, 1998. 165. 被引量:1
  • 5[5]Leonardi E, Mellia M, Neri F, Marsan MA. On the stability of input-queued switches with speed-up. IEEE/ACM Transactions on Networking, 2001,9(1):104~118. 被引量:1
  • 6[6]Krishna P, Patel NS, Charny A, Simcoe RJ. On the speedup required for work-conserving crossbar switches. IEEE Journal on Selected Areas in Commutations, 1999,17(6):1057~1066. 被引量:1
  • 7[7]Stoica I, Zhang H. Exact emulation of an output queuing switch by a combined input output queuing switch. In: Guerin R, ed. Proceedings of the 6th International Workshop on Quality of Service. Napa: IEEE Communication Society Press, 1998. 218~224. 被引量:1
  • 8[8]Chuang ST, Goel A, McKeown N, Prabhakar B. Matching output queuing with a combined input/output queued switch. IEEE Journal on Selected Areas in Commutations, 1999,17(6):1030~1039. 被引量:1
  • 9[9]Kleinrock L. Nomadic computing and smart spaces. IEEE Internet Computing, 2000,4(1):52~53. 被引量:1
  • 10[10]Zhang H. Service disciplines for guaranteed performance service in packet-switching networks. Proceedings of the IEEE, 1995, 83(10):1374~1396. 被引量:1

共引文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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