Making Self-organizing Systems Secure | SpringerLink
Skip to main content

Making Self-organizing Systems Secure

  • Conference paper
Self-Organizing Systems (EuroNGI 2006, IWSOS 2006)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 4124))

  • 388 Accesses

Abstract

Network overlays provide important routing functionality not supported directly by the Internet. Such functionality includes multicast routing, content-based routing, and resilient routing, as well as combinations thereof. As network overlays are starting to be deployed for critical applications such as Internet telephony (e.g., Skype), web casting/distance education, web conferencing (e.g., NetMeeting), and even DNS replacements (CoDons), efficiency and security are becoming important attributes. For example, a web cast of a political conference may be an attractive target. Alas, most current network overlays are built from Distributed Hash Tables and spanning trees, resulting in infrastructures that are easily compromised. But traditional protocols based on Byzantine agreement do not scale to the sizes required.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

van Renesse, R. (2006). Making Self-organizing Systems Secure. In: de Meer, H., Sterbenz, J.P.G. (eds) Self-Organizing Systems. EuroNGI IWSOS 2006 2006. Lecture Notes in Computer Science, vol 4124. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11822035_1

Download citation

  • DOI: https://doi.org/10.1007/11822035_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-37658-3

  • Online ISBN: 978-3-540-37669-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics