学位论文详细信息
Optimal heavy-traffic queue length scaling in an incompletely saturated switch
Switch;Maximum weight scheduling;Data center;MaxWeight
Burle, Sai Kiran ; Srikant ; R.
关键词: Switch;    Maximum weight scheduling;    Data center;    MaxWeight;   
Others  :  https://www.ideals.illinois.edu/bitstream/handle/2142/97777/BURLE-THESIS-2017.pdf?sequence=1&isAllowed=y
美国|英语
来源: The Illinois Digital Environment for Access to Learning and Scholarship
PDF
【 摘 要 】

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.

【 预 览 】
附件列表
Files Size Format View
Optimal heavy-traffic queue length scaling in an incompletely saturated switch 323KB PDF download
  文献评价指标  
  下载次数:22次 浏览次数:28次