期刊文献+

A statistical end-to-end performance model for networks with complex topologies

A statistical end-to-end performance model for networks with complex topologies
下载PDF
导出
摘要 Network calculus provides new tools for performance analysis of networks, but analyzing networks with complex topologies is a challenging research issue using statistical network calculus. A service model is proposed to characterize a service process of network with complex topologies. To obtain closed-form expression of statistical end-to-end performance bounds for a wide range of traffic source models, the traffic model and service model are expanded according to error function. Based on the proposed models, the explicit end-to-end delay bound of Fractional Brownian Motion(FBM) traffic is derived, the factors that affect the delay bound are analyzed, and a comparison between theoretical and simulation results is performed. The results illustrate that the proposed models not only fit the network behaviors well, but also facilitate the network performance analysis.
出处 《High Technology Letters》 EI CAS 2012年第3期308-313,共6页 高技术通讯(英文版)
基金 Supported by the National Natural Science Foundation Major Research Plan of China (No. 90718003), the National Natural Science Foundation of China (No. 60973027), and the National High Technology Research and Development Program of China (No. 2007AA01Z401 ).
关键词 statistical network calculus arrival curve service curve end-to-end delay bound 统计终端 统计模型 结构性能 网络拓扑 网络性能分析 交通模型 分数布朗运动 网络演算
  • 相关文献

参考文献13

  • 1Burchard A, Liebeherr J, Patek S. A min-plus calculus for end-to-end statistical service guarantees. IEEE Trans-actions on Communications, 2005, 52 ( 9 ) :4105-4114.
  • 2Liu Y, Chen-Khong T, Jiang Y M. A calculus for sto- chastic QoS analysis. Performance Evaluation, 2007, 64 (6) :547-572.
  • 3Jiang Y M. A basic stochastic network calculus. In: Pro- ceedings of ACM SIGCOMM Conference on Network Ar- chitectures and Protocols, New York, USA, 2006. 123- 134.
  • 4Yaron O, Sidi M. Performance and stability of communi- cation networks via robust exponential bounds. IEEE/ ACM Transactions on Networking, 1993, 1 (3) :372-385.
  • 5Starobinski D, Sidi M. Stochastically bounded burstiness for communication networks. IEEE Transactions on Infor- mation Theory, 2000, 46( 1 ):206-212.
  • 6Yin Q H, Jiang Y M, Jiang S M, et al. Analysis on gen- eralized stochastically bounded bursty traffic for communi- cation networks. In: Proceedings of the 27th Annual IEEE Conference on Local Computer Networks, USA 2002. 141-149.
  • 7Fan B H, Zhang H Y, Dou W H. A max-plus network calculus. In: Proceedings of 8th IEEE/ACIS Internation- al Conference on Computer and Information Science, Shanghai, China, 2009. 149-154.
  • 8Liu Y, Tham C, Jiang Y. A stochastic network calculus: [ Technical Report ]. Department of Electrical and Com- puter Engineering, National University of Singapore, 2003.
  • 9Ciucu F, Burchard A, Liebeherr J. Scaling properties of statistical end-to-end bounds in the network calculus. IEEE Transactions on Information Theory, 2006, 52 (6) : 2300-2312.
  • 10Jiang Y, Liu Y. Stochastic Network Calculus. London: Springer, 2008. 1-17.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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