Cross-layer adaptive control for wireless mesh networks
Ad Hoc Networks
A modeling framework for optimizing the flow-level scheduling with time-varying channels
Performance Evaluation
Delay efficient scheduling via redundant constraints in multihop networks
Performance Evaluation
Congestion control meets medium access: throughput, delay, and complexity
Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems
Dishonest reporting in queue-based cross-layer network optimization
Proceedings of the 2012 IEEE 20th International Workshop on Quality of Service
Optimal scheduling in multi-server queues with random connectivity and retransmissions
Computer Communications
Queueing Systems: Theory and Applications
Approximate Dynamic Programming via a Smoothed Linear Program
Operations Research
IEEE/ACM Transactions on Networking (TON)
Exploring the throughput boundaries of randomized schedulers in wireless networks
IEEE/ACM Transactions on Networking (TON)
Optimal control of wireless networks with finite buffers
IEEE/ACM Transactions on Networking (TON)
Asymptotically tight steady-state queue length bounds implied by drift conditions
Queueing Systems: Theory and Applications
On distributed scheduling with heterogeneously delayed network-state information
Queueing Systems: Theory and Applications
Stability of flow-level scheduling with Markovian time-varying channels
Performance Evaluation
Low-complexity scheduling algorithms for multichannel downlink wireless networks
IEEE/ACM Transactions on Networking (TON)
Lingering issues in distributed scheduling
Proceedings of the ACM SIGMETRICS/international conference on Measurement and modeling of computer systems
A throughput optimal algorithm for map task scheduling in mapreduce with data locality
ACM SIGMETRICS Performance Evaluation Review
Inefficiency of MaxWeight scheduling in spatial wireless networks
Computer Communications
Delay-based network utility maximization
IEEE/ACM Transactions on Networking (TON)
Scheduling in a random environment: stability and asymptotic optimality
IEEE/ACM Transactions on Networking (TON)
Non-derivative algorithm design for efficient routing over unreliable stochastic networks
Performance Evaluation
Approaching throughput optimality with limited feedback in multichannel wireless downlink networks
IEEE/ACM Transactions on Networking (TON)
Max-Weight Scheduling in Queueing Networks With Heavy-Tailed Traffic
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 754.84 |
Consider N parallel queues competing for the attention of a single server. At each time slot each queue may be connected to the server or not depending on the value of a binary random variable, the connectivity variable. Allocation at each slot; is based on the connectivity information and on the lengths of the connected queues only. At the end of each slot, service may be completed with a given fixed probability. Such a queueing model is appropriate for some communication networks with changing topology. In the case of infinite buffers, necessary and sufficient conditions are obtained for stabilizability of the system in terms of the different system parameters. The allocation policy that serves the longest connected queue stabilizes the system when the stabilizability conditions hold. The same policy minimizes the delay for the special case of symmetric queues. In a system with a single buffer per queue, an allocation policy is obtained that maximizes the throughput and minimizes the delay when the arrival and service statistics of different queues are identical