ACM Home Page
Please provide us with feedback. Feedback
Network routing with path vector protocols: theory and applications
Full text PdfPdf (267 KB)
Source Applications, Technologies, Architectures, and Protocols for Computer Communication archive
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications table of contents
Karlsruhe, Germany
SESSION: Routing table of contents
Pages: 49 - 60  
Year of Publication: 2003
ISBN:1-58113-735-4
Author
João Luis Sobrinho  Instituto de Telecomunicações, Instituto Superior Técnico, Portugal
Sponsors
ACM: Association for Computing Machinery
SIGCOMM: ACM Special Interest Group on Data Communication
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 14,   Downloads (12 Months): 120,   Citation Count: 11
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/863955.863963
What is a DOI?

ABSTRACT

Path vector protocols are currently in the limelight, mainly because the inter-domain routing protocol of the Internet, BGP (Border Gateway Protocol), belongs to this class. In this paper, we cast the operation of path vector protocols into a broad algebraic framework and relate the convergence of the protocol, and the characteristics of the paths to which it converges, with the monotonicity and isotonicity properties of its path compositional operation. Here, monotonicity means that the weight of a path cannot decrease when it is extended, and isotonicity means that the relationship between the weights of any two paths with the same origin is preserved when both are extended to the same node. We show that path vector protocols can be made to converge for every network if and only if the algebra is monotone, and that the resulting paths selected by the nodes are optimal if and only if the algebra is isotone as well.Many practical conclusions can be drawn from instances of the generic algebra. For performance-oriented routing, typical in intra-domain routing, we conclude that path vector protocols can be made to converge to widest or widest-shortest paths, but that the composite metric of IGRP (Interior Gateway Protocol), for example, does not guarantee convergence to optimal paths. For policy-based routing, typical in inter-domain routing, we formulate existing guidelines as instances of the generic algebra and we propose new ones. We also show how a particular instance of the algebra yields a sufficient condition for signaling correctness of internal BGP.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
M. Blanchet, F. Parent, and B. St-Arnaud. Optical BGP (OBGP): InterAS lightpath provisioning. Internet draft draft-parent-obgp-01.txt, January 2001.
 
2
J. Doyle. Routing TCP/IP. Cisco Press, Indianapolis, IN, 1998. ISBN 1-57870-041-8.
 
3
L. Gao, T. Griffin, and J. Rexford. Inherently safe backup routing with BGP. In Proc. INFOCOM 2001, pages 547--556, Anchorage, AK, April 2001.
 
4
 
5
R. Govindan, C. Alaettinoglu, G. Eddy, D. Kessens, S. Kumar, and W. S. Lee. An architecture for stable, analyzable Internet routing. IEEE Network, 13:29--35, January/February 1999.
 
6
 
7
8
 
9
 
10
G. Huston. Interconnections, peering and financial settlements. In Proc. INET'99, San Jose, CA, June 1999.
 
11
L. Lamport. An assertional correctness proof of a distributed algorithm. Science of Computer Programming, 2(3):175--206, December 1982.
12
 
13
Y. Rekhter and T. Li. A Border Gateway Protocol 4 BGP-4. RFC 1771, March 1995.
 
14
J. Rosenberg, H. Salma, and M. Squire. Telephony routing over IP TRIP. RFC 3219, January 2002.
 
15
 
16
 
17

CITED BY  11

Collaborative Colleagues:
João Luis Sobrinho: colleagues