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
Universal stability of undirected graphs in the adversarial queueing model
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
New stability results for adversarial queuing
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
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
| Hi-index | 0.01 |
A packet-switching network is stable if the number of packets in the network remains bounded at all times. A very natural question that arises in the context of stability and instability properties of such networks is how network structure precisely affects these properties. In this work, we embark on a systematic study of this question in the context of Adversarial Queueing Theory, which assumes that packets are adversarially injected into the network. We consider size, diameter, maximum vertex degree, minimum number of disjoint paths that cover all edges of the network, and network subgraphs as crucial structural parameters of the network, and we present a comprehensive collection of structural results, in the form of bounds on both stability and instability thresholds for various greedy protocols: - We present a novel, yet simple and natural, construction of a network parameterized by its size on which certain compositions of universally stable, greedy protocols are unstable for low rates. The closeness of the drop to 0.5 is proportional to the increase in size. - It is now natural to ask how unstable networks with small (constant) size be. We show that size of 22 suffices to drop the instability threshold for the FIFO protocol down to 0.704. This results is the current state-of-the-art trade-off between size and instability threshold. - The diameter, maximum vertex degree and minimum number of edge-disjoint paths play a significant role in an improved analysis of stability threshold for the FIFO protocol. The results of our analysis reveal that a calibration of these parameters may be a valuable asset for the design of networks with as high as possible stability threshold. - How much can network subgraphs that are forbidden for stability affect the instability threshold? Through improved combinatorial constructions of networks and executions, we improve the state-of-the-art instability threshold induced by certain known forbidden subgraphs on networks running a certain greedy protocol. Our results shed more light and contribute significantly to a finer understanding of the impact of structural parameters on stability and instability properties of networks.