Optimal algorithms for detecting network stability

Authors:
Dimitrios Koukopoulos;Stavros D. Nikolopoulos;Leonidas Palios;Paul G. Spirakis
Affiliations:
Department of Cultural Heritage Management and New Technologies, University of Ioannina, Agrinio, Greece;Department of Computer Science, University of Ioannina, Ioannina, Greece;Department of Computer Science, University of Ioannina, Ioannina, Greece;Department of Computer Engineering and Informatics, University of Patras, Patras, Greece and Research Academic Computer Tech. Institute, Patras, Greece
Venue:
WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
Year:
2008

Citing 11
Cited 0

Network and internetwork security: principles and practice

Network and internetwork security: principles and practice
Practical Unix and Internet security (2nd ed.)

Practical Unix and Internet security (2nd ed.)
Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
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
Introduction to algorithms

Introduction to algorithms
The complexity of deciding stability under FFS in the adversarial queueing model

Information Processing Letters
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
Deciding stability in packet-switched FIFO networks under the adversarial queuing model in polynomial time

DISC'05 Proceedings of the 19th international conference on Distributed Computing

Quantified Score

Hi-index	0.01

Visualization

Abstract

A packet-switched network is universally stable if, for any greedy protocol and any adversary of injection rate less than 1, the number of packets in the network remains bounded at all times. A natural question that arises is whether there is a fast way to detect if a network is universally stable based on the network's structure. In this work, we study this question in the context of Adversarial Queueing Theory which assumes that an adversary controls the locations and rates of packet injections and determines packet paths. Within this framework, we present optimal algorithms for detecting the universal stability (packet paths do not contain repeated edges but may contain repeated vertices) and the simple-path universal stability (paths contain neither repeated vertices nor repeated edges) of a network. Additionally, we describe an algorithm which decides in constant time whether the addition of a link in a universally stable network leads it to instability; such an algorithm could be useful in detecting intrusion attacks.