Share Email Print

Proceedings Paper

Performance optimization of intelligent optical networks by multiple alternate routes based on the K-shortest path algorithm
Author(s): Xinyou Cui; Xiaoping Zheng; Hanyi Zhang; Yanhe Li; Yili Guo
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Blocking probability is one of the key factors to evaluate the routing and wavelength algorithms for intelligent optical network. Two kinds of Dynamic K-Shortest Path (DKSP) Algorithms were designed. One is based on Linear Link Weight Function (LW) and the other is based on Piecewise Linear Link Weight Function (PLW). It was found that the two kinds of DKSP can significantly decrease the blocking probability of optical network comparing to the static KSP for the same number of alternate routes. Compared to routing with LW, the coefficient of PLW has larger effect on the blocking probability of optical network when the number of alternate route is small, but the effect is weakened with the increase of the number of alternate route. As far as the two kinds of DKSP algorithms are concerned, DKSP with PLW has some advantage over DKSP with LW on decreasing the blocking probability. It was also found that the optimized performance can almost be got by DKSP with only 2~4 alternate routes for NSFNET.

Paper Details

Date Published: 28 September 2006
PDF: 8 pages
Proc. SPIE 6354, Network Architectures, Management, and Applications IV, 63542O (28 September 2006);
Show Author Affiliations
Xinyou Cui, Tsinghua Univ. (China)
Xiaoping Zheng, Tsinghua Univ. (China)
Hanyi Zhang, Tsinghua Univ. (China)
Yanhe Li, Tsinghua Univ. (China)
Yili Guo, Tsinghua Univ. (China)

Published in SPIE Proceedings Vol. 6354:
Network Architectures, Management, and Applications IV
Yong Hyub Won; Gee-Kung Chang; Ken-ichi Sato; Jian Wu, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?