{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/97777"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/97777","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Optimal heavy-traffic queue length scaling in an incompletely saturated switch","abstract":"We consider an input queued switch operating under the MaxWeight scheduling algorithm. This system is interesting to study because it is a model for Internet routers and data center networks. Recently, it was shown that the MaxWeight algorithm has optimal heavy-traffic queue length scaling when all ports are uniformly saturated. Here we consider the case when an arbitrary number of ports are saturated (which we call the incompletely saturated case), and each port is allowed to saturate at a different rate. We use a recently developed drift technique to show that the heavy-traffic queue length under the MaxWeight scheduling algorithm has optimal scaling with respect to the switch size even in these cases.","abstract_html":"We consider an input queued switch operating under the MaxWeight scheduling algorithm. This system is interesting to study because it is a model for Internet routers and data center networks. Recently, it was shown that the MaxWeight algorithm has optimal heavy-traffic queue length scaling when all ports are uniformly saturated. Here we consider the case when an arbitrary number of ports are saturated (which we call the incompletely saturated case), and each port is allowed to saturate at a different rate. We use a recently developed drift technique to show that the heavy-traffic queue length under the MaxWeight scheduling algorithm has optimal scaling with respect to the switch size even in these cases.","abstract_has_math":false,"creators":["Burle, Sai Kiran"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"M.S.","degree_level":"Thesis","degree_discipline":"Electrical & Computer Engr","degree_department":null,"school":null,"contributors":["Srikant, R."],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2017,"date_issued":"2017-08-10T20:33:23Z","date_published":"2017-08-10T20:33:23Z","updated_at":"2026-07-22T22:24:34Z","subjects":["Switch","Maximum weight scheduling","Data center","MaxWeight"],"languages":["en"],"rights":["Copyright 2017 Sai Kiran Burle"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/2142/97777","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Srikant, R."]},{"key":"dc:creator","label":"Author","values":["Burle, Sai Kiran"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2017-08-10T20:33:23Z","2019-08-11T09:15:24Z","2017-04-25","2017-05"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Electrical & Computer Engr"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["M.S."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Switch","Maximum weight scheduling","Data center","MaxWeight"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 2017 Sai Kiran Burle"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/97777"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["We consider an input queued switch operating under the MaxWeight scheduling algorithm. This system is interesting to study because it is a model for Internet routers and data center networks. Recently, it was shown that the MaxWeight algorithm has optimal heavy-traffic queue length scaling when all ports are uniformly saturated. Here we consider the case when an arbitrary number of ports are saturated (which we call the incompletely saturated case), and each port is allowed to saturate at a different rate. We use a recently developed drift technique to show that the heavy-traffic queue length under the MaxWeight scheduling algorithm has optimal scaling with respect to the switch size even in these cases.","Submission published under a 24 month embargo labeled 'U of I Access', the embargo will last until 2019-05-01","The student, Sai Kiran Burle, accepted the attached license on 2017-04-25 at 10:32.","The student, Sai Kiran Burle, submitted this Thesis for approval on 2017-04-25 at 10:42.","This Thesis was approved for publication on 2017-04-25 at 15:22.","DSpace SAF Submission Ingestion Package generated from Vireo submission #11034 on 2017-08-10 at 15:06:57","Made available in DSpace on 2017-08-10T20:33:23Z (GMT). No. of bitstreams: 2 BURLE-THESIS-2017.pdf: 331709 bytes, checksum: dc031ec9fec1bf441f1204bbabd7b240 (MD5) LICENSE.txt: 4212 bytes, checksum: 1a77c6fb43d9f8b11896dae137dfc38a (MD5) Previous issue date: 2017-04-25","Embargo set by: Colleen Fallaw for item 102830 Lift date: 2019-08-10T21:27:21Z Reason: Author requested U of Illinois access only (OA after 2yrs) in Vireo ETD system","U of I Only Restriction Lifted for Item 102830 on 2019-08-11T09:15:24Z."]},{"key":"dc:format","label":"Dc Format","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Optimal heavy-traffic queue length scaling in an incompletely saturated switch"]}]}],"canonical_facts":{"dc:contributor":["Srikant, R."],"dc:creator":["Burle, Sai Kiran"],"dc:date":["2017-08-10T20:33:23Z","2019-08-11T09:15:24Z","2017-04-25","2017-05"],"dc:description":["We consider an input queued switch operating under the MaxWeight scheduling algorithm. This system is interesting to study because it is a model for Internet routers and data center networks. Recently, it was shown that the MaxWeight algorithm has optimal heavy-traffic queue length scaling when all ports are uniformly saturated. Here we consider the case when an arbitrary number of ports are saturated (which we call the incompletely saturated case), and each port is allowed to saturate at a different rate. We use a recently developed drift technique to show that the heavy-traffic queue length under the MaxWeight scheduling algorithm has optimal scaling with respect to the switch size even in these cases.","Submission published under a 24 month embargo labeled 'U of I Access', the embargo will last until 2019-05-01","The student, Sai Kiran Burle, accepted the attached license on 2017-04-25 at 10:32.","The student, Sai Kiran Burle, submitted this Thesis for approval on 2017-04-25 at 10:42.","This Thesis was approved for publication on 2017-04-25 at 15:22.","DSpace SAF Submission Ingestion Package generated from Vireo submission #11034 on 2017-08-10 at 15:06:57","Made available in DSpace on 2017-08-10T20:33:23Z (GMT). No. of bitstreams: 2 BURLE-THESIS-2017.pdf: 331709 bytes, checksum: dc031ec9fec1bf441f1204bbabd7b240 (MD5) LICENSE.txt: 4212 bytes, checksum: 1a77c6fb43d9f8b11896dae137dfc38a (MD5) Previous issue date: 2017-04-25","Embargo set by: Colleen Fallaw for item 102830 Lift date: 2019-08-10T21:27:21Z Reason: Author requested U of Illinois access only (OA after 2yrs) in Vireo ETD system","U of I Only Restriction Lifted for Item 102830 on 2019-08-11T09:15:24Z."],"dc:format":["application/pdf"],"dc:identifier":["http://hdl.handle.net/2142/97777"],"dc:language":["en"],"dc:rights":["Copyright 2017 Sai Kiran Burle"],"dc:subject":["Switch","Maximum weight scheduling","Data center","MaxWeight"],"dc:title":["Optimal heavy-traffic queue length scaling in an incompletely saturated switch"],"dc:type":["text"],"thesis:degree_discipline":["Electrical & Computer Engr"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["M.S."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:24:34Z"}