Advanced Search

Bandwidth-sensitive oblivious routing

Research and Teaching Output of the MIT Community

Show simple item record

dc.contributor.advisor Srinivas Devadas. en_US Wen, Tina en_US
dc.contributor.other Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. en_US 2010-03-25T15:07:56Z 2010-03-25T15:07:56Z 2009 en_US 2009 en_US
dc.description Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2009. en_US
dc.description Includes bibliographical references (p. 81-83). en_US
dc.description.abstract Traditional oblivious routing algorithms either do not take into account the bandwidth demand, or assume that each flow has its own private channel to guarantee deadlock freedom. Though adaptive routing schemes can react to varying network traffic, they require complicated router designs. In this thesis, we present a polynomial-time heuristic routing algorithm that takes bandwidth requirements of each flow into account to minimize maximum channel load. The heuristic algorithm has two variants. The first one produces a deadlock-free route. The second one produces a minimal route, and is deadlock-free with two or more virtual channels assuming proper VC allocation. Both routing algorithms are oblivious, and need only simple router designs. The performance of each bandwidth-sensitive routing algorithm is evaluated against dimension-order routing and against the other on a number of benchmarks. en_US
dc.description.statementofresponsibility by Tina Wen. en_US
dc.format.extent 83 p. en_US
dc.language.iso eng en_US
dc.publisher Massachusetts Institute of Technology en_US
dc.rights 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. en_US
dc.rights.uri en_US
dc.subject Electrical Engineering and Computer Science. en_US
dc.title Bandwidth-sensitive oblivious routing en_US
dc.type Thesis en_US M.Eng. en_US
dc.contributor.department Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. en_US
dc.identifier.oclc 505616268 en_US

Files in this item

Name Size Format Description
505616268-MIT.pdf 9.769Mb PDF Full printable version

This item appears in the following Collection(s)

Show simple item record