Share Email Print
cover

Proceedings Paper

A simulation study on hierarchical routing in ASON networks
Author(s): Yinghui Qiu; Runze Wu; Yuefeng Ji; Daxiong Xu
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

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

Paper Details

Date Published: 19 November 2007
PDF: 4 pages
Proc. SPIE 6784, Network Architectures, Management, and Applications V, 67840U (19 November 2007); doi: 10.1117/12.745988
Show Author Affiliations
Yinghui Qiu, North China Electric Power Univ. (China)
Runze Wu, North China Electric Power Univ. (China)
Yuefeng Ji, Beijing Univ. of Posts and Telecommunications (China)
Daxiong Xu, Beijing Univ. of Posts and Telecommunications (China)


Published in SPIE Proceedings Vol. 6784:
Network Architectures, Management, and Applications V
Jianli Wang; Gee-Kung Chang; Yoshio Itaya; Herwig Zech, Editor(s)

© SPIE. Terms of Use
Back to Top