Adversarial queuing theory

Authors:
Allan Borodin;Jon Kleinberg;Prabhakar Raghavan;Madhu Sudan;David P. Williamson
Affiliations:
Univ. of Toronto, Toronto, Ont., Canada;Cornell Univ., Ithaca, NY;IBM Almaden Research Center, San Jose, CA;Massachusetts Institute of Technology, Cambridge;IBM T.J. Watson Research Center, Yorktown Heights, NY
Venue:
Journal of the ACM (JACM)
Year:
2001

Citing 25
Cited 70

Randomized parallel communications on an extension of the omega network

Journal of the ACM (JACM)
Average case analysis of greedy routing algorithms on arrays

SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Greedy packet scheduling on shortest paths (preliminary version)

PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
The efficiency of greedy routing in hypercubes and butterflies

SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
A generalized processor sharing approach to flow control in integrated services networks: the single-node case

IEEE/ACM Transactions on Networking (TON)
Bounds on the greedy routing algorithm for array networks

SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
A generalized processor sharing approach to flow control in integrated services networks: the multiple node case

IEEE/ACM Transactions on Networking (TON)
Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Bounding delays in packet-routing networks

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Any work-conserving policy stabilizes the ring with spatial re-use

IEEE/ACM Transactions on Networking (TON)
Distributed packet switching in arbitrary networks

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Adversarial queueing theory

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Stability and instability of fluid models for reentrant lines

Mathematics of Operations Research
Universal O(congestion + dilation + log1+&egr;N) local control packet switching algorithms

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Adaptive packet routing for bursty adversarial traffic

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Stability of adaptive and non-adaptive packet routing policies in adversarial queueing networks

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Greedy dynamic routing on arrays

Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Queueing analysis of oblivious packet-routing networks

SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Product Form and Local Balance in Queueing Networks

Journal of the ACM (JACM)
Instability of FIFO in session-oriented networks

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
The effects of temporary sessions on network performance

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Universal-stability results and performance bounds for greedy contention-resolution protocols

Journal of the ACM (JACM)
Stability of Adversarial Queues via Fluid Models

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
A general approach to dynamic packet routing with bounded buffers

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Stability of Networks and Protocols in the Adversarial Queueing Model for Packet Routing

Stability of Networks and Protocols in the Adversarial Queueing Model for Packet Routing

Universal-stability results and performance bounds for greedy contention-resolution protocols

Journal of the ACM (JACM)
Stability preserving transformations: packet routing networks with edge capacities and speeds

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
A general approach to dynamic packet routing with bounded buffers

Journal of the ACM (JACM)
Stability and non-stability of the FIFO protocol

Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Scheduling protocols for switches with large envelopes

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Universal stability of undirected graphs in the adversarial queueing model

Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
New stability results for adversarial queuing

Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
A note on models for non-probabilistic analysis of packet switching networks

Information Processing Letters
Stability Issues in Heterogeneous and FIFO Networks under the Adversarial Queueing Model

HiPC '01 Proceedings of the 8th International Conference on High Performance Computing
On the Stability of Compositions of Universally Stable, Greedy Contention-Resolution Protocols

DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Tight Bounds for the Performance of Longest-in-System on DAGs

STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Throughput-centric routing algorithm design

Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Buffer overflows of merging streams

Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Achieving stability in networks of input-queued switches

IEEE/ACM Transactions on Networking (TON)
Scheduling Protocols for Switches with Large Envelopes

Journal of Scheduling
Routing and scheduling in multihop wireless networks with time-varying channels

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Instability of FIFO in session-oriented networks

Journal of Algorithms - Special issue: SODA 2000
Delay bounds for combined input-output switches with low speedup

Performance Evaluation - Internet performance symposium (IPS 2002)
The complexity of deciding stability under FFS in the adversarial queueing model

Information Processing Letters
On delivery times in packet networks under adversarial traffic

Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
The chilean highway problem

Theoretical Computer Science
Underload instabilities in packet networks with flow schedulers

IEEE/ACM Transactions on Networking (TON)
On the definition of "on-line" in job scheduling problems

ACM SIGACT News
Adversarial contention resolution for simple channels

Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Source routing and scheduling in packet networks

Journal of the ACM (JACM)
Tight bounds for the performance of longest in system on DAGs

Journal of Algorithms
Scheduling over a time-varying user-dependent channel with applications to high-speed wireless data

Journal of the ACM (JACM)
A mathematical model for the TCP tragedy of the commons

Theoretical Computer Science - Game theory meets theoretical computer science
Adversarial queuing on the multiple-access channel

Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
An improved algorithm for CIOQ switches

ACM Transactions on Algorithms (TALG)
Overall Blocking Behavior Analysis of General Banyan-Based Optical Switching Networks

IEEE Transactions on Parallel and Distributed Systems
Approximating fluid schedules in crossbar packet-switches and Banyan networks

IEEE/ACM Transactions on Networking (TON)
Scheduling over nonstationary wireless channels with finite rate sets

IEEE/ACM Transactions on Networking (TON)
Performance and stability bounds for dynamic networks

Journal of Parallel and Distributed Computing
Routing and scheduling in multihop wireless networks with time-varying channels

ACM Transactions on Algorithms (TALG)
Note: An adversarial queueing model for online server routing

Theoretical Computer Science
The increase of the instability of networks due to Quasi-Static link capacities

Theoretical Computer Science
Stability of FIFO networks under adversarial models: State of the art

Computer Networks: The International Journal of Computer and Telecommunications Networking
The Distributed Wireless Gathering Problem

AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
The Effects of Local Randomness in the Adversarial Queueing Model

ESA '08 Proceedings of the 16th annual European symposium on Algorithms
On Scheduling Policies for Streams of Structured Jobs

FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
On the power of lookahead in on-line server routing problems

Theoretical Computer Science
The layered games framework for specifications and analysis of security protocols

International Journal of Applied Cryptography
Stability bounds in networks with dynamic link capacities

Information Processing Letters
Adversarial queuing theory with setups

Theoretical Computer Science
Adversarial Multiple Access Channel with Individual Injection Rates

OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
Stability behavior of FIFO protocol in the adversarial queuing model

PCI'01 Proceedings of the 8th Panhellenic conference on Informatics
The impact of network structure on the stability of greedy protocols

CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
An experimental study of stability in heterogeneous networks

WEA'07 Proceedings of the 6th international conference on Experimental algorithms
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
Optimal algorithms for detecting network stability

WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
Deterministic broadcast on multiple access channels

INFOCOM'10 Proceedings of the 29th conference on Information communications
Tight performance bounds in the worst-case analysis of feed-forward networks

INFOCOM'10 Proceedings of the 29th conference on Information communications
The impact of dynamic adversarial attacks on the stability of heterogeneous multimedia networks

Computer Communications
One-counter Markov decision processes

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Theory of communication networks

Algorithms and theory of computation handbook
A self-adversarial approach to delay analysis under arbitrary scheduling

ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part I
Performance Analysis of Queueing Networks via Robust Optimization

Operations Research
Abstraction-based performance verification of NoCs

Proceedings of the 48th Design Automation Conference
Medium access control for adversarial channels with jamming

SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
The robustness of stability under link and node failures

Theoretical Computer Science
Adversarial Queuing on the Multiple Access Channel

ACM Transactions on Algorithms (TALG)
Deciding the FIFO stability of networks in polynomial time

CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Heterogenous networks can be unstable at arbitrarily low injection rates

CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Adversarial queueing model for continuous network dynamics

MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
The necessity of timekeeping in adversarial queueing

WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Deciding stability in packet-switched FIFO networks under the adversarial queuing model in polynomial time

DISC'05 Proceedings of the 19th international conference on Distributed Computing
Dynamic packet scheduling in wireless networks

PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Distributed online and stochastic queuing on a multiple access channel

DISC'12 Proceedings of the 26th international conference on Distributed Computing
Simulation of adversarial scenarios in OMNeT++: putting adversarial queueing theory from its head to feet

Proceedings of the 6th International ICST Conference on Simulation Tools and Techniques

Quantified Score

Hi-index	0.02

Visualization

Abstract

We consider packet routing when packets are injected continuously into a network. We develop an adversarial theory of queuing aimed at addressing some of the restrictions inherent in probabilistic analysis and queuing theory based on time-invariant stochastic generation. We examine the stability of queuing networks and policies when the arrival process is adversarial, and provide some preliminary results in this direction. Our approach sheds light on various queuing policies in simple networks, and paves the way for a systematic study of queuing with few or no probabilistic assumptions.