Data networks
Power allocation and routing in multibeam satellites with time-varying channels
IEEE/ACM Transactions on Networking (TON)
A framework for opportunistic scheduling in wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Dynamic Global Packet Routing in Wireless Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Maximizing Queueing Network Utility Subject to Stability: Greedy Primal-Dual Algorithm
Queueing Systems: Theory and Applications
Resource allocation and cross-layer control in wireless networks
Foundations and Trends® in Networking
Logarithmic delay for N × N packet switches under the crossbar constraint
IEEE/ACM Transactions on Networking (TON)
Opportunistic power scheduling for dynamic multi-server wireless systems
IEEE Transactions on Wireless Communications
Capacity and optimal resource allocation for fading broadcast channels .I. Ergodic capacity
IEEE Transactions on Information Theory
Capacity and optimal power allocation for fading broadcast channels with minimum rates
IEEE Transactions on Information Theory
Energy optimal control for time-varying wireless networks
IEEE Transactions on Information Theory
Optimal Transmission Scheduling in Symmetric Communication Models With Intermittent Connectivity
IEEE Transactions on Information Theory
Providing quality of service over a shared wireless link
IEEE Communications Magazine
Dynamic power allocation and routing for time-varying wireless networks
IEEE Journal on Selected Areas in Communications
Super-fast delay tradeoffs for utility optimal fair scheduling in wireless networks
IEEE Journal on Selected Areas in Communications
Delay-optimal power and precoder adaptation for multi-stream MIMO systems
IEEE Transactions on Wireless Communications
Downlink scheduling for multiclass traffic in LTE
EURASIP Journal on Wireless Communications and Networking - 3GPP LTE and LTE Advanced
Routing without routes: the backpressure collection protocol
Proceedings of the 9th ACM/IEEE International Conference on Information Processing in Sensor Networks
Delay-optimal power and subcarrier allocation for OFDMA systems via stochastic approximation
IEEE Transactions on Wireless Communications
Optimal control of wireless networks with finite buffers
INFOCOM'10 Proceedings of the 29th conference on Information communications
On scheduling for minimizing end-to-end buffer usage over multihop wireless networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
A modeling framework for optimizing the flow-level scheduling with time-varying channels
Performance Evaluation
QoS analysis of a scheduling policy for heterogeneous users employing AMC jointly with ARQ
IEEE Transactions on Communications
On wireless scheduling algorithms for minimizing the queue-overflow probability
IEEE/ACM Transactions on Networking (TON)
Delay efficient scheduling via redundant constraints in multihop networks
Performance Evaluation
Delay-optimal opportunistic scheduling and approximations: the log rule
IEEE/ACM Transactions on Networking (TON)
Stability and asymptotic optimality of opportunistic schedulers in wireless systems
Proceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools
Optimal control of wireless networks with finite buffers
IEEE/ACM Transactions on Networking (TON)
Scheduling in a random environment: stability and asymptotic optimality
IEEE/ACM Transactions on Networking (TON)
Max-Weight Scheduling in Queueing Networks With Heavy-Tailed Traffic
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.00 |
We consider a one-hop wireless network with independent time varying ON/OFF channels and N users, such as a multi-user uplink or downlink. We first show that general classes of scheduling algorithms that do not consider queue backlog must incur average delay that grows at least linearly with N. We then construct a dynamic queue-length aware algorithm that maximizes throughput and achieves an average delay that is independent of N. This is the first order-optimal delay result for opportunistic scheduling with asymmetric links. The delay bounds are achieved via a technique of queue grouping together with Lyapunov drift and statistical multiplexing concepts.