Please use this identifier to cite or link to this item:
|Title:||Routing fault-tolerant sliding scheduled traffic in WDM optical mesh networks||Authors:||Saradhi, C.V.
Routing and wavelength assignment
Sliding scheduled traffic
Time conflict resolving window division algorithm
|Issue Date:||2008||Citation:||Saradhi, C.V.,Gurusamy, M.,Piesiewicz, R. (2008). Routing fault-tolerant sliding scheduled traffic in WDM optical mesh networks. 5th International Conference on Broadband Communications, Networks, and Systems, BROADNETS 2008 : 197-202. ScholarBank@NUS Repository. https://doi.org/10.1109/BROADNETS.2008.4769068||Abstract:||This paper deals with the problem of routing and wavelength assignment (RWA) of fault-tolerant sliding scheduled lightpath demands (FSSLDs) in WDM optical mesh networks. Sliding scheduled traffic model allows the service provider and end-users to negotiate the starting time and ending time of the demands. We have developed a time conflict resolving algorithm that exploits the time disjointness that could exist among FSSLDs by rearranging the demands and then dividing them into timeindependent windows. We then present, two RWA algorithms to efficiently route scheduled lightpath demands from timeindependent windows. The proposed algorithms schedule both primary and end-to-end protection routes and also assign wavelengths for the duration of the demands. Extensive simulations are conducted on ARPANET, NSFNET, USANET, and Mesh 8×8, 10×10, 12×12 networks. By rearranging the demands and exploiting time-disjointness across demands, the proposed algorithms can reuse the wavelengths and hence reduces the amount of global resources required and blocking probability.||Source Title:||5th International Conference on Broadband Communications, Networks, and Systems, BROADNETS 2008||URI:||http://scholarbank.nus.edu.sg/handle/10635/71696||ISBN:||9781424423927||DOI:||10.1109/BROADNETS.2008.4769068|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Apr 20, 2019
checked on Apr 21, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.