期刊文献+

Bandwidth allocation algorithm for aggregated tree in optical networks

Bandwidth allocation algorithm for aggregated tree in optical networks
下载PDF
导出
摘要 Wavelength and bandwidth allocation is important for multicast communication in optical networks. In this paper,a new method based on scheduling theory is proposed. The proposed method formulates wavelength bandwidth capacity as a large rectangle and these multicast stream bandwidth requirements as small rectangles. It treats the wavelength and bandwidth allocation question as a rectangle packing problem. The proposed algorithm solves the problem by taking quasi-human strategy with Euclidian distance. It is an effective heuristic algorithm to quickly solve multicast stream bandwidth allocation problem in optical networks by theoretic analysis. Further simulation experiments show the bandwidth allocation algorithm can increase network utilization and have a good fairness performance for unicast stream and multicast stream in optical networks. The results indicate the effectiveness of the algorithm. Wavelength and bandwidth allocation is important for multicast communication in optical networks. In this paper, a new method based on scheduling theory is proposed. The proposed method formulates wavelength bandwidth capacity as a large rectangle and these multicast stream bandwidth requirements as small rectangles. It treats the wavelength and bandwidth allocation question as a rectangle packing problem. The proposed algorithm solves the problem by taking quasi-human strategy with Euclidian distance. It is an effective heuristic algorithm to quickly solve multicast stream bandwidth allocation problem in optical networks by theoretic analysis. Further simulation experiments show the bandwidth allocation algorithm can increase network utilization and have a good fairness performance for unicast stream and multicast stream in optical networks. The results indicate the effectiveness of the algorithm.
出处 《Journal of Chongqing University》 CAS 2013年第4期170-178,共9页 重庆大学学报(英文版)
基金 Funded by the Project "Research on Key Technology and System of next Generation Optical Access" of Open Foundation of State Key Laboratory of Optical Communication Technologies and Networks,Wuhan Research Institute of Posts&Telecommunications(No.2010OCTN-03)
关键词 MULTICAST wavelength and bandwidth allocation rectangle packing quasi-human strategy UTILITY multicast wavelength and bandwidth allocation rectangle packing quasi-human strategy utility
  • 相关文献

参考文献2

二级参考文献24

  • 1Lodi A, Martello S, Monaci M. Two-dimensional packing problems: a survey. Eur J Oper Res, 2002, 141:241 252.
  • 2Hopper E, Turton B. An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem. Eur J Oper Res, 2001, 128:34-57.
  • 3Baker B S, Jr C E G, Rivest R L. Orthogonal packings in two dimensions. SIAM J Comput, 1980, 9:846-855.
  • 4Berkey J O, Wang P Y. Two-dimensional finite bin-packing algorithms. J Oper Res Soc, 1987, 38:423-429.
  • 5Burke E K, Kendall C, Whitwell G. A new placement heuristic for the orthogonal stock-cutting problem. Oper Res, 2004, 4:655-671.
  • 6Huang W, Chen D, Xu R. A new heuristic algorithm for rectangle packing. Comput Oper Res, 2007, 34:3270-3280.
  • 7Huang W, He K. A caving degree approach for the single container loading problem. Eur J Oper Res, 2009, 196: 93-101.
  • 8Martello S, Pisinger D, Vigo D. The three-dimensional bin packing problem. Oper Res, 2000, 48:256-267.
  • 9Boef E D, Korst J, Martello S, et al. Erratum to "the three-dimensional bin packing problem": robot-packable and orthogonal variants of packing problems. Oper Res, 2005, 53:735-736.
  • 10Lesh N, Marks J, Mcmahon A, et al. Exhaustive approaches to 2D rectangular perfect packings. Inf Process Lett, 2004, 90:7-14.

共引文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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