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...

Olles dieđut

Bibliográfalaš dieđut
Váldodahkkit: Modiano, Eytan H., Khan, Wajahat F., Le, Long Bao
Eará dahkkit: Massachusetts Institute of Technology. Communications and Networking Research Group
Materiálatiipa: Artihkal
Giella:en_US
Almmustuhtton: Institute of Electrical and Electronics Engineers 2010
Fáttát:
Differential backlog routing
digital fountain
end-to-end delay
shortest path routing
throughput region
Liŋkkat:http://hdl.handle.net/1721.1/59450
https://orcid.org/0000-0003-3577-6530
https://orcid.org/0000-0001-8238-8130

Geahča maid

Geahča maid