Show simple item record

dc.contributor.advisorDevavrat Shah.en_US
dc.contributor.authorJagabathula, Srikanthen_US
dc.contributor.otherMassachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.en_US
dc.date.accessioned2009-01-30T16:48:10Z
dc.date.available2009-01-30T16:48:10Z
dc.date.copyright2008en_US
dc.date.issued2008en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/44450
dc.descriptionThesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2008.en_US
dc.descriptionIncludes bibliographical references (p. 89-91).en_US
dc.description.abstractWe consider the problem of designing scheduling schemes for networks with arbitrary topology and scheduling constraints. We address the optimality of scheduling schemes for packet networks in terms of throughput, delay and fairness. Specifically, we design two scheduling schemes. The first one achieves simultaneous throughput and delay optimization. The second scheme provides fairness. We design a scheduling scheme that guarantees a per-flow average delay bound of O(number of hops), with a constant factor loss of throughput. We derive the constants for a network operating under primary interference constraints. Our scheme guarantees an average delay bound of ... is the number of hops and pj is the effective loading along flow j. This delay guarantee comes at a factor 5 loss of throughput. We also provide a counter-example to prove the essential optimality of our result. For the fair scheduling scheme, we define a packet-based notion of fairness by establishing a novel analogy with the ranked election problem. The election scheme of Goodman and Markowitz (1952) [14] yields a maximum weight style scheduling algorithm. We then prove the throughput optimality of the scheme for a single-hop network. Standard methods for proving the stability of queuing systems fail us and hence we introduce a non-standard proof technique with potential wider applications.en_US
dc.description.statementofresponsibilityby Srikanth Jagabathula.en_US
dc.format.extent91 p.en_US
dc.language.isoengen_US
dc.publisherMassachusetts Institute of Technologyen_US
dc.rightsM.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.urihttp://dspace.mit.edu/handle/1721.1/7582en_US
dc.subjectElectrical Engineering and Computer Science.en_US
dc.titleScheduling algorithms for arbitrary communication networksen_US
dc.title.alternativeOptimal scheduling algorithms for arbitrary networksen_US
dc.typeThesisen_US
dc.description.degreeS.M.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
dc.identifier.oclc297117374en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record