All-optical networks with sparse wavelength conversion
IEEE/ACM Transactions on Networking (TON)
QoS routing in networks with uncertain parameters
IEEE/ACM Transactions on Networking (TON)
Dynamic wavelength routing using congestion and neighborhood information
IEEE/ACM Transactions on Networking (TON)
A path decomposition approach for computing blocking probabilities in wavelength-routing networks
IEEE/ACM Transactions on Networking (TON)
Evaluating the impact of stale link state on quality-of-service routing
IEEE/ACM Transactions on Networking (TON)
QoS-based Routing in Networks with Inaccurate Information: Theory and Algorithms
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Generalized multiprotocol label switching: an overview of routing and management enhancements
IEEE Communications Magazine
IEEE Communications Magazine
IEEE Communications Magazine
Dynamic lightpath establishment in wavelength routed WDM networks
IEEE Communications Magazine
A simple dynamic integrated provisioning/protection scheme in IP over WDM networks
IEEE Communications Magazine
Lightpath (wavelength) routing in large WDM networks
IEEE Journal on Selected Areas in Communications
IEEE Journal on Selected Areas in Communications
QoS routing in GMPLS-capable integrated IP/WDM networks with router cost constraints
Computer Communications
Application of attractor selection to adaptive virtual network topology control
Proceedings of the 3rd International Conference on Bio-Inspired Models of Network, Information and Computing Sytems
Hi-index | 0.00 |
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.