Please use this identifier to cite or link to this item:
|Title:||Efficient algorithms for routing dependable connections in WDM optical networks|
|Authors:||Mohan, G. |
Siva Ram Murthy, C.
Wavelength division multiplexing
|Source:||Mohan, G., Siva Ram Murthy, C., Somani, A.K. (2001-10). Efficient algorithms for routing dependable connections in WDM optical networks. IEEE/ACM Transactions on Networking 9 (5) : 553-566. ScholarBank@NUS Repository. https://doi.org/10.1109/90.958325|
|Abstract:||We consider the problem of establishing dependable connections in WDM networks with dynamic traffic demands. We call a connection with fault-tolerant requirements as a dependable connection (D-connection). We consider the single-link failure model in our study and recommend the use of a proactive approach, wherein a D-connection is identified with the establishment of the primary lightpath and a backup lightpath at the time of honoring the connection request. We develop algorithms to select routes and wavelengths to establish D-connections with improved blocking performance. The algorithms use the backup multiplexing technique to efficiently utilize the wavelength channels. To further improve channel utilization, we propose a new multiplexing technique called primary-backup multiplexing. Here, a connection may not have its backup lightpath readily available throughout its existence. We develop algorithms based on this technique to route D-connections with a specified restoration guarantee. We present an efficient and computationally simple heuristic to estimate the average number of connections per link that do not have backup lightpaths readily available upon a link failure. We conduct extensive simulation experiments on different networks to study the performance of the proposed algorithms.|
|Source Title:||IEEE/ACM Transactions on Networking|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Feb 22, 2018
WEB OF SCIENCETM
checked on Jan 22, 2018
checked on Feb 19, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.