Wireless Networks: An Instance of Tandem Discrete-Time Queues

N Singh, RS Sreenivas - … Proceedings of the Fifth International Conference …, 2014 - Springer
We model end-to-end flows in an ad-hoc wireless network using a tandem of finite-size,
discrete-time queues, located at the nodes along the routes used by the flows, with …

Conditionally optimal minimum-delay scheduling for bursty traffic over fading channels

E Baccarelli, N Cordeschi… - IEEE transactions on …, 2010 - ieeexplore.ieee.org
Next-generation wireless networks for personal communication services should be
designed to transfer delay-sensitive bursty-traffic flows over energy-limited buffer-equipped …

Opportunistic scheduling for delay sensitive flows in wireless networks

Y Wu, J Wei, BS Kim, Y Xi, D Ma - 2007 16th International …, 2007 - ieeexplore.ieee.org
We present an" opportunistic" scheduling policy with the objective of improving delay
performance for time-sensitive users in wireless networks. Since packet delay depends on …

Delay analysis for maximal scheduling in wireless networks with bursty traffic

MJ Neely - IEEE INFOCOM 2008-The 27th Conference on …, 2008 - ieeexplore.ieee.org
We consider the delay properties of one-hop networks with general interference constraints
and multiple traffic streams with time-correlated arrivals. We first treat the case when arrivals …

Packet scheduling algorithms to provide real-time, fair, and link-sharing services in integrated services networks

KH Pyun - 2003 - koasas.kaist.ac.kr
Broadband integrated services networks have to satisfy different requirements demanded by
both a diverse set of applications and network providers. Real-time, fair, and link-sharing …

Delay efficient control policies for wireless networks

GR Gupta - 2009 - search.proquest.com
The last few years have witnessed significant developments in our understanding of how to
control multi-hop wireless networks for optimizing performance metrics such as throughput …

[图书][B] Physical layer aware algorithms and protocols for wireless networks

V Raghunathan - 2007 - dl.acm.org
The first generation of wireless networking protocols have treated time varying wireless
characteristics like fading and interference as adversities that need to be combated. The …

When heavy-tailed and light-tailed flows compete: The response time tail under generalized max-weight scheduling

J Nair, K Jagannathan… - IEEE/ACM Transactions on …, 2015 - ieeexplore.ieee.org
This paper focuses on the design and analysis of scheduling policies for multi-class queues,
such as those found in wireless networks and high-speed switches. In this context, we study …

[PDF][PDF] Low-complexity distributed fair scheduling for wireless multi-hop networks

A Penttinen, I Koutsopoulos, L Tassiulas - IEEE Wiopt, 2005 - Citeseer
Max-min fair bandwidth allocation is a mean-ingful objective whenever the level of user
satisfaction cannot be clearly expressed as a function of the allocated bandwidth. In this …

Iterative scheduling algorithms

M Bayati, B Prabhakar, D Shah… - IEEE INFOCOM 2007 …, 2007 - ieeexplore.ieee.org
The input-queued switch architecture is widely used in Internet routers due to its ability to run
at very high line speeds. A central problem in designing an input-queued switch is the …