Design considerations for link-state routing protocols

Author

Sivabalan, M. ; Mouftah, H.T.

Author_Institution

Dept. of Electr. & Comput. Eng., Queen´´s Univ., Kingston, Ont., Canada

fYear

1998

fDate

30 Jun-2 Jul 1998

Firstpage

53

Lastpage

57

Abstract

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

Keywords

protocols; telecommunication links; telecommunication network routing; call-level simulations; communications networks; link-state routing protocols; network connectivity; routing algorithm; single service class; state information; update mechanism; Bandwidth; Broadcasting; Computer networks; Delay; Distributed computing; Floods; Quality of service; Reactive power; Routing protocols; Satellites;

fLanguage

English

Publisher

ieee

Conference_Titel

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

Conference_Location

Athens

Print_ISBN

0-8186-8538-7

Type

conf

DOI

10.1109/ISCC.1998.702446

Filename

702446