2026-09-18T22:51:29Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/444502022-01-13T07:54:29Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Devavrat Shah.
Jagabathula, Srikanth
Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2009-01-30T16:48:10Z
2009-01-30T16:48:10Z
2008
2008
http://hdl.handle.net/1721.1/44450
297117374
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2008.
Includes bibliographical references (p. 89-91).
We 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.
by Srikanth Jagabathula.
S.M.
91 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.
Scheduling algorithms for arbitrary communication networks
Optimal scheduling algorithms for arbitrary networks
Thesis
application/pdf
false
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="0cc53360-65cb-49e3-9123-d84eb5046511">
<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>Scheduling algorithms for arbitrary communication networks</Title>
<Subtitle>Optimal scheduling algorithms for arbitrary networks</Subtitle>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2008</PublicationDate>
<Authors>
<Author>
<DisplayName>Jagabathula, Srikanth</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 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.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>