HDRA: hierarchical distributed routing algorithm

Author

El-Darieby, Mohamed ; Petriu, Dorina ; Rolia, Jerry

Author_Institution

Dept. of Syst. & Comput. Eng., Carleton Univ., Ottawa, Ont., Canada

Volume

7

fYear

2003

fDate

1-5 Dec. 2003

Firstpage

4096

Abstract

The paper presents a novel scalable end-to-end routing protocol, HDRA, which combines the characteristics of both hierarchical and distributed routing protocols. HDRA selects a number of network domains to be traversed by a requested route. Only the selected domains are flooded with probing messages. This enables the deployment of flooding-based routing algorithms in large networks. The protocol has smaller setup time because it performs no central routing computation. HDRA does not require global state maintenance. However, it has higher message overheads when compared to PNNI (private network-network interface).

Keywords

Internet; routing protocols; Internet; PNNI; distributed routing protocols; end-to-end routing protocol; global state maintenance; hierarchical distributed routing algorithm; hierarchical routing protocols; network domains; private network-network interface protocol; probing messages; scalable routing protocol; Computer networks; Distributed computing; IP networks; Internet; Laboratories; Routing protocols; Scalability; Systems engineering and theory; Telecommunication traffic; Traffic control;

fLanguage

English

Publisher

ieee

Conference_Titel

Global Telecommunications Conference, 2003. GLOBECOM '03. IEEE

Print_ISBN

0-7803-7974-8

Type

conf

DOI

10.1109/GLOCOM.2003.1258998

Filename

1258998