An experimental study of stability in heterogeneous networks

Authors:
Maria Chroni;Dimitrios Koukopoulos;Stavros D. Nikolopoulos
Affiliations:
Department of Computer Science, University of Ioannina, Ioannina, Greece;Department of Applied Informatics in Management and Finance, Technological Education Institute of Ionian Islands, and University of Ioannina, Agrinio, Greece;Department of Computer Science, University of Ioannina, Ioannina, Greece
Venue:
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Year:
2007

Citing 11
Cited 1

Linearizability: a correctness condition for concurrent objects

ACM Transactions on Programming Languages and Systems (TOPLAS)
Adversarial queuing theory

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
Distributed Algorithms

Distributed Algorithms
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
Instability of FIFO at Arbitrarily Low Rates in the Adversarial Queueing Model

FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
New Stability Results for Adversarial Queuing

SIAM Journal on Computing
A Characterization of Universal Stability in the Adversarial Queuing Model

SIAM Journal on Computing
The Impact of Network Structure on the Stability of Greedy Protocols

Theory of Computing Systems

Simulation of adversarial scenarios in OMNeT++: putting adversarial queueing theory from its head to feet

Proceedings of the 6th International ICST Conference on Simulation Tools and Techniques

Quantified Score

Hi-index	0.00

Visualization

Abstract

A distinguishing feature of today's large-scale communication networks, such as the Internet, is their heterogeneity, predominantly manifested by the fact that a wide variety of communication protocols are simultaneously running over different network hosts. A fundamental question that naturally poses itself for such common settings of heterogeneous networks concerns their ability to preserve the number of packets in the system upper bounded at all times. This property is well-known as stability. We focus on the Adversarial Queueing Theory framework, where an adversary controls the rates of packet injections and determines packet paths. In this work, we present specific network constructions with different protocol compositions and we show experimentally their stability behavior under an adversarilly strategy. In particular, we study compositions of universally stable protocols with unstable protocols like FIFO. Interestingly, some of our results indicate that such a composition leads to a worst stability behavior than having a single unstable protocol for contention-resolution. This suggests that the potential for instability incurred by the composition of one universally stable protocol with one unstable protocol may be worse than that of some single protocol.