Thumbnail
Access Restriction
Open

Author Jia, Yanxia ♦ Nikoladis, Ioanis ♦ Gburzynski, Pawel ♦ Routing, A. Qos
Source CiteSeerX
Content type Text
File Format PDF
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Incurred Bandwidth Overhead ♦ Traffic Condition ♦ Several Alternative Path ♦ Multiple Path Qos ♦ Network Node ♦ Network Topology ♦ Diverse Set ♦ Blocking Probability ♦ Balanced Link Utilization ♦ K-shortest Path ♦ Overall Performance ♦ Link State Information ♦ Source-destination Pair ♦ Link State Exchange ♦ Single Shortest Path ♦ Traditional Scheme
Description Proceedings of ICC'01 Finland
We propose a QoS (Quality of Service) routing scheme in which a connection between a source-destination pair can be assigned to one of several alternative paths. The goal of our approach is to compensate for the inaccuracy of the link state information kept at network nodes. Starting from the well known algorithm by Dijkstra, we develop a collection of K-shortest path routing strategies and investigate their performance under a diverse set of network topologies and traffic conditions. We demonstrate that K-shortest path routing offers a lower blocking probability and more balanced link utilization than traditional schemes based on a single shortest path. Consequently, our approach makes it possible to reduce the frequency of link state exchange, and the incurred bandwidth overhead, without sacrificing the overall performance of the network.
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research
Education Level UG and PG ♦ Career/Technical Study
Learning Resource Type Article
Publisher Date 2001-01-01