Please use this identifier to cite or link to this item:
Title: Providing QoS support in OSPF based best effort network
Keywords: Quality Of Service
Telecommunication Network Routing
Telecommunication Network Topology
Issue Date: 2005
Publisher: IEEE
Citation: Proceedings of the 13th IEEE International Conference on Networks Jointly held with the 7th IEEE Malaysia International Conference on Communication (V 1), Kuala Lumpur, Malaysia, 16-18 November 2005, 307-312
Abstract: In an open shortest path first (OSPF) based best effort network, when a packet experiences congestion, the routing subsystem cannot send it through an alternate path. Thus, it fails to provide desired quality of service (QoS) during congestion. A load sensitive routing algorithm (LSR) has been reported which finds alternate path based on OSPF property. The operating parameter (or coefficient) of LSR was chosen such that total number of alternate paths in the network is maximized. In this paper, we argue that a better operating parameter would be one that maximizes total number of alternate paths subject to the constraint that maximum number of nodes have at least one alternate path. Using simulation, we show that this new algorithm, called efficient LSR (E-LSR) performs better than OSPF and LSR in terms of delay and packet loss. Besides, this paper presents more efficient algorithm for determining the optimal operational E-LSR coefficient by pruning the search space and using a simple objective function. In E-LSR algorithm, the number of alternate paths depend on the topology and costs assigned to the links. Hence, this paper provides a topology guideline that may be followed by the implementers to make E-LSR more effective.
URI: 10.1109/ICON.2005.1635492
ISSN: 1-4244-0000-7
Appears in Collections:Proceedings papers

Files in This Item:
File Description SizeFormat 
34294.pdf1.4 MBAdobe PDFThumbnail

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.