Optimal Algorithms for Detecting Network Stability

DOI10.1007/978-3-540-77891-2_18MaRDI QIDQ5452165zbMATH OpenOpenAlexFDO

Authors Dimitrios Koukopoulos, Stavros D. Nikolopoulos, Leonidas Palios, P. 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

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

Recommendations

• A Characterization of Universal Stability in the Adversarial Queuing Model
• Stability of networks and protocols in the adversarial queueing model for packet routing
• The impact of network structure on the stability of greedy protocols
• The complexity of deciding stability under FFS in the adversarial queueing model
• Stability of Adaptive and Nonadaptive Packet Routing Policies in Adversarial Queueing Networks

Cites work

• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 1775391 (Why is no real title available?)
• A Characterization of Universal Stability in the Adversarial Queuing Model
• Adversarial queuing theory
• Distributed Computing
• Introduction to algorithms
• The complexity of deciding stability under FFS in the adversarial queueing model
• The impact of network structure on the stability of greedy protocols
• Universal-stability results and performance bounds for greedy contention-resolution protocols

Cited in

(1)

• Optimal monitoring of networks

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5452165)