期刊文献+

基于统计网络演算的双漏桶模型带宽需求研究 被引量:1

Research on statistical network calculus-based bandwidth demand of dual leaky bucket models
下载PDF
导出
摘要 为满足双漏桶模型的业务流量需求,提出一种基于统计网络演算理论的带宽需求研究方案。该方案利用统计网络演算在分析业务时延性能方面的优势,由时延与带宽的关系建立出双漏桶模型业务流带宽需求的统计模型,对业务带宽需求进行了研究分析。数值分析结果表明了该方案的有效性和优越性,对网络合理分配带宽资源有一定的参考意义。 In order to meet the demand of dual leaky bucket models for traffic flow, this paper proposes a bandwidth demand re-search program based on statistical network calculus theory. Making use of the advantages of the statistical network calculus in analyzing traffic delay performance, this program establishes a statistical model for the bandwidth demand of the dual leaky bucket model traffic flow on the basis of the relationship between delay and bandwidth and conducts in-depth research and anal- ysis on traffic bandwidth demand. Numerical analysis results show that this program is effective and superior and has much value of reference for rational allocation of network bandwidth resource.
机构地区 西安通信学院
出处 《光通信研究》 北大核心 2013年第2期25-28,共4页 Study on Optical Communications
关键词 统计网络演算 双漏桶模型 带宽需求 statistical network calculus dual leaky bucket model bandwidth demand
  • 相关文献

参考文献7

  • 1Burchard A, Liebeherr J, Patek S D. A min-plus cal- culus for end-to-end statistical service guarantees [J]. IEEE Transactions on Information Theory, 2006, 52 (9) : 4105-4114.
  • 2Boorstyn R R, Burchard A, Liebeherr J, et al. Statis- tical service assurances for traffic scheduling algo- rithms [J]. IEEE J Sel Areas Commun, 2000, 18 (12) : 2651-2664.
  • 3庞斌,邵怀荣,高文.区分服务网络基于测量的接纳控制方案的设计与应用[J].计算机学报,2003,26(3):257-265. 被引量:10
  • 4CRUZ R L. A calculus for network delay, part Ⅰ and Ⅱ [J]. IEEE Transactions on Information Theory, 1991,37(1) :114-121.
  • 5LEBOUNDEC J Y, THIRAN P. Network Calculus [M]. London, Britain: Springer Verlag, 2004.
  • 6LI Chengzhi, BURCHARD A, LIEBEHERR J. A network calculus with effective bandwidth [J]. IEEE ACM Transaction on Networking, 2007, 15 (6): 1442-1453.
  • 7TANENBAUM A S.计算机网络[M].熊桂喜,等译.北京:清华大学出版社,2002:217-222.

二级参考文献24

  • 1Breslau L, Knightly E, Shenker S, Stoica I, Zhang H. Endpoint admission control: Architectural issues and performance. In: Proceedings of ACM SIGCOMM'00, Stockholm, Sweden, 2000. 57~69
  • 2Zhang Z, Duan Z, Gao L, Hou Y. Decoupling QoS control from core routers: Novel bandwidth broker architecture for scalable support of guaranteed services. In: Proceedings of ACM SIGCOMM'00, Stockholm, Sweden, 2000. 71~83
  • 3Centinkaya C, Knightly E. Scalable services via egress admission control. In: Proceedings of IEEE INFOCOM'00, Tel Aviv, Israel, 2000. 69~81
  • 4Elek V, Karson G, Ronngren R. Admission control based on end-to-end measurements. In: Proceedings of IEEE INFOCOM'00, Tel Aviv, Israel, 2000. 623~630
  • 5Qiu J, Knightly E. Measurement-based admission control with aggregate traffic envelopes. IEEE/ACM Transactions on Networking, 2001, 9(2): 199~21
  • 6Braden R, Clark D, Shenker S. Integrated services in the Internet architecture. IETF RFC 1633, 1994
  • 7Braden R, Zhang L, Berson S, Herzog S, Jamin S. Resource reservation protocol (RSVP) version1 functional specification. IETF RFC 2211, 1997
  • 8Blake S, Black D, Carison M, Davies E, Wang Z, Weiss W. An architecture for differentiated services. IETF RFC 2475, 1998
  • 9Huston G. Next steps for the IP QoS architecture. IETF RFC 2990, 2000
  • 10Parekh A K, Gallager R G. A generalized processor sharing approach to flow control in integrated service networks: The single-node case. IEEE/ACM Transactions on Networking, 1993, 1(3): 344~357

共引文献10

同被引文献13

引证文献1

二级引证文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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