Data networks
Computer networks
Randomized graph products, chromatic numbers, and Lovasz j-function
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
On the hardness of approximating minimization problems
Journal of the ACM (JACM)
Routing and admission control in general topology networks with Poisson arrivals
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Narrowband Land-Mobile Radio Networks
Narrowband Land-Mobile Radio Networks
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
Achieving 100% throughput in an input-queued switch
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Scheduling protocols for switches with large envelopes
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Queueing Dynamics and Maximal Throughput Scheduling in Switched Processing Systems
Queueing Systems: Theory and Applications
Scheduling Protocols for Switches with Large Envelopes
Journal of Scheduling
SCHEDULING IN A QUEUING SYSTEM WITH ASYNCHRONOUSLY VARYING SERVICE RATES
Probability in the Engineering and Informational Sciences
Uplink scheduling in CDMA packet-data systems
Wireless Networks
Resource allocation and cross-layer control in wireless networks
Foundations and Trends® in Networking
Cross-layer adaptive control for wireless mesh networks
Ad Hoc Networks
Fairness and optimal stochastic control for heterogeneous networks
IEEE/ACM Transactions on Networking (TON)
Order optimal delay for opportunistic scheduling in multi-user wireless uplinks and downlinks
IEEE/ACM Transactions on Networking (TON)
Delay-based network utility maximization
INFOCOM'10 Proceedings of the 29th conference on Information communications
IEEE/ACM Transactions on Networking (TON)
Inefficiency of MaxWeight scheduling in spatial wireless networks
Computer Communications
Delay-based network utility maximization
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
We consider schemes for reuse-efficient packet access in wireless data networks. We show that computing the maximum ergodic packet arrival rate is NP-hard. We give an upper bound on the maximum ergodic throughput in terms of the eigenvalues of matrices related to the path-gain matrix. We present simple, practical heuristic algorithms which exhibit good throughput and packet delay and report on results of preliminary simulations. More sophisticated algorithms that yield optimal throughput are also presented. A recent result of McKeown, Anantharam and Walrand on scheduling of input-queued switches is obtained as a byproduct.