Please use this identifier to cite or link to this item:
|Title:||Residual admission capacity in optical burst switching networks and its application in routing loss-guaranteed flows||Authors:||Chen, Q.
|Keywords:||Optical burst switching
Residual admission capacity
|Issue Date:||2006||Citation:||Chen, Q.,Mohan, G.,Chua, K.C. (2006). Residual admission capacity in optical burst switching networks and its application in routing loss-guaranteed flows. Proceedings - Conference on Local Computer Networks, LCN : 429-436. ScholarBank@NUS Repository. https://doi.org/10.1109/LCN.2006.322131||Abstract:||Optical burst switching (OBS) is a promising technology to transmit bursty data traffic over optical networks. For QoS routing, an accurate estimation of the amount of residual capacity on a link is necessary. In IP or ATM networks, the residual bandwidth of a link can be computed as the the total bandwidth subtracted by the effective bandwidth of each flow. However, this method is based on the assumption that each node has a large buffer. This method is not applicable to OBS networks, where there is no buffer at the core nodes. We propose a new metric, called residual admission capacity (RAC), to determine the amount of residual capacity on the links in OBS networks. To show the effectiveness of the new metric, we propose a routing algorithm called RAC-WSP, which is a widest shortest path (WSP) algorithm with RAC as the measurement of the residual capacity on a link. Experimental results show that RAC-WSP can admit more loss-guaranteed flows than other routing schemes, including the shortest path algorithm and other WSP algorithms where the residual capacity is evaluated by other metrics. ©2006 IEEE.||Source Title:||Proceedings - Conference on Local Computer Networks, LCN||URI:||http://scholarbank.nus.edu.sg/handle/10635/71624||ISBN:||1424404185||DOI:||10.1109/LCN.2006.322131|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jan 20, 2022
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.