Share Email Print

Proceedings Paper

Dynamic traffic grooming using hop constraint lightpath establishment approach
Author(s): Tong Ye; Qingji Zeng; Guolong Zhu; Junjie Yang
Format Member Price Non-Member Price
PDF $17.00 $21.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

This paper considers the dynamic routing issues in WDM grooming networks. Given network resources, a major objective of a routing algorithm is to minimize the blocking probability of connection requests. Wavelengths and transceivers are usually limited resources in a network. The way to use these resources directly determines the network performance. So the challenge is how to use wavelength resources efficiently while keeping higher transceiver-utilization efficiency. To solve this problem, we develop an approach called Hop Constrain Lightpath Establishment Approach (HCLEA). The main idea of HCLEA is to guide the routing algorithms not to create inefficient long lightpaths. Simulation results show that HCLEA does improve the network performance in terms of transceiver-utilization efficiency, wavelength-utilization utilization, and bandwidth blocking ratio.

Paper Details

Date Published: 8 February 2005
PDF: 8 pages
Proc. SPIE 5626, Network Architectures, Management, and Applications II, (8 February 2005); doi: 10.1117/12.576147
Show Author Affiliations
Tong Ye, Shanghai Jiaotong Univ. (China)
Qingji Zeng, Shanghai Jiaotong Univ. (China)
Guolong Zhu, Shanghai Jiaotong Univ. (China)
Junjie Yang, Shanghai Jiaotong Univ. (China)

Published in SPIE Proceedings Vol. 5626:
Network Architectures, Management, and Applications II
S. J. Ben Yoo; Gee-Kung Chang; Guangcheng Li; Kwok-wai Cheung, Editor(s)

© SPIE. Terms of Use
Back to Top