Adversarial queuing on the multiple-access channel
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Performance and stability bounds for dynamic networks
Journal of Parallel and Distributed Computing
Stability of FIFO networks under adversarial models: State of the art
Computer Networks: The International Journal of Computer and Telecommunications Networking
Stability of the multiple-access channel under maximum broadcast loads
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
Performance Analysis of Queueing Networks via Robust Optimization
Operations Research
Adversarial Queuing on the Multiple Access Channel
ACM Transactions on Algorithms (TALG)
The necessity of timekeeping in adversarial queueing
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
| Hi-index | 0.00 |
We investigate the stability of packet routing policies in adversarial queueing networks. We provide a simple classification of networks which are stable under any greedy scheduling policy. We show that a network is stable if and only if the underlying undirected connected graph contains at most two edges. We also propose a simple and distributed policy which is stable in an arbitrary adversarial queueing network even for the critical value of the arrival rate r=1. Finally, a simple and checkable network flow-type load condition is formulated for adaptive adversarial queueing networks, and a policy is proposed which achieves stability under this new load condition. This load condition is a relaxation of the integral network flow-type condition considered previously in the literature.