期刊文献+

分组的端到端延时上限 被引量:2

End-to-end delay bound of packets
下载PDF
导出
摘要 研究了分组交换网络中分组的端到端延时上限。证明了在节点处理速率恒定的情况下,一个流的最大分组在除首节点外的任意节点都不会遭遇队列延时,根据此结论得到了该流任意分组的端到端延时上限。将该结果推广到实际网络中,得到了当多个流共享同一条传输路径时任意流任意分组的端到端延时上限。模拟实验结果验证了理论推导公式的正确性。 The end-to-end delay hound of packets was studied. It was proved that the maximum packet of a flow will never suffer queuing delay when it is forwarded in a fixed rate network, thus, the end-to-end delay hound of any packets was obtained. Moreover, the results were generalized to practical packet switching networks, and the end-to-end delay bound in practical networks was obtained. A simulation was given to support the theoretical results.
出处 《中南大学学报(自然科学版)》 EI CAS CSCD 北大核心 2006年第1期135-140,共6页 Journal of Central South University:Science and Technology
基金 国家自然科学基金资助项目(90304010)
关键词 端到端延时 分组调度 服务质量 end-to-end delay packet scheduling quality of service(QoS)
  • 相关文献

参考文献12

  • 1Demers A, Keshav S, Shenkar S. Analysis and simulation of a fair queueing algorithm[J]. Internetworking:Research and Experience, 1990,1 (1) : 3 - 26.
  • 2Zhang L. Clock V. A new traffic control algorithm for packet switching networks[C]. Proceedings of ACM SIGCOMM'90. Philadelphia, 1990:19-29.
  • 3Golestani S. A self-clocked fair queueing scheme for broadband applications[C]. Proceedings of IEEE IN-FOCOM'94. Toronto, 1994:636 - 646.
  • 4Shreedhar M, Varghese G. Efficient fair queuing using deficit round robin[J]. IEEE/ACM Transactions on Networking, 1996,4(3) : 375 -385.
  • 5Parekh A K, Gallager R G. A generalized processor sharing approach to flow control in integrated services networks:the single-node case[J]. IEEE/ACM Transactions on Networking, 1993,1(3) : 344 - 357.
  • 6Parekh A, Gallager R. A Generalized processor sharing approach to flow control in integrated services networks: the multiple-node case[J]. IEEE/ACM Transactions on Networking, 1994,2(2):137 - 150.
  • 7Goyal P, Vin H M. Generalized guaranteed rate-scheduling algorithms: a framework[J]. IEEE/ACM Transactions on Networking, 1997,5 (4) : 561 - 571.
  • 8Siliadis D, Varma A. Latency-rate servers: a general model for analysis of traffic scheduling algorithms[J].IEEE/ACM Transactions on Networking, 1998,6 (5):611 - 624.
  • 9Tsao S, Lin Y. Pre-order deficit round robin: a new scheduling algorithm for packet-switched networks[J].Computer Networks, 2001,35(2 - 3) :287 - 305.
  • 10Bensaou B, Tsang D H K, Chan K T. Credit-based fair queuing (CBFQ): a simple service-scheduling algorithm for packet switched networks [J]. IEEE/ACM Transactions on Networking, 2001,9(5) : 591-604.

同被引文献27

引证文献2

二级引证文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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