Secure overlay network design

DOI10.1007/S00453-008-9198-7MaRDI QIDQ848639zbMATH OpenOpenAlexFDO

Authors Li Li, Mohammad Mahdian, Vahab S. Mirrokni

Publication date 4 March 2010

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-008-9198-7

zbMATH Keywords

OptimizationCombinatoricsNetwork securityNetwork design

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Network design and communication in computer systems (68M10)

Recommendations

• Secure Overlay Network Design
• The service overlay network design problem for interactive internet applications
• Heuristics, LPs, and Trees on Trees: Network Design Analyses
• Design of network topology in an adversarial environment
• On designing a network to defend against random attacks of radius two

Cites work

• A course in combinatorics.
• Families of \(k\)-independent sets
• On the upper bound of the size of the \(r\)-cover-free families
• Secure Overlay Network Design
• The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
• Tradeoffs in probabilistic packet marking for IP traceback

Cited in

(2)

• Secure Overlay Network Design
• Statically defend network consumption against acker failure vulnerability in storm

This page was built for publication: Secure overlay network design

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