Asymptotically tight steady-state queue length bounds implied by drift conditions
A Eryilmaz, R Srikant - Queueing Systems, 2012 - Springer
Abstract The Foster–Lyapunov theorem and its variants serve as the primary tools for
studying the stability of queueing systems. In addition, it is well known that setting the drift of …
studying the stability of queueing systems. In addition, it is well known that setting the drift of …
Heavy traffic queue length behavior in a switch under the MaxWeight algorithm
ST Maguluri, R Srikant - Stochastic Systems, 2016 - pubsonline.informs.org
We consider a switch operating under the MaxWeight scheduling algorithm, under any traffic
pattern such that all the ports are loaded. This system is interesting to study since the queue …
pattern such that all the ports are loaded. This system is interesting to study since the queue …
Throughput optimal decentralized scheduling with single-bit state feedback for a class of queueing systems
Motivated by medium access control for resource-challenged wireless Internet of Things
(IoT), we consider the problem of queue scheduling with reduced queue state information. In …
(IoT), we consider the problem of queue scheduling with reduced queue state information. In …
Heavy-traffic behavior of the MaxWeight algorithm in a switch with uniform traffic
ST Maguluri, R Srikant - ACM SIGMETRICS Performance Evaluation …, 2015 - dl.acm.org
We consider a switch with uniform traffic operating under the MaxWeight scheduling
algorithm. This traffic pattern is interesting to study in the heavy-traffic regime since the …
algorithm. This traffic pattern is interesting to study in the heavy-traffic regime since the …
Queue length behavior in a switch under the maxweight algorithm
ST Maguluri, R Srikant - arXiv preprint arXiv:1503.05872, 2015 - arxiv.org
We consider a switch operating under the MaxWeight scheduling algorithm, under any traffic
pattern such that all the ports are loaded. This system is interesting to study since the queue …
pattern such that all the ports are loaded. This system is interesting to study since the queue …
On sample-path optimal dynamic scheduling for sum-queue minimization in forests
S Hariharan, NB Shroff - IEEE/ACM Transactions on …, 2013 - ieeexplore.ieee.org
We investigate the problem of minimizing the sum of the queue lengths of all the nodes in a
wireless network with a forest topology. Each packet is destined to one of the roots (sinks) of …
wireless network with a forest topology. Each packet is destined to one of the roots (sinks) of …
Reduced-state, optimal medium access control for wireless data collection networks
Motivated by medium access control for resource-challenged wireless sensor networks
whose main purpose is data collection, we consider the problem of queue scheduling with …
whose main purpose is data collection, we consider the problem of queue scheduling with …
[图书][B] The delay performance of adaptive routing and scheduling in communication networks
T Ji - 2012 - search.proquest.com
Throughput and latency are two important QoS metrics in communication networks. Ideally,
we would like to deliver a large amount of data from a source to its destination within a short …
we would like to deliver a large amount of data from a source to its destination within a short …