CONFERENCE PROCEEDINGS
Advanced Search >
Home > Proceedings > Volume 7137 > Article
Translator Disclaimer
19 November 2008 Research on a light tree generating algorithm applied to optical layer dynamic multicast traffic grooming
Jijun Zhao; Shuguang Zhang; Zhiyuan Tang; Lirong Wang
Author Affiliations +
Proceedings Volume 7137, Network Architectures, Management, and Applications VI; 71372O (2008) https://doi.org/10.1117/12.803111
Event: Asia-Pacific Optical Communications, 2008, Hangzhou, China
Abstract
Though analyzing and summarizing the strategies of dynamic multicast traffic grooming, the strategies embody that which optimization criterion would be chose for the requirement of low-speed multicast service to select grooming routing in the grooming network, and the different strategic combination would obtain the different effect of multicast traffic grooming. On this basis, the Light Tree based Integrated Grooming (LTIG) and the Markov Finite Horizon Decision Algorithm of Shortest Path Tree are studied deeply, The research indicates that what the min-cost grooming routing calculation of LTIG adopts is MPH algorithm and Dijikstra algorithm which has higher complexity. But the Markov Finite Horizon Decision Algorithm of Shortest Path Tree has low complexity and it only seeks solutions in General network and isn't applicable to multicast traffic grooming. Subsequently, the Markov Finite Horizon Decision Algorithm of Shortest Path Tree is introduced to LTIG algorithm and a new MTGA-SPT algorithm is proposed. MTGA-SPT algorithm can resolve the route selection problem of resource node to multi-destination nodes, thus forming the light tree. Through the analysis of algorithm complexity, the complexity of MTGA-SPT algorithm mainly depends on the calculation of traffic grooming routing, and adopts the Markov Finite Horizon Decision Algorithm of Shortest Path Tree to compute min-cost grooming routing, making the complexity of MTGA-SPT algorithm descended, The complexity of Markov Finite Horizon Decision Algorithm of Shortest Path Tree is O((V-1)•W), and other step algorithm complexity is about O(V). To sum up, MTGA-SPT algorithm can reduce the time delay effectively.
© (2008) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Citation Download Citation
Jijun Zhao, Shuguang Zhang, Zhiyuan Tang, and Lirong Wang "Research on a light tree generating algorithm applied to optical layer dynamic multicast traffic grooming", Proc. SPIE 7137, Network Architectures, Management, and Applications VI, 71372O (19 November 2008); https://doi.org/10.1117/12.803111
PROCEEDINGS
 9 PAGES
DOWNLOAD PDF SAVE TO MY LIBRARY
SHARE
GET CITATION
< Previous Article
|
Next Article >
Advertisement
Advertisement
KEYWORDS
RELATED CONTENT
Subscribe to Digital Library
Receive Erratum Email Alert
Back to Top