Graph minors. V. Excluding a planar graph
Journal of Combinatorial Theory Series B
Graph minors. IV. Tree-width and well-quasi-ordering
Journal of Combinatorial Theory Series B
Average case analysis of greedy routing algorithms on arrays
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Bounds on the greedy routing algorithm for array networks
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Graph minors. XIII: the disjoint paths problem
Journal of Combinatorial Theory Series B
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)
Universal continuous routing strategies
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Dynamic deflection routing on arrays (preliminary version)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Distributed packet switching in arbitrary networks
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
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
The effects of temporary sessions on network performance
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
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
Universal stability results for greedy contention-resolution protocols
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
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
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
Worst-case traffic for oblivious routing functions
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
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
ACM SIGOPS Operating Systems Review
Achieving stability in networks of input-queued switches
IEEE/ACM Transactions on Networking (TON)
Scheduling Protocols for Switches with Large Envelopes
Journal of Scheduling
Instability of FIFO in session-oriented networks
Journal of Algorithms - Special issue: SODA 2000
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
Theoretical Computer Science
Underload instabilities in packet networks with flow schedulers
IEEE/ACM Transactions on Networking (TON)
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)
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
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
Instability of FIFO in the permanent sessions model at arbitrarily small network loads
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Stability of FIFO networks under adversarial models: State of the art
Computer Networks: The International Journal of Computer and Telecommunications Networking
Assessing the effectiveness of longest-in-system (lis) schedulingin ad hoc networks
Proceedings of the 3rd ACM workshop on QoS and security for wireless and mobile networks
Transforming general networks into feed-forward by using turn-prohibition
Computer Communications
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
Stability bounds in networks with dynamic link capacities
Information Processing Letters
Adversarial queuing theory with setups
Theoretical Computer Science
Instability of FIFO in the permanent sessions model at arbitrarily small network loads
ACM Transactions on Algorithms (TALG)
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
The impact of dynamic adversarial attacks on the stability of heterogeneous multimedia networks
Computer Communications
Bounds on stability and latency in wireless communication
IEEE Communications Letters
Performance Analysis of Queueing Networks via Robust Optimization
Operations Research
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)
Dynamic internet congestion with bursts
HiPC'06 Proceedings of the 13th international conference on High Performance Computing
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
DISC'05 Proceedings of the 19th international conference on Distributed Computing
A distributed algorithm for finding all best swap edges of a minimum diameter spanning tree
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Distributed online and stochastic queuing on a multiple access channel
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Proceedings of the 6th International ICST Conference on Simulation Tools and Techniques
Hi-index | 0.01 |
In this paper, we analyze the behavior of packet-switched communication networks in which packets arrive dynamically at the nodes and are routed in discrete time steps across the edges. We focus on a basic adversarial model of packet arrival and path determination for which the time-averaged arrival rate of packets requiring the use of any edge is limited to be less than 1. This model can reflect the behavior of connection-oriented networks with transient connections (such as ATM networks) as well as connectionless networks (such as the Internet). We concentrate on greedy (also known as work-conserving) contention-resolution protocols. 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? We study the universal stability of network (i.e., stability under all greedy protocols) and universal stability of protocols (i.e., stability in all networks). Once the stability of a system is granted, we focus on the two main parameters that characterize its performance: maximum queue size required and maximum end-to-end delay experienced by any packet. 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 and polynomial delay.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.