Please use this identifier to cite or link to this item:
|Title:||Dynamic routing with inaccurate link state information in integrated IP-over-WDM networks|
|Citation:||Li, J., Mohan, G., Tien, E.C., Chua, K.C. (2004-12-20). Dynamic routing with inaccurate link state information in integrated IP-over-WDM networks. Computer Networks 46 (6) : 829-851. ScholarBank@NUS Repository. https://doi.org/10.1016/j.comnet.2004.06.022|
|Abstract:||In this paper, we investigate the problem of dynamically routing bandwidth-guaranteed label switched paths (LSPs) in integrated IP-over-wavelength division multiplexed (WDM) networks with inaccurate link state information. To select a good path, a routing algorithm needs up-to-date link state information. This leads to excessive update overhead and scalability problems. In real networks, from the practical point of view, in order to avoid extensive overhead of advertising and processing link state information, updates need to be made periodically or based on a threshold trigger. This leads to inaccuracies in the link state information. Our contribution is that we consider the routing problem taking into consideration the uncertainty of link state parameters due to wavelength inaccuracy in addition to bandwidth inaccuracy. Based on the threshold-triggered update scheme, we present a probabilistic method to model the uncertainty of link state parameters. We then define a cost function reflecting the uncertainty. Depending on different cost metrics chosen to be optimized, we propose two routing algorithms considering the uncertainty of link state parameters. The objective is to minimize the impact of inaccurate information so that the blocking probability as well as setup failures are reduced. We use various performance metrics such as total blocking probability, blocking probability due to setup failures, blocking probability due to routing failures, bandwidth update frequency, and wavelength update frequency to evaluate the effectiveness of the proposed algorithms. Through extensive simulation experiments, we show that our algorithms can significantly reduce the impact of inaccurate link state information and perform very well. © 2004 Elsevier B.V. All rights reserved.|
|Source Title:||Computer Networks|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Feb 20, 2019
WEB OF SCIENCETM
checked on Feb 20, 2019
checked on Feb 9, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.