On the Design of Link-State Routing Protocol for Connection-Oriented Networks

Authors:
M. Sivabalan;H. T. Mouftah
Affiliations:
Department of Electrical and Computer Engineering, Queen‘s University, Kingston, Ontario, Canada K7L 3N6;Department of Electrical and Computer Engineering, Queen‘s University, Kingston, Ontario, Canada K7L 3N6. mouftah@eleceng.ee.queensu.ca
Venue:
Journal of Network and Systems Management
Year:
2001

Citing 4
Cited 0

Data networks

Data networks
Asynchronous transfer mode: solution for broadband ISDN

Asynchronous transfer mode: solution for broadband ISDN
Topology aggregation for hierarchical routing in ATM networks

ACM SIGCOMM Computer Communication Review
Routing subject to quality of service constraints in integrated communication networks

IEEE Network: The Magazine of Global Internetworking

Quantified Score

Hi-index	0.00

Visualization

Abstract

Link-state routing protocols are being increasingly used in modern communications networks. A salient feature of this class of routing protocols is that network connectivity and state information of all links are available to nodes for making routing decision. 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 routing protocol. In this paper, we quantitatively examine the impact of these alternatives on network performance using call-by-call simulations. Our design objective is to reduce call blocking ratio without significantly increasing routing overhead. We also present a new signaling scheme that can be used in conjunction with link-state protocols. We show that, if properly designed, this scheme can enhance the network performance.