Please use this identifier to cite or link to this item:
|Title:||Routing dependable connections in WDM optical networks|
|Authors:||Mohan, G. |
Primary and backup lightpath
Wavelength division multiplexing
|Citation:||Mohan, G., Murthy, C.S.R. (2001-08-15). Routing dependable connections in WDM optical networks. Computer Communications 24 (13) : 1225-1241. ScholarBank@NUS Repository. https://doi.org/10.1016/S0140-3664(00)00367-4|
|Abstract:||Optical networks employing wavelength division multiplexing (WDM) and wavelength routing are a potential candidate for future wide-area networks. As these networks are prone to component failures and they carry a large volume of traffic, providing fault tolerance capability to them is an important issue. This paper considers the problem of establishing dependable connections (D-connections) in wavelength-routed wavelength-division multiplexed networks with dynamic traffic demands. We call a connection with fault-tolerant requirements as a D-connection. We recommend using the pro-active approach wherein a D-connection is identified with the establishment of the primary lightpath and a backup lightpath at the time of honoring the request. Upon occurrence of a fault, a failed connection finds its backup path readily available. We develop algorithms to select routes and wavelengths to establish D-connections with improved blocking performance. These algorithms differ in their performance and computational complexity. The algorithms use backup multiplexing technique to efficiently utilize the wavelength channels. To improve fairness between dependable and non-dependable connections, we propose a method called backup threshold. We conduct extensive simulation experiments on different networks to verify the effectiveness of the proposed algorithms. © 2001 Elsevier Science B.V. All rights reserved.|
|Source Title:||Computer Communications|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 8, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.