On the interaction of multiple routing algorithms

  • Authors:
  • M. Abdul Alim;Timothy G. Griffin

  • Affiliations:
  • Lancaster University;University of Cambridge

  • Venue:
  • Proceedings of the Seventh COnference on emerging Networking EXperiments and Technologies
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Internet routers can obtain distinct routes to the same destination from multiple routing protocols. A mechanism called administrative distance (AD) has evolved to implement route selection in such cases. AD simply imposes a preference ranking among routing protocols. A related mechanism called route redistribution (RR) is used to increase connectivity by injecting routes from one protocol into another. Recent research has shown that the current design of RR with AD mechanisms can give rise to routing and forwarding anomalies that are difficult to debug. We present a new algebraic model that captures not only RR with AD, but also sub-protocol interactions that exist within protocols such as OSPF and IS-IS. Compared with previous work, our model provides a clearer view of the issues and trade-offs involved.