Journal of the ACM (JACM)
Universal-stability results and performance bounds for greedy contention-resolution protocols
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
Stability of load balancing algorithms in dynamic adversarial systems
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Stability of Adversarial Queues via Fluid Models
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Simple Routing Strategies for Adversarial Systems
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
New Stability Results for Adversarial Queuing
SIAM Journal on Computing
Instability of FIFO in session-oriented networks
Journal of Algorithms - Special issue: SODA 2000
A Characterization of Universal Stability in the Adversarial Queuing Model
SIAM Journal on Computing
Instability of FIFO at Arbitrarily Low Rates in the Adversarial Queueing Model
SIAM Journal on Computing
Stabilizing Queueing Networks with Setups
Mathematics of Operations Research
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
A calculus for network delay. I. Network elements in isolation
IEEE Transactions on Information Theory
A calculus for network delay. II. Network analysis
IEEE Transactions on Information Theory
| Hi-index | 5.23 |
We look at routing and scheduling problems on Kelly type networks where the injection process is under the control of an adversary. The novelty of the model we consider is that the adversary injects requests of distinct types. Resources are subject to switch-over delays or setups when they begin servicing a new request class. In this new setting, we study the behavior of sensible policies as introduced by Dai and Jennings [J. Dai, O. Jennings, Stabilizing queueing networks with setups, Math. Oper. Res. (2004) 891-922]. We first show that 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. Also, the model's equivalence to so called token networks is established. We adapt to the multi-type request and setup setting, standard arguments for proving stability. Nevertheless, we provide counterexamples that show that for several reasonable adaptations of contention resolution protocols to the multi-type case, stability results do not carry over from the single-type scenario. This motivates us to explore fluid model based arguments that could be used for proving stability for a given network. Specifically we show analogues of results obtained by Gamarnik [D. Gamarnik, Stability of adversarial queues via fluid model, in: Proc. of the 39th Annual Symposium on Foundations of Computer Science, 1998, pp. 60-70] but in the multi-type request with setups scenario.