Accession Number:

ADA458929

Title:

Robustness of Path-Vector Protocols Without Independent Route Ranking

Descriptive Note:

Technical rept.

Corporate Author:

YALE UNIV NEW HAVEN CT DEPT OF COMPUTER SCIENCE

Report Date:

2005-04-01

Pagination or Media Count:

33.0

Abstract:

Recent work has presented theoretical frameworks that rigorously model the behavior of path-vector protocols, which are primarily used for inter-domain routing on the Internet. We expand the scope of these to include protocols with route-selection procedures that cannot be captured by a per-node linear order on paths in particular, our generalized model captures the use of commonly deployed route attributes such as MED, which is used to fine-tune routing between networks that share more than one interconnection. Using the model, we give the best-known sufficient condition guaranteeing robust convergence of path-vector protocols in the generalized case and discuss its applications to protocol design.

Subject Categories:

  • Theoretical Mathematics

Distribution Statement:

APPROVED FOR PUBLIC RELEASE