language: en

Hierarchical Inter-Domain Routing Protocol with On-Demand ToS and Policy Resolution

Cengiz Alaettinoglu, A. Udaya Shankar
Institute for Advanced Computer Studies Department of Computer Science University of Maryland
College Park, Maryland 20742
CS-TR-3299 June 20, 1994

Abstract Traditional inter-domain routing protocols based on superdomains maintain either "strong" or "weak" ToS and policy constraints for each visible superdomain. With strong constraints, a valid path may not be found even though one exists. With weak constraints, an invalid domain-level path may be treated as a valid path. We present an inter-domain routing protocol based on superdomains, which always finds a valid path if one exists. Both strong and weak constraints are maintained for each visible superdomain. If the strong constraints of the superdomains on a path are satisfied, then the path is valid. If only the weak constraints are satisfied for some superdomains on the path, the source uses a query protocol to obtain a more detailed "internal" view of these superdomains, and searches again for a valid path. Our protocol handles topology changes, including node/link failures that partition superdomains. Evaluation results indicate our protocol scales well to large internetworks.

Categories and Subject Descriptors: C.2.1 [Computer-Communication Networks]: Network Archi tecture and Design|packet networks; store and forward networks; C.2.2 [Computer-Communication Net works]: Network Protocols|protocol architecture; C.2.m [Routing Protocols]; F.2.m [Computer Network Routing Protocols].

[This work is supported in part by ARPA and Philips Labs under contract DASG60-92-0055 to Department of Computer Science, University of Maryland, and by National Science Foundation Grant No. NCR 89-04590. The views, opinions, and/or findings contained in this report are those of the author(s) and should not be interpreted as representing the official policies, either expressed or implied, of the Advanced Research Projects Agency, PL, NSF, or the U.S. Government. Computer facilities were provided in part by NSF grant CCR-8811954.]