Optimal Algorithms for Detecting Network Stability

DOI10.1007/978-3-540-77891-2_18zbMath1132.90311OpenAlexW1565052845MaRDI QIDQ5452165

Dimitrios Koukopoulos, Stavros D. Nikolopoulos, Leonidas Palios, Paul G. Spirakis

Publication date: 25 March 2008

Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77891-2_18

zbMATH Keywords

graph theorylinear algorithmsintrusion detectionnetwork stabilityadversarial queueing theoryPacket-switched communication networks

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Communication networks in operations research (90B18) Queues and service in operations research (90B22)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The impact of network structure on the stability of greedy protocols
• The complexity of deciding stability under FFS in the adversarial queueing model
• Adversarial queuing theory
• Universal-stability results and performance bounds for greedy contention-resolution protocols
• A Characterization of Universal Stability in the Adversarial Queuing Model
• Distributed Computing

This page was built for publication: Optimal Algorithms for Detecting Network Stability