2026-09-19T16:20:18Zhttps://dspace.mit.edu/server/oai/request

oai:dspace.mit.edu:1721.1/464862022-01-13T07:54:29Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023

Eytan H. Modiano. Khan, Wajahat Faheem Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science 2009-08-26T16:33:42Z 2009-08-26T16:33:42Z 2008 2008 http://hdl.handle.net/1721.1/46486 399873729 Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2008. Includes bibliographical references (p. 109-112). 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. by Wajahat Faheem Khan. M.Eng. 112 p. eng Massachusetts Institute of Technology 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. http://dspace.mit.edu/handle/1721.1/7582 Electrical Engineering and Computer Science. Autonomous routing algorithms for networks with wide-spread failures : a case for differential backlog routing Thesis application/pdf false Publication unknown unknown <Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="ba9f8846-737f-4b77-b9bd-d05d4a8f9236"> <Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type> <Language>eng</Language> <Title>Autonomous routing algorithms for networks with wide-spread failures : a case for differential backlog routing</Title> <PublishedIn> <Publication> </Publication> </PublishedIn> <PublicationDate>2008</PublicationDate> <Authors> <Author> <DisplayName>Khan, Wajahat Faheem</DisplayName> <Affiliation> <OrgUnit> </OrgUnit> </Affiliation> </Author> </Authors> <Editors> </Editors> <Publishers> <Publisher> <DisplayName>Massachusetts Institute of Technology</DisplayName> <OrgUnit /> </Publisher> </Publishers> <License>http://dspace.mit.edu/handle/1721.1/7582</License> <Keyword>Electrical Engineering and Computer Science.</Keyword> <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.</Abstract> <Access xmlns="http://purl.org/coar/access_right" > </Access> </Publication>