An approach to hierarchical inter-domain routing with on-demand ToS and policy resolution

Author

Alaettinoglu, Cengiz ; Shankar, A. Udaya

Author_Institution

Dept. of Comput. Sci., Maryland Univ., College Park, MD, USA

fYear

1993

fDate

19-22 Oct 1993

Firstpage

72

Lastpage

79

Abstract

An interdomain routing protocol based on superdomains that always finds a valid path if one exists is presented. Both strong and weak constraints are maintained for each visible superdomain. If the strong constraints of superdomains on a path are satisfied, then the path is valid. If the weak constraints of a superdomain are satisfied but the strong constraints are not, the source uses a query protocol to obtain a more detailed “internal” view of the superdomain, and searches again for a valid path. The protocol handles topology changes, including node/link failures that partition superdomains

Keywords

computer network reliability; internetworking; network topology; protocols; telecommunication network routing; computer internetwork; hierarchical interdomain routing; interdomain routing protocol; node/link failures; on-demand type-of-service; policy resolution; query protocol; strong constraints; superdomains; topology changes; weak constraints; Computer networks; Computer science; Costs; Delay; Educational institutions; IP networks; Network topology; Quantum cellular automata; Routing protocols; Spine;

fLanguage

English

Publisher

ieee

Conference_Titel

Network Protocols, 1993. Proceedings., 1993 International Conference on

Conference_Location

San Francisco, CA

Print_ISBN

0-8186-3670-X

Type

conf

DOI

10.1109/ICNP.1993.340900

Filename

340900