Linearizability: a correctness condition for concurrent objects
ACM Transactions on Programming Languages and Systems (TOPLAS)
On the interconnection of causal memory systems
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
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
Difficulties in simulating the internet
IEEE/ACM Transactions on Networking (TON)
Distributed Algorithms
Source Routing and Scheduling in Packet Networks
FOCS '01 Proceedings of the 42nd IEEE 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
Stability of FIFO networks under adversarial models: State of the art
Computer Networks: The International Journal of Computer and Telecommunications Networking
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
The impact of dynamic adversarial attacks on the stability of heterogeneous multimedia networks
Computer Communications
The robustness of stability under link and node failures
Theoretical Computer Science
Heterogenous networks can be unstable at arbitrarily low injection rates
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Proceedings of the 6th International ICST Conference on Simulation Tools and Techniques
| Hi-index | 0.00 |
A distinguishing feature of today's large-scale platforms for distributed computation and communication, such as the Internet, is their heterogeneity, predominantly manifested by the fact that a wide variety of communication protocols are simultaneously running over different distributed hosts. A fundamental question that naturally poses itself concerns the preservation (or loss) of important correctness and performance properties of the individual protocols when they are composed in a large network. In this work, we specifically address stability properties of greedy, contention-resolution protocols operating over a packet-switched communication network.We focus 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. Stability requires that the number of packets in the system remains bounded, as the system runs for an arbitrarily long period of time. It is known that several commonly used contentionresolution protocols, such as LIS (Longest-in-System), SIS (Shortest-in-System), NTS (Nearest-to-Source), and FTG (Furthest-to-Go) are universally stable in this setting - that is, they are stable over all networks. We investigate the preservation of universal stability under compositions for these four greedy, contention-resolution protocols. We discover: - The composition of any two protocols among SIS, NTS and FTG is universally stable. - The composition of LIS with any of SIS, NTS and FTG is not universally stable: we provide interesting combinatorial constructions of networks over which the composition is unstable when the adversary's injection rate is at least 0.519. - Through an involved combinatorial construction, we significantly improve the current state-of-the-art record for the adversary's injection rate that implies instability for FIFO protocol to 0.749. Since 0.519 is significantly below 0.749, this last result suggests that the potential for instability incurred by the composition of two universally stable protocols may be worse than that of some single protocol that is not universally stable.