期刊文献+

WDM网络动态组播业务疏导算法 被引量:1

Dynamic multicast traffic grooming in WDM networks
原文传递
导出
摘要 在波分复用(WDM)网络中,为了提高网络资源的利用率,降低网络成本,该文对动态组播业务疏导问题进行了研究。给出了受网络资源约束的动态组播业务疏导网络模型,提出了一种具有服务质量控制能力的疏导算法,用从源节点到各目的节点经过的最大光路数来衡量服务质量。该文对算法的连接请求阻塞率进行了仿真。仿真结果表明,连接请求要求的服务质量越高,阻塞率越高;当服务质量要求降低到一定程度之后,阻塞率随服务质量的变化很小。用户可以在服务质量和阻塞率之间寻求折衷。 Dynamic multicast traffic grooming in WDM networks was analyzed to minimize networkwide costs and increase the network resource utilization. A network model was developed for dynamic multicast traffic grooming with resource constraints and an algorithm which can provide quality of service (QoS) was proposed. The QoS is measured by the maximum number of lightpaths passing between the source and the destinations. The blocking probability of the algorithm was assessed in simulations. The results show that a higher QoS requirement results in higher blocking probability, and when the QoS requirement is low, changes in the QoS requirements have only small effects on the blocking probability.
出处 《清华大学学报(自然科学版)》 EI CAS CSCD 北大核心 2005年第4期437-440,共4页 Journal of Tsinghua University(Science and Technology)
关键词 光纤通信 业务疏导 波分复用(WDM) 动态组播业务 optical communication traffic grooming wavelength division multiplexing (WDM) dynamic multicast traffic
  • 相关文献

参考文献6

  • 1Durra R, Rouskas G, Carolina N. Traffic grooming in WDM networks: Past and future [J]. IEEE Network, 2002,16(6) : 46 - 56.
  • 2ZHU K, Mukherjee B. Traffic grooming in an optical WDM mesh network [J].IEEE JSAC, 2002, 20(1): 122-133.
  • 3Dutta R, Rouskas G, Carolina N. On optimal traffic grooming in WDM rings [J].IEEE JSAC, 2002, 20(1):110 - 121.
  • 4WEN Haibo, HE Rongxi, LI Lemin, et al. Dynamic traffic-grooming algorithms in wavelength-division-multiplexing mesh networks[J]. Journal of Optical Networking, 2003, 2(4): 100- 111.
  • 5Kamal A, UI-Mustafa R. Multicast traffic grooming in WDM networks [A]. Proceedings of Opticomm03 [C].Dallas TX, USA: Opticomm, 2003.
  • 6Takahashi H, Matsuyama A. An approximate solutiong in the Steiner problem in graphs[J]. Math Japonica, 1980,24(6) : 573 - 577.

同被引文献12

  • 1廖露华,温海波,王晟,李乐民.WDM疏导网络中一种新的多播业务路由算法[J].光电子.激光,2007,18(2):200-203. 被引量:10
  • 2HUANG X, FARAHMAND F, JUE J P. An Algorithm for Traffic Grooming in WDM Mesh Networks with Dynamically Changing Light-Trees[J].J.Lightwave Technol., 2005,23 : 3178-3180
  • 3CHLAMTAC I, GANZ A, KARMI G. Lightpath communications:an approach to high bandwidth optical WAN's. IEEE Trans. Commun., 1992,40 (2) : 1171-1182.
  • 4SAHASRABUDDHE L H,MUKHERJEE B. Light trees:optical multicasting for improved performance in wavelength routed networks[J]. IEEE, Communications Magazine, 1999,37(2) :67-73, 1999.
  • 5KAMAL E A. Algorithms for Multicast Traffic Grooming in WDM Mesh Networks[J]. IEEE Communications, 2006,44 ( 11 ) :96-105.
  • 6BAYVEL P. Future high-capacity optical telecommunication networks [J].Philosphical Trans.of the Royal Soc.of London:Math,Phys.and Eng.Sciences,2000,358( 1 ) :303-329.
  • 7CHOWDHARY G,MURTHY C S R. Grooming ofmulticast sessions in wdm mesh networks[M], in Workshop on Traffic Grooming, 2004.
  • 8CHOWDHARY G,MURTHY C S R. Dynamic multicast traffic engineering in wdm groomed mesh networks [C]. in Workshop on Traffic Grooming, 2004.
  • 9HWANG F, RICHARDS D, WINTER P. The Steiner tree problem[M]. Elsevier Science Publishers, 1992.
  • 10HUANG X, FARAHMAND F, ZI-IANG T, et al.Dynamic multicast traffic grooming in WDM networks with reconfigurable light-trees[J/OL], http://www.utd.edu/- ffarid/published/dynamicmulticast .pdf, 2004.

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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