By Topic

Providing QoS support in OSPF based best effort network

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Tiwari, A. ; Kanwal Rekhi Sch. of Inf. Technol., Indian Inst. of Technol., Mumbai ; Sahoo, A.

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

Published in:

Networks, 2005. Jointly held with the 2005 IEEE 7th Malaysia International Conference on Communication., 2005 13th IEEE International Conference on  (Volume:1 )

Date of Conference:

0-0 0