Autonomous routing algorithms for networks with wide-spread failures : a case for differential backlog routing
Name
399873729-MIT.pdf
Description
Full printable version
Size
28.43 MB
Format
Adobe PDF
Checksum (MD5)
c45b33fe466c697abf2947d57646ec2d
Author(s)
Khan, Wajahat Faheem
Advisor(s)
Eytan H. Modiano.
Date Issued
2008
Publisher
Massachusetts Institute of Technology
Abstract
We study the performance of a differential backlog routing algorithm in a network with random failures. Differential Backlog routing is a novel routing algorithm where packets are routed through multiple paths to their destinations based on queue backlog information. It is known that Differential Backlog routing maximizes the throughput capacity of the network; however little is known about practical implementations of Differential Backlog routing; and its delay performance. We compare Differential Backlog to Shortest Path and show that Differential Backlog routing outperforms Shortest Path when the network is heavily loaded and when the failure rate is high. Moreover, a hybrid routing algorithm that combines principles of both Shortest Path and Differential Backlog routing is presented, and is shown to outperform both. Finally, we demonstrate further improvements in delay performance of the aforementioned hybrid routing algorithm through the use of Digital Fountains.
Description
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2008.
Includes bibliographical references (p. 109-112).
Subjects
Electrical Engineering and Computer Science.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
M.I.T. theses are protected by
copyright. They may be viewed from this source for any purpose, but
reproduction or distribution in any format is prohibited without written
permission. See provided URL for inquiries about permission.
copyright. They may be viewed from this source for any purpose, but
reproduction or distribution in any format is prohibited without written
permission. See provided URL for inquiries about permission.
Persistent DSpace Link
