期刊文献+

WDM网状网络中一种动态多播自适应业务疏导算法 被引量:8

An adaptive algorithm for dynamic multicast traffic grooming in WDM mesh networks
原文传递
导出
摘要 光多播业务需要消耗大量的WDM光网络带宽资源,业务疏导是光多播网络降低业务请求阻塞率和提高带宽资源利用率的有效方法。提出了一种新型光多播疏导节点结构,研究了疏导端口优先的多播业务疏导算法(TGPFA)和新建光树优先的多播业务疏导算法(TCLFA),进而提出了一种能够适应网络资源变化的动态多播业务疏导算法(ADMGA)。结果表明,在网络资源有限的情况下,ADMGA算法能取得较低的请求阻塞率和带宽阻塞率,获得较好的网络性能。 Optical multicast traffics need to consume a large number of wavelength division multiplexing (WDM) optical network bandwidth resources, and the gap between the bandwidth capacity offered by a wavelength and the bandwidth required by the multicast request is very large. So,traffic grooming is an effective method adopted to reduce the traffic request blocking probability and to improve the utilization of wavelength bandwidth resources for optical multicast networks. A novel optical multicast traffic grooming node architecture with two-level switching is proposed in this paper. The traffic grooming port first algorithm (TGPFA) and the traffic constructing the new light-tree first algorithm (TCLFA) are researched for the architecture respectively to reduce the traffic blocking probability. Moreover, an adaptive dynamic multicast grooming algorithm (ADMGA) based on TCLFA and TGPFA is brought forward to adapt to the network available wavelength resources dynamically. By setting a threshold function cprresponding to the network available bandwidth, the ADMGA algorithm can select the appropriate method to groom the new arriving multicast traffic request to the assigned wavelength with residual bandwidth. The simulation analysis and results show that the proposed ADMGA algorithm can reduce the request blocking probability,decrease the bandwidth blocking ratio and improve the wavelength bandwidth utilization for the WDM network with limited wavelength bandwidth resource.
出处 《光电子.激光》 EI CAS CSCD 北大核心 2013年第1期69-74,共6页 Journal of Optoelectronics·Laser
基金 国家自然科学基金(61071117) 重庆市教委自然科学基金(KJ110527) 重庆市科委自然科学基金(CSTC 2010BB2413)资助项目
关键词 WDM网状网 光多播 业务疏导 自适应动态疏导 光树 阻塞率 wavelength division multiplexing (WDM) mesh networks optical multicast traffic grooming adaptive dynamic grooming light-tree blocking probability
  • 相关文献

参考文献5

二级参考文献59

  • 1何荣希,温海波,王光兴,李乐民.WDM疏导网络的共享子通路保护算法[J].光电子.激光,2004,15(8):935-940. 被引量:5
  • 2章小宁,李乐民,赵太飞,王晟.WDM网状网中鲁棒选路算法研究[J].光电子.激光,2006,17(11):1351-1355. 被引量:3
  • 3M. Shtaif and M. Boroditsky, IEEE Photon. Technol. Lett. 15, 1369 (2003).
  • 4E Roy, C. Francia, F. Bruyere and D. Penninckx, Proc. Tech. Dig. OFC/IOOC', TuS4 (1999).
  • 5J. Rasmussen, Proc. Tech. Dig. ECOC, 2002.
  • 6M. Shtaif, A. Mecozzi, M. Tur and J. Nagel, IEEE Photon.Technol. Lett. 12, 434 (2000).
  • 7Fred Buchali and Henning Billow, Journal of Lightwave Technology 22, 1116 (2004).
  • 8Nobuhiko Kikuchi, Journal of Lightwave Technology 19,480 (2001).
  • 9Kennedy and R. Eberhart, Proceedings of IEEE International Conference on Neural Networks, 1942 (1995).
  • 10Xiaoguang Zhang, Yuan Zheng, Yu Shen, Jianzhong Zhang and Bojun Yang, IEEE Photon. Technol. Lett. 17, 85 (2005).

共引文献17

同被引文献102

  • 1张琨,王珩,刘凤玉.一种时延约束的多共享组播树构造算法[J].南京理工大学学报,2006,30(2):127-131. 被引量:4
  • 2廖露华,温海波,王晟,李乐民.WDM疏导网络中一种新的多播业务路由算法[J].光电子.激光,2007,18(2):200-203. 被引量:10
  • 3秦浩,张奭,刘增基,张冰.波长转换受限条件下的最优组播波长分配算法[J].光子学报,2007,36(5):856-860. 被引量:2
  • 4HUANG Qi-rui, ZHONG Wen-de. A wavelength-routed mul- ticast packet switch with a shared-FDL buffer[J].Light- wave Technology, 2010,28(19) : 2822-2829.
  • 5Ahlswede R, Cai N, Li S Y R. Network information flow[J]. IEEE Trans. Inf. Theory, 2000,46(4) : 1204-1216.
  • 6Mantey E D, Deogun J S, Lisong X. Network coding for optical-layer multicast[A]. Broadband Communications, Networks and Systems[C]. 2008,452-459.
  • 7Minkyu Kim,Medard M O'Reilly. Network coding and its implications on optical networking [A]. Optical Fiber Communication[C]. 2009, 1-3.
  • 8Kim M,Ahn C W,Medard M. On minimizing network cod- ing resources: An evolutionary approach [A]. Network Coding Workshop[C]. 2006.
  • 9Richey M B, Parker R G. On multiple steiner subgraph problems[J]. Networks, 1986,16(4) : 423-438.
  • 10Fragouli C,Soljanin E. Information flow decomposition for network coding [J]. IEEE Transactions on Information Theory, 2006,52(3) : 829-848.

引证文献8

二级引证文献12

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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