期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

基于随机进程代数的Overlay网络上的QoS性能评价 被引量：1

Based on Stochastic Process Algebra Overlay Network QoS Performance Evaluation
在线阅读 下载PDF
导出
摘要 论述了对Overlay网络中组播的服务质量进行量化评价的必要性,引入了组播树二度同胚约简的概念,推广了Bowman评价单播数据流服务质量的随机进程代数方法,提出用随机进程代数对Overlay网络中组播的服务质量进行评价的建模方案,并用PEPA workbench模拟工具针对具体的组播实例的服务质量进行了定量分析.模拟结果表明,传统网络中的IP组播抖动小于Overlay网络中的组播抖动;而后者又进一步小于在传统网络中用单播技术来实现组播时的抖动,与实际情况吻合. The arguments on the necessary for quantized evaluation toward quality of services （QoS） of multicast in Overlay networks are given. The concept of two-degree homeomorphism reduction multicast tree is introduced, extend Bowman＇s method for evaluating QoS of unicast dataflow by using stochastic process algebra （SPA） is promoted, a modeling scheme is proposed for quantized evaluating QoS of concrete multicast instances in Overlay networks with simulation tool PEPA workbench. Simulation suggests that the jitter of IP multicast is lighter than the jitter of Overlay multicast, and the latter is further lighter than the jitter of multicast by using unicast technique.
作者 潘耘 王励成 余镇危 梁辉
机构地区 中国传媒大学计算机学院 北京邮电大学信息安全中心 中国矿业大学(北京)计算机系 中国传媒大学信息工程学院
出处 《北京邮电大学学报》 EI CAS CSCD 北大核心 2009年第B04期129-133,共5页 Journal of Beijing University of Posts and Telecommunications
基金 国家自然科学基金项目(90718001) 中国传媒大学"211工程"和"382人才工程"项目
关键词 随机进程代数 OVERLAY 服务质量 stochastic process algebras Overlay quality of services
分类号 TP393 [自动化与计算机技术—计算机应用技术]
  • 相关文献

参考文献10

  • 1Clark D D, Lehr W, Bauer S J. Overlay networks and future of the Internet[J]. Journal of Communications and Strategies, 2006, 3(63) : 1-21.
  • 2Shi S Y, Turner J S. Multicast routing and bandwidth dimensioning in overlay networks[J]. IEEE Journal on Selected Areas in Communications, 2002, 20 (8): 1444-1455.
  • 3Brosh E, Levin A, Shavitt Y. Approximation and heuristic algorithms for minimum delay application-layer multicast trees[J]. IEEE/ACM Transactions on Networking, 2007, 15(2): 473-484.
  • 4Subramanian L, Stoica I, BalKrishnan H, et al. Over- QoS: an overlay based architecture for enhancing Internet QoS [C]// Proceedings of the USENIX 1st Symp on Networked System Design and Implementation (NSDI 2004). San Francisco: USENIX Press, 2004: 71-84.
  • 5Happe J, Firus V. Using stochastic petri nets to predict quality of service attributes of component-based software architectures [EB/OL]. [2008-10-25 ]. http://sdq.ipd. uka. de/people/jens_happe/publications.
  • 6Liu Yong, Chen-Khong Tham, Jiang Yuming. A calculus for stochastic QoS analysis[J]. Performance Evaluation, 2007, 64(6) : 547-572.
  • 7Bowman H, Bryans J W, Derrick J. Analysis of a multimedia stream using stochastic process algebra [J]. The Computer Journal, 2001, 44(4) : 230-245.
  • 8Fourneau J M, Kloul L, Valois F. Performance modeling of hierarchical cellular networks using PEPA[J]. Performance Evaluation, 2002, 50(2): 83-99.
  • 9林闯,魏丫丫.随机进程代数与随机Petri网[J].软件学报,2002,13(2):203-213. 被引量：27
  • 10Hillston J, Gilmore S. Performance evaluation process algebra[EB/OL]. [2009-02-27]. http:// www. dcs. ed. ac. uk/pepa/.

二级参考文献53

  • 1Buchholz, P. Lumpability and nearly-lumpability in hierarchical queueing networks. In: Computer Performance and Dependability Symposium. 1995. 82～91. http://www.ieee.org.
  • 2Brinksma, Ed. Stochastic process algebras: Linking process descriptions with performance. 1999 IFIP TC6/WG6.1 Joint International Conference (FORTE/PSTV'99) on Formal Description Techniques (FORTE XLL) for Distributed Systems and Communication Protocols, and Protocol Specification, Testing, and Verification (PSTV XIX). 1999.
  • 3Hachtel, G., Macii, E., Padro, A., et al. Markovian analysis of large finite-state machines. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1996,15(12):1479～1493.
  • 4Bolognesi, T., Lucidi, F., Trigila, S. Converging towards a timed LOTOS standard. Computer Standards and Interfaces, 1994,16(2): 87～118.
  • 5Leonard, L., Leduc, G. An introduction to ET-LOTOS for the description of time sensitive systems. Computer Networks and ISDN Systems, 1997,29(3):271～292.
  • 6Schneider, S. An operational semantics for timed CSP. Information & Computation, 1995,116(2):193～213.
  • 7Moller, F., Tofts, C. A temporal calculus of communicating systems. In: Baeten, J.C.M., Klop, J-W., eds. Proceedings of Concur'90: Theories of Concurrency-Unification and Extension. LNCS 458, Amsterdam: Springer-Verlag, 1990. 401～415.
  • 8Wang, Y. Real-Time behaviour of asynchronous agents. In: Baeten, J.C.M., Klop, J-W., eds. Concur'90: Theories of Concurrency- Unification and Extension. LNCS 458, Amsterdam: Springer-Verlag, 1990. 502～520.
  • 9Herzog, U. Formal description, time and performance analysis: a framework. Technical Report 15/90. IMMD VII, Friedrich- Alexander-universitat, Erlangen-Nurnberg, Germany, 1990.
  • 10Gilmore, S., Hillston,J. The PEPAWorkbench: a tool to support a process algebra-based approach to performance modeling. In: Haring, G., Kotsis, G., eds. Proceedings of Modeling Techniques and Tools for Computer Performance Evaluation. LNCS794, 1994.

共引文献26

同被引文献4

引证文献1

二级引证文献6

北京邮电大学学报
2009年 第B04期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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