Share Email Print
cover

Proceedings Paper

Research on a light tree generating algorithm applied to optical layer dynamic multicast traffic grooming
Author(s): Jijun Zhao; Shuguang Zhang; Zhiyuan Tang; Lirong Wang
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper 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.

Paper Details

Date Published: 19 November 2008
PDF: 9 pages
Proc. SPIE 7137, Network Architectures, Management, and Applications VI, 71372O (19 November 2008); doi: 10.1117/12.803111
Show Author Affiliations
Jijun Zhao, Hebei Univ. of Engineering (China)
Shuguang Zhang, Hebei Univ. of Engineering (China)
Zhiyuan Tang, Hebei Univ. of Engineering (China)
Lirong Wang, Hebei Univ. of Engineering (China)
Handan Polytechnic College (China)


Published in SPIE Proceedings Vol. 7137:
Network Architectures, Management, and Applications VI
Weisheng Hu; Shoa-Kai Liu; Ken-ichi Sato; Lena Wosinska, Editor(s)

© SPIE. Terms of Use
Back to Top