Optimization problem for forseeable lightpath demands

Jianli Zhao; Yuefeng Ji

doi:10.1117/12.575011

8 February 2005 Optimization problem for forseeable lightpath demands

Jianli Zhao, Yuefeng Ji

Proceedings Volume 5626, Network Architectures, Management, and Applications II; (2005) https://doi.org/10.1117/12.575011
Event: Asia-Pacific Optical Communications, 2004, Beijing, China

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.

Citation Download Citation

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

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