The design philosophy of the DARPA internet protocols
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Linearizability: a correctness condition for concurrent objects
ACM Transactions on Programming Languages and Systems (TOPLAS)
Journal of the ACM (JACM)
Universal-stability results and performance bounds for greedy contention-resolution protocols
Journal of the ACM (JACM)
Stability preserving transformations: packet routing networks with edge capacities and speeds
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
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
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
New Stability Results for Adversarial Queuing
SIAM Journal on Computing
The Impact of Failure Management on the Stability of Communication Networks
ICPADS '04 Proceedings of the Parallel and Distributed Systems, Tenth International Conference
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
The Impact of Dynamic Link Slowdowns on Network Stability
ISPAN '05 Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks
Adversarial queueing model for continuous network dynamics
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
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 for such common settings of heterogeneous distributed systems concerns their ability to preserve or restore an acceptable level of performance during link failures. In this work, we address this question for the specific case of stability properties of greedy, contention-resolution protocols operating over a packet-switched communication network that suffers from link slowdowns. We focus on the Adversarial Queueing Theory framework, where an adversary controls the rates of packet injections and determines packet paths. In addition, the power of the adversary is enhanced to include the manipulation of link slowdowns. Within this framework, we show that the composition of LIS (Longest-in-System) with any of SIS (Shortest-in-System), NTS (Nearest-to-Source) and FTG (Furthest-to-Go) protocols is unstable at rates ρ 0 when the network size and the link slowdown take large values. These results represent the current record for instability bounds on injection rate for compositions of greedy protocols over dynamic adversarial models, and also suggest that the potential for instability incurred by the composition of two greedy protocols may be worse than that of some single protocol.