Design of inter-administrative domain routing protocols

Authors:
L. Breslau;D. Estrin
Affiliations:
Computer Science Department, University of Southern California, Los Angeles, California;Computer Science Department, University of Southern California, Los Angeles, California
Venue:
SIGCOMM '90 Proceedings of the ACM symposium on Communications architectures & protocols
Year:
1990

Citing 2
Cited 8

A unified approach to loop-free routing using distance vectors or link states

SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Incorporation of service classes into a network architecture

SIGCOMM '81 Proceedings of the seventh symposium on Data communications

Efficient and robust policy routing using multiple hierarchical addresses

SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
Inter domain policy routing: overview of architecture and protocols

ACM SIGCOMM Computer Communication Review
Scalable inter-domain routing architecture

SIGCOMM '92 Conference proceedings on Communications architectures & protocols
End-to-end routing behavior in the Internet

Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
End-to-end routing behavior in the Internet

IEEE/ACM Transactions on Networking (TON)
New dynamic algorithms for shortest path tree computation

IEEE/ACM Transactions on Networking (TON)
New dynamic SPT algorithm based on a ball-and-string model

IEEE/ACM Transactions on Networking (TON)
End-to-end routing behavior in the internet

ACM SIGCOMM Computer Communication Review

Quantified Score

Hi-index	0.00

Visualization

Abstract

Policy Routing (PR) is a new area of development that attempts to incorporate policy related constraints on inter-Administrative Domain (AD) communication into the route computation and forwarding of inter-AD packets.Proposals for inter-AD routing mechanisms are discussed in the context of a design space defined by three design parameters: location of routing decision (i.e., source or hop-by-hop), algorithm used (i.e., link state or distance vector), and expression of policy in topology or in link status. We conclude that an architecture based upon source routing, a link state algorithm, and policy information in the link state advertisements, is best able to address the long-term policy requirements of inter-AD routing. However, such an architecture raises several new and challenging research issues related to scaling.