Please use this identifier to cite or link to this item:
|Title:||A local coefficient based load sensitive routing protocol for providing QoS|
Quality Of Service
|Citation:||Proceedings of the 12th International Conference on Parallel and Distributed Systems (V 1), Minneapolis, MN, 12-15 July 2006, 1-8|
|Abstract:||In an open shortest path first (OSPF) based best effort network, the OSPF shortest path can become the bottleneck when congestion occurs. OSPF cannot forward packets though less congested alternate paths. Hence, OSPF cannot be used to provide quality of service. Earlier, we reported a load sensitive routing (LSR) algorithm which finds alternate path based on OSPF property. In the earlier work, the LSR used global coefficients i.e. all the nodes in the network use the same coefficient for a given destination. But assigning network-wide global coefficient may lead to uneven distribution of alternate paths. That is, some nodes may have many alternate paths whereas others may have few or none. The use of global coefficient was thought to be necessary to make the protocol loop free. In this study, we allow nodes to choose LSR coefficients locally (we call the coefficient L-LSR coefficient) while still retaining the loop-free property. This leads to nodes having more number of alternate paths than the case where they had to use global coefficient. But allowing local coefficients makes the process of calculating the local coefficients complex. Since our protocol has to be loop free, the local coefficients have to be calculated such that the loop free OSPF property is still satisfied. This paper presents detailed algorithm for calculating L-LSR coefficients. Using simulation, we show that L-LSR algorithm not only performs better than OSPF, but also has very significant performance improvement over the other LSR family of algorithms.|
|Appears in Collections:||Proceedings papers|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.