Optimal heavy-traffic queue length scaling in an incompletely saturated switch
Burle, Sai Kiran
Loading…
Permalink
https://hdl.handle.net/2142/97777
Description
Title
Optimal heavy-traffic queue length scaling in an incompletely saturated switch
Author(s)
Burle, Sai Kiran
Issue Date
2017-04-25
Director of Research (if dissertation) or Advisor (if thesis)
Srikant, R.
Department of Study
Electrical & Computer Eng
Discipline
Electrical & Computer Engr
Degree Granting Institution
University of Illinois at Urbana-Champaign
Degree Name
M.S.
Degree Level
Thesis
Keyword(s)
Switch
Maximum weight scheduling
Data center
MaxWeight
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.
Use this login method if you
don't
have an
@illinois.edu
email address.
(Oops, I do have one)
IDEALS migrated to a new platform on June 23, 2022. If you created
your account prior to this date, you will have to reset your password
using the forgot-password link below.
