From static to dynamic routing: efficient transformations of store-and-forward protocols
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
The effects of temporary sessions on network performance
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 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
New stability results for adversarial queuing
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Stability of Adaptive and Nonadaptive Packet Routing Policies in Adversarial Queueing Networks
SIAM Journal on Computing
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
Tight Bounds for the Performance of Longest-in-System on DAGs
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
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
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
Stability of FIFO networks under adversarial models: State of the art
Computer Networks: The International Journal of Computer and Telecommunications Networking
Stability bounds in networks with dynamic link capacities
Information Processing Letters
| Hi-index | 0.00 |
In this work, we study the impact of dynamically changing link capacities on the delay bounds of LIS (Longest-In-System) and SIS (Shortest-In-System) protocols on specific networks (that can be modelled as Directed Acyclic Graphs (DAGs)) and stability bounds of greedy contention-resolution protocols running on arbitrary networks under the Adversarial Queueing Theory. Especially, we consider the model of dynamic capacities, where each link capacity may take on integer values from [1,C] with C1, under a (w,@r)-adversary. We show that the packet delay on DAGs for LIS is upper bounded by O(iw@rC) and lower bounded by @W(iw@rC) where i is the level of a node in a DAG (the length of the longest path leading to node v when nodes are ordered by the topological order induced by the graph). In a similar way, we show that the performance of SIS on DAGs is lower bounded by @W(iw@rC), while the existence of a polynomial upper bound for packet delay on DAGs when SIS is used for contention-resolution remains an open problem. We prove that every queueing network running a greedy contention-resolution protocol is stable for a rate not exceeding a particular stability threshold, depending on C and the length of the longest path in the network.