Mr. Shuguang Zhang Profile

Shuguang Zhang

at Hebei Univ of Engineering

SPIE Involvement:

Author

Publications (1)

This will count as one of your downloads.

You will have access to both the presentation and article (if available).

DOWNLOAD NOW

This content is available for download via your institution's subscription. To access this item, please sign in to your personal account.

Email or Username Forgot your username?

Password Forgot your password?

Show

Keep me signed in

No SPIE account? Create an account

Proceedings Article | 19 November 2008 Paper

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

Jijun Zhao, Shuguang Zhang, Zhiyuan Tang, Lirong Wang

Proceedings Volume 7137, 71372O (2008) https://doi.org/10.1117/12.803111

KEYWORDS: Light, Transceivers, Optical networks, Wavelength division multiplexing networks, Wavelength division multiplexing, Algorithms, Network architectures, Logic, Video, Electronics engineering

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

My Library

You currently do not have any folders to save your paper to! Create a new folder below.

Folder Name

Folder Description

View contact details

UPDATE YOUR PROFILE

Is this your profile? Update it now.

Sign into your SPIE.org account

Don’t have a profile and want one?

Create an account on SPIE.org

Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks. You are receiving this notice because your organization may not have SPIE eBooks access.*

*Shibboleth/Open Athens users─please sign in to access your institution's subscriptions.

To obtain this item, you may purchase the complete book in print or electronic format on SPIE.org.

ORGANIZATIONAL
Sign in with credentials provided by your organization.

Organizational Username

Organizational Password

Show/Hide Password

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:

Non-members: ADD TO CART

Keywords/Phrases

Search In:

Publication Years