By Topic

Design considerations for link-state routing protocols

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
$33 $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)
M. Sivabalan ; Dept. of Electr. & Comput. Eng., Queen's Univ., Kingston, Ont., Canada ; H. T. Mouftah

Link-state routing protocols are being increasingly used in modern communications networks. A salient feature of this class of routing protocol is that the network connectivity and the state information of all links are available to the nodes for making routing decisions. Two main components of a link-state routing protocol are an update mechanism and a routing algorithm. These components must be properly designed for efficient routing. Various alternatives are possible for each of these components leading to different scenarios for the routing protocol. In this paper, we quantitatively examine the impact of these alternatives on the performance of a sample network supporting a single service class using call-level simulations

Published in:

Computers and Communications, 1998. ISCC '98. Proceedings. Third IEEE Symposium on

Date of Conference:

30 Jun-2 Jul 1998