Adversarial Models for Priority-Based Networks

@inproceedings{lvarez2003AdversarialMF,
  title={Adversarial Models for Priority-Based Networks},
  author={C. {\`A}lvarez and M. Blesa and Josep D{\'i}az and Antonio Fern{\'a}ndez and M. Serna},
  booktitle={MFCS},
  year={2003}
}
We propose several variations of the adversarial queueing model to cope with packets that can have different priorities, the priority and variable priority models, and link failures, the failure and reliable models. We address stability issues in the proposed adversarial models. We show that the set of universally stable networks in the adversarial model remains the same in the four introduced models. From the point of view of queueing policies we show that several queueing policies that are… 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
Adversarial Queueing Model for Continuous Network Dynamics
TLDR
The generalization of the Adversarial Queueing Theory (aqt) model is initiated to capture the dynamics of continuous scenarios in which the usually assumed synchronicity of the evolution is not required anymore, and it turns out that the property of universal stability of networks is decidable in polynomial time. Expand
Adversarial queuing theory with setups
TLDR
The model is robust in the sense that under some mild conditions universal stability of work conserving packet routing protocols is preserved for natural variants of the underlying model and the model's equivalence to so called token networks is established. Expand
An Adversarial Construction of Instability Bounds in LIS Networks
TLDR
It is shown that a network that uses the LIS protocol for contention-resolution may result in dropping its instability bound at injection rates ρ > 0 when the network size and the high slowdown D take large values, which is the best ever known instability lower bound for LIS networks. Expand
Stability of adversarial routing with feedback
TLDR
An adversarial model is proposed which reflects stalling of packets due to transient failures and explicitly incorporates feedback produced by a network when packets are stalled and provides a methodology to study stability of routing protocols when flow-control and congestion-control mechanisms affect the volume of traffic. Expand
Stability of Adversarial Routing with Feedback
TLDR
An adversarial model is proposed which reflects stalling of packets due to transient failures and explicitly incorporates the feedback produced by the network when packets are stalled and provides a methodology to study stability of routing protocols when flow-control and congestion-control mechanisms affect the volume of traffic. Expand
Maria Serna's contributions to adversarial queuing theory
TLDR
Maria’s contributions, summarized in this document, include results in the stability of networks and protocols, and the definition and study of aqt models with important new characteristics, like priorities, failures, or networks with different bandwidths and packet lengths. Expand
A Characterization of Universal Stability in the Adversarial Queuing Model
TLDR
It is shown that variations of the allowed packet trajectory lead to nonequivalent characterizations, which are able to provide polynomial time algorithms for testing stability under the \NTGLIS (Nearest To Go-Longest In System) protocol. Expand
A Systematic Construction of Instability Bounds in LIS Networks
TLDR
It is shown that a network that uses the LIS protocol for contention-resolution may result in dropping its instability bound at injection rates ρ > 0 when the network size and the high slowdown D take large values, which is the best ever known instability lower bound for LIS networks. Expand
The impact of dynamic link slowdowns on network stability
  • D. Koukopoulos
  • Computer Science
  • 8th International Symposium on Parallel Architectures,Algorithms and Networks (ISPAN'05)
  • 2005
TLDR
This work presents involved combinatorial constructions of executions that improve the state-of-the-art instability bound induced by certain known forbidden subgraphs on networks running a certain greedy protocol. Expand
...
1
2
3
...

References

SHOWING 1-10 OF 24 REFERENCES
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
Universal stability of undirected graphs in the adversarial queueing model
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 traverseExpand
Simple routing strategies for adversarial systems
TLDR
This paper presents two simple distributed balancing algorithms and shows that for the case of a single receiver these algorithms will always ensure that the number of packets or flow in the system is bounded at any time step, even for an injection process that completely saturates the capacities of the available edges. Expand
A Characterization of Universal Stability in the Adversarial Queuing Model
TLDR
It is shown that variations of the allowed packet trajectory lead to nonequivalent characterizations, which are able to provide polynomial time algorithms for testing stability under the \NTGLIS (Nearest To Go-Longest In System) protocol. 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
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
Stability preserving transformations: packet routing networks with edge capacities and speeds
TLDR
It is shown that the universal stability of LIS is not preserved when either the capacity or the speed is changing dynamically whereas many other common scheduling protocols do maintain their universal stability. Expand
New stability results for adversarial queuing
TLDR
The model of "adversarial queuing theory" for packet networks introduced by Borodin et al. is considered and it is shown that the scheduling protocol first-in-first-out (FIFO) can be unstable at any injection rate larger than 1/2 and that it is always stable if the injection rate is less than1/d. Expand
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
On the Stability of Compositions of Universally Stable, Greedy Contention-Resolution Protocols
TLDR
This work focuses on a basic adversarial model for packet arrival and path determination for which the time-averaged arrival rate of packets requiring a single edge is no more than 1, and discovers that the composition of any two protocols among SIS, NTS and FTG is universally stable. Expand
...
1
2
3
...