Autonomous Routing Algorithms for Networks With Wide-Spread Failures

Free registration required

Executive Summary

The authors study end-to-end delay performance of different routing algorithms in networks with random failures. Specifically, they compare delay performances of Differential Backlog (DB) and Shortest Path (SP) routing algorithms and show that DB routing outperforms SP routing in terms of throughput when the network is heavily loaded and/or the failure rate is high while SP routing achieves better delay performance in the low load regime. Then, they investigate delay performance of a hybrid routing algorithm that combines principles of both SP and DB routing algorithms and show that it outperforms both of these routing algorithms.

  • Format: PDF
  • Size: 159.8 KB