A simulation study on hierarchical routing in ASON networks

Yinghui Qiu; Runze Wu; Yuefeng Ji; Daxiong Xu

doi:10.1117/12.745988

19 November 2007 A simulation study on hierarchical routing protocol in ASON networks

Yinghui Qiu, Runze Wu, Yuefeng Ji, Daxiong Xu

Proceedings Volume 6784, Network Architectures, Management, and Applications V; 67840U (2007) https://doi.org/10.1117/12.745988
Event: Asia-Pacific Optical Communications, 2007, Wuhan, China

Abstract

The routing technology is one of the key technologies in Automatic Switched Optical Networks (ASON). In this paper, we proposed a hierarchical approach for the dynamic establishment of constraint-based ligbtpaths in an ASON network. The algorithm performs multi-constraint path calculation on a transformed graph of interconnected border routers to find a feasible route based on the global state information present in each border router. We presented simulation results that have shown that the suggested scheme is capable of satisfying the requested with acceptable blocking probability at different traffic loads.

Citation Download Citation

Yinghui Qiu, Runze Wu, Yuefeng Ji, and Daxiong Xu "A simulation study on hierarchical routing protocol in ASON networks", Proc. SPIE 6784, Network Architectures, Management, and Applications V, 67840U (19 November 2007); https://doi.org/10.1117/12.745988

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