HDRA: Hierarchical Distributed Routing Algorithm
This 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.
|, , ,|
|IEEE Global Telecommunications Conference GLOBECOM'03|
|Organisation||Department of Systems and Computer Engineering|
El-Darieby, M. (Mohamed), Petriu, D, & Rolia, J. (Jerry). (2003). HDRA: Hierarchical Distributed Routing Algorithm. Presented at the IEEE Global Telecommunications Conference GLOBECOM'03.