2013/01/16 by N. S. Walton, Walton, N. S.
Mathematics · #FOS: Mathematics #Optimization and Control (math.OC) #Probability (math.PR) #math.OC #math.PR
paper · pdf · doi:10.48550/arxiv.1301.3723
18 pages
arxiv created 2013/01/16 · arxiv updated 2013/01/17
We consider a single-hop switched queueing network. Amongst a plethora of applications, these networks have been used to model wireless networks and input queued switches. The MaxWeight scheduling policies have proved popular, chiefly, because they are throughput optimal and do not require explicit estimation of arrival rates. In this article, we prove the same throughput optimality property for a generalization of the MaxWeight policy called the MaxWeight-(α,g) policy. These throughput optimal, myopic scheduling policies allow for scheduling choices similar to those found in bandwidth sharing networks -- a further well studied model of Internet congestion.