Research on a light tree generating algorithm applied to optical layer dynamic multicast traffic grooming

Jijun Zhao; Shuguang Zhang; Zhiyuan Tang; Lirong Wang

doi:10.1117/12.803111

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.

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

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available

Members: $17.00

Non-members: $21.00 ADD TO CART

PROCEEDINGS
9 PAGES

DOWNLOAD PAPER SAVE TO MY LIBRARY

GET CITATION

RIGHTS & PERMISSIONS

Get copyright permission Get copyright permission on Copyright Marketplace

KEYWORDS

Light

Transceivers

Optical networks

Wavelength division multiplexing networks

Algorithms

Wavelength division multiplexing

Network architectures

Show All Keywords

Keywords/Phrases

Search In:

Publication Years