Power allocation and routing in multibeam satellites with time-varying channels
IEEE/ACM Transactions on Networking (TON)
Resource allocation and cross-layer control in wireless networks
Foundations and Trends® in Networking
Scheduling Efficiency of Distributed Greedy Scheduling Algorithms in Wireless Networks
IEEE Transactions on Mobile Computing
Logarithmic delay for N × N packet switches under the crossbar constraint
IEEE/ACM Transactions on Networking (TON)
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 and performance limits of networks with constantly changing topology
IEEE Transactions on Information Theory
Throughput and Fairness Guarantees Through Maximal Scheduling in Wireless Networks
IEEE Transactions on Information Theory
Dynamic power allocation and routing for time-varying wireless networks
IEEE Journal on Selected Areas in Communications
Delay efficient scheduling via redundant constraints in multihop networks
Performance Evaluation
Low-complexity scheduling for wireless networks
Proceedings of the thirteenth ACM international symposium on Mobile Ad Hoc Networking and Computing
Towards a queueing-based framework for in-network function computation
Queueing Systems: Theory and Applications
Automation and Remote Control
Approximation algorithms for throughput maximization in wireless networks with delay constraints
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
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 are modulated by independent finite state Markov chains. We show that the well known maximal scheduling algorithm achieves average delay that grows at most logarithmically in the largest number of interferers at any link. Further, in the important special case when each Markov process has at most two states (such as bursty ON/OFF sources), we prove that average delay is independent of the number of nodes and links in the network, and hence is order-optimal. We provide tight delay bounds in terms of the individual auto-correlation parameters of the traffic sources. These are perhaps the first order-optimal delay results for controlled queueing networks that explicitly account for such statistical information. Our analysis treats cases both with and without flow control.