Files in this item



application/pdfBURLE-THESIS-2017.pdf (332kB)Restricted to U of Illinois
(no description provided)PDF


Title:Optimal heavy-traffic queue length scaling in an incompletely saturated switch
Author(s):Burle, Sai Kiran
Advisor(s):Srikant, R.
Department / Program:Electrical & Computer Eng
Discipline:Electrical & Computer Engr
Degree Granting Institution:University of Illinois at Urbana-Champaign
Maximum weight scheduling
Data center
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.
Issue Date:2017-04-25
Rights Information:Copyright 2017 Sai Kiran Burle
Date Available in IDEALS:2017-08-10
Date Deposited:2017-05

This item appears in the following Collection(s)

Item Statistics