Translator Disclaimer
Paper
8 February 2005 Optimization problem for forseeable lightpath demands
Author Affiliations +
Abstract
The foreseeable lightpath demands (FLD) include scheduled lightpath demands (SLD) and predictable lightpath demands (PLD, lightpath demands that can be approximatively forecasted through the history traffic record). Since the time disjointness each FLD, the network planner can design the capacity of the network more compactly. We formulate the routing and wavelength assignment (RWA) problem when network dimensioning is coupled as the Integer linear programming (ILP) which includes the link formulation and path formulation. To reduce the computing complexity, a new routing algorithm based on the consideration of backup path is proposed. The software experiment is run and shows that the gain is about 20% when the backup path needs to be setup. At last we propose a new RWA algorithm to adapt the FLDs and dynamic traffic into the wavelength routing network.
© (2005) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Jianli Zhao and Yuefeng Ji "Optimization problem for forseeable lightpath demands", Proc. SPIE 5626, Network Architectures, Management, and Applications II, (8 February 2005); https://doi.org/10.1117/12.575011
PROCEEDINGS
8 PAGES


SHARE
Advertisement
Advertisement
RELATED CONTENT


Back to Top