Modeling parallel bandwidth: local vs. global restrictions
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
Adaptive packet routing for bursty adversarial traffic
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Stability results for networks with input and output blocking
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
An adversarial model for distributed dynamic load balancing
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
Scheduling time-constrained communication in linear networks
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
A deterministic approach to the end-to-end analysis of packet flows in connection-oriented networks
IEEE/ACM Transactions on Networking (TON)
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
From static to dynamic routing: efficient transformations of store-and-forward protocols
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Packet routing with arbitrary end-to-end delay requirements
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Nonmonotonic phenomena in packet routing
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Locally efficient on-line strategies for routing packets along fixed paths
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Stability of networks and protocols in the adversarial queueing model for packet routing
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
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
On deciding stability of scheduling policies in queueing systems
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Average-case analysis of greedy packet scheduling (extended astract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
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
Fast, minimal and oblivious routing algorithms on the mesh with bounded queues
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Stability of load balancing algorithms in dynamic adversarial systems
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
On deciding stability of constrained random walks and queueing systems
ACM SIGMETRICS Performance Evaluation Review
Topology control and routing in ad hoc networks: a survey
ACM SIGACT News
Stability of Earliest-Due-Date, First-Served Queueing Networks
Queueing Systems: Theory and Applications
Dynamic routing on networks with fixed-size buffers
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Delay Bounds in a Network with Aggregate Scheduling
QofIS '00 Proceedings of the First COST 263 International Workshop on Quality of Future Internet Services
Models and Techniques for Communication in Dynamic Networks
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Design and Analysis of Dynamic Processes: A Stocastic Approach
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
On local algorithms for topology control and routing in ad hoc networks
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Information gathering in adversarial systems: lines and cycles
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
The zero-one principle for switching networks
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Competitive weighted throughput analysis of greedy protocols on DAGs
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Computer Networks: The International Journal of Computer and Telecommunications Networking
Anycasting in adversarial systems: routing and admission control
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Competitive weighted throughput analysis of greedy protocols on DAGs
ACM Transactions on Algorithms (TALG)
Asynchronous throughput-optimal routing in malicious networks
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Packet routing and information gathering in lines, rings and trees
ESA'05 Proceedings of the 13th annual European conference on Algorithms
The network as a storage device: dynamic routing with bounded buffers
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Packet scheduling across networks of switches
ICN'05 Proceedings of the 4th international conference on Networking - Volume Part I
Computing robust basestock levels
Discrete Optimization
Dynamic packet scheduling in wireless networks
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Hi-index | 0.00 |
In this paper we analyze the behavior of communication networks in which packets are generated dynamically at the nodes and routed in discrete time steps across the edges. We focus on a basic adversarial model of packet generation and path determination for which the time-averaged injection rate of packets requiring the use of any edge is limited to be less than 1. A crucial issue that arises in such a setting is that of stability-will the number of packets in the system remain bounded, as the system runs for an arbitrarily long period of time? Among other things, we show: (i) There exist simple greedy protocols that are stable for all networks. (ii) There exist other commonly-used protocols (such as FIFO) and networks (such as arrays and hypercubes) that are not stable. (iii) The n-node ring is stable for all greedy routing protocols (with maximum queue-size and packet delay that is linear in n). (iv) There exists a simple distributed randomized greedy protocol that is stable for all networks and requires only polynomial queue size. Our results resolve several questions posed by Borodin et al. and provide the first examples of (i) a protocol that is stable for all networks, and (ii) a protocol that is not stable for all networks.