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
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 Adversarial Queues via Fluid Models
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Performance and stability bounds for dynamic networks
Journal of Parallel and Distributed Computing
The increase of the instability of networks due to Quasi-Static link capacities
Theoretical Computer Science
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
Heterogenous networks can be unstable at arbitrarily low injection rates
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Hi-index | 0.00 |
In this paper, we investigate and analyze the stability properties of heterogeneous networks, which use a combination of different universally stable queueing policies for packet routing, in the Adversarial Queueing model. We interestingly prove that the combination of SIS and LIS policies, LIS and NTS policies, and LIS and FTG policies leads to instability for specific networks and injection rates that are presented. It is also proved that the combination of SIS and FTG policies, SIS and NTS policies, and FTG and NTS policies is universally stable. Furthermore, we prove that FIFO is non-stable for any r 驴 0.749, improving significantly the previous best known bounds of [2, 10], by using new techniques for adversary construction and tight analysis of the packet flow time evolution. We also show a graph for which FIFOis stable for any adversary with injection rate r 驴 0.1428, and, by generalizing, we present upper bounds for stability of any network under the FIFO protocol, answering partially an open question raised by Andrews et al. in [2]. The work presented here combines new and recent results of the authors.