Robustness of Path-Vector Protocols Without Independent Route Ranking

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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Apr 01, 2005
Accession Number
ADA458929

Entities

People

  • Aaron D. Jaggard
  • Vijay Ramachandran

Organizations

  • Yale University

Tags

Communities of Interest

  • Energy and Power Technologies
  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Autonomous Systems
  • Computer Networks
  • Computer Science
  • Consistency
  • Construction
  • Convergence
  • Department Of Defense
  • Electronic Mail
  • Guarantees
  • Internet
  • Language
  • Learning
  • Military Research
  • National Security
  • Network Protocols
  • Routing Protocols
  • Standards

Fields of Study

  • Computer science
  • Mathematics

Readers

  • Computational Modeling and Simulation
  • Computer Networking
  • Systems Analysis and Design

Technology Areas

  • AI & ML
  • AI & ML - Autonomous Systems
  • AI & ML - Machine Learning Algorithms
  • AI & ML - Neural Networks