Universal stability of undirected graphs in the adversarial queueing model

@inproceedings{lvarez2002UniversalSO,
  title={Universal stability of undirected graphs in the adversarial queueing model},
  author={C. {\`A}lvarez and M. Blesa and M. Serna},
  booktitle={SPAA '02},
  year={2002}
}
In this paper we study the universal stability of undirected graphs in the adversarial queueing model for packet routing. In this setting, packets must be injected in some edge and have to traverse a path before leaving the system. Restrictions on the allowed types of path that packets must traverse provide different packet models. We consider three natural models, and provide polynomial time algorithms for testing universal stability on them. In the three cases, we obtain a different… Expand
The Impact of Network Structure on the Stability of Greedy Protocols
TLDR
This work improves the state-of-the-art instability bound induced by certain known forbidden subgraphs on networks running a certain greedy protocol, and sheds more light and contributes significantly to a finer understanding of the impact of structural parameters on stability and instability properties of networks. Expand
The Impact of Network Structure on the Stability of Greedy Protocols
TLDR
Through improved combinatorial constructions of networks and executions, this work improves the state-of-the-art instability threshold induced by certain known forbidden subgraphs on networks running a certain greedy protocol. Expand
The complexity of deciding stability under FFS in the Adversarial Queueing model
We address the problem of deciding whether a given network is stable in the Adversarial Queueing Model when considering farthest-from-source (FFS) as the queueing policy to schedule the packetsExpand
Tight bounds for the performance of Longest In System on DAGs
TLDR
The protocol Longest In System, when applied to directed acyclic graphs, uses buffers of only linear size and any packet incurs only linear delay as well, the first deterministic polynomial bounds on queue sizes and packet delays in the framework of adversarial queuing theory. Expand
On delivery times in packet networks under adversarial traffic
TLDR
It is shown that delivering all packets while maintaining stability can be done by an offline scheduler whenever the injection of packets is done at rate of at most 1.0 and there is no online protocol that can achieve that property against all rate-1 adversaries. Expand
On Delivery Times in Packet Networks under Adversarial Traffic
TLDR
It is shown that delivering all packets while maintaining stability can be done by an offline scheduler whenever the injection of packets is done at rate of at most 1, and that there is no online protocol that can achieve that property against all rate-1 adversaries. Expand
Adversarial models for priority-based networks
TLDR
It is shown that the set of universally stable networks in the adversarial queueing model remains the same in the priority, variable priority, failure, and reliable models, and that the longest-in-system lLISr protocol is not universally stable in any of the other models the authors propose. Expand
New stability results for adversarial queuing
We consider the model of "adversarial queuing theory" for packet networks introduced by Borodin et al. [6]. We show that the scheduling protocol First-In-First-Out (FIFO) can be unstable at anyExpand
Instability of FIFO at arbitrarily low rates in the adversarial queuing model
TLDR
It is proved that FIFO can become unstable, i.e., lead to unbounded buffer-occupancies and queuing delays, at arbitrarily low injection rates, using a network of size polynomial in 1/r. Expand
SmartCuckoo: A Fast and Cost-Efficient Hashing Index Scheme for Cloud Storage Systems
TLDR
The idea behind SmartCuckoo is to represent the hashing relationship as a directed pseudoforest and use it to track item placements for accurately predetermining the occurrence of endless loop during item insertion. Expand
...
1
2
...

References

SHOWING 1-10 OF 11 REFERENCES
Universal stability results for greedy contention-resolution protocols
TLDR
This paper focuses 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, and shows that there exist simple greedy protocols that are stable for all networks. Expand
Universal-stability results and performance bounds for greedy contention-resolution protocols
TLDR
This paper analyzes 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, and provides the first examples of a protocol that is stable for all networks, and a Protocol that is not stable forall networks. Expand
Stability of adaptive and non-adaptive packet routing policies in adversarial queueing networks
TLDR
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. Expand
A Characterization of universal stability for directed graphs in the adversarial queueing model
In this paper we provide a characterization of universal stability for digraphs in the general case that the packets are not restricted to follow simple paths. Furthermore, we consider a variation ofExpand
Stability and non-stability of the FIFO protocol
TLDR
This paper shows a graph for which FIFO is stable for any adversary with injection rate r ≰ 0.1428 and generalizes this results to show upper bound for stability of any network under FIFo protocol, answering partially an open question. Expand
Adversarial queueing theory
TLDR
A new approach to the study of dynamic (or continuous) packet routing, where packets are being continuously injected into a network, is introduced, based on the adversarial generation of packets, so that the results are more robust in that they do not hinge upon particular probabilistic assumptions. Expand
Stability of networks and protocols in the adversarial queueing model for packet routing
TLDR
A complete and simple characterization of all networks that are universally stable in this model is given and it is shown that a specific greedy protocol, SIS (Shortest In System), is stable against a large class of stochastic adversaries. Expand
Adversarial queuing theory
TLDR
An adversarial theory of queuing is developed aimed at addressing some of the restrictions inherent in probabilistic analysis and queuing theory based on time-invariant stochastic generation. Expand
Graph Minors: XV. Giant Steps
Abstract Let G be a graph with a subgraph H drawn with high representativity on a surface Σ . When can the drawing of H be extended “up to 3-separations” to a drawing of G in Σ if we permit a boundedExpand
Graph Minors .XIII. The Disjoint Paths Problem
TLDR
An algorithm, which for fixed k ≥ 0 has running time O (| V(G) | 3 ), to solve the following problem: given a graph G and k pairs of vertices of G, decide if there are k mutually vertex-disjoint paths of G joining the pairs. Expand
...
1
2
...