Autonomous routing algorithms for networks with wide-spread failures

Autonomous routing algorithms for networks with wide-spread failures

We study end-to-end delay performance of different routing algorithms in networks with random failures. Specifically, we 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 n...

Full description

Bibliographic Details
Main Authors: Modiano, Eytan H. (Contributor), Khan, Wajahat F. (Contributor), Le, Long Bao (Contributor)
Other Authors: Massachusetts Institute of Technology. Communications and Networking Research Group (Contributor), Massachusetts Institute of Technology. Department of Aeronautics and Astronautics (Contributor)
Format: Article
Language:English
Published: Institute of Electrical and Electronics Engineers, 2010-10-21T19:19:45Z.
Subjects:
Article
Online Access:Get fulltext

Internet

Get fulltext

Similar Items