Please use this identifier to cite or link to this item:
|Title:||Segmented protection path provisioning for capacity optimization in WDM mesh networks|
Segmented protection paths
Wavelength division multiplexing
|Citation:||Saradhi, C.V.,Wei, L.K.,Gurusamy, M. (2004). Segmented protection path provisioning for capacity optimization in WDM mesh networks. GLOBECOM - IEEE Global Telecommunications Conference 3 : 1775-1779. ScholarBank@NUS Repository.|
|Abstract:||In this paper, we consider the problem of routing and wavelength assignment (RWA) of segmented protection lightpaths in all optical wavelength division multiplexing (WDM) networks under single link as well as node failure for static traffic demand. We develop integer linear programming (ILP) formulations for dedicated and shared segmented protection schemes under single link/node failure for static traffic demand with two different objective functions: 1) minimize the total capacity required for a given traffic demand while providing 100% protection for all the traffic demands. 2) given a certain capacity, maximize the number of demands accepted while providing 100% protection for accepted connections. The numerical results obtained from CPLEX indicate that the shared segmented protection (SSP) provides significant savings (up to 41%) in capacity utilization over dedicated and shared end-to-end protection schemes; dedicated segmented protection (DSP) provides marginal savings (up to 39%) in capacity utilization over dedicated and shared end-to-end protection schemes. The numerical results also indicate that the shared segmented protection scheme achieves the best performance followed by dedicated segmented protection scheme and shared end-to-end protection, w.r.t the number of requests accepted, given the network capacity. © 2004 IEEE.|
|Source Title:||GLOBECOM - IEEE Global Telecommunications Conference|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Nov 24, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.