Overview of structured peer-to-peer overlay algorithms

12Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This chapter provides an overview of structured Peer-to-Peer overlay algorithms. The chapter introduces basic concepts including geometries, routing algorithms, routing table maintenance, node join/leave behaviour, and bootstrapping of structured Peer-to-Peer overlay algorithms. Based on these key concepts, a number of key overlay algorithms are classified into categories and a brief over-view of these algorithms is presented. Finally, the chapter presents an "on-a-glance" comparison of the presented algorithms and provides an outlook on open research issues. © 2010 Springer Science+Business Media, LLC.

Cite

CITATION STYLE

APA

Dhara, K., Guo, Y., Kolberg, M., & Wu, X. (2010). Overview of structured peer-to-peer overlay algorithms. In Handbook of Peer-to-Peer Networking (pp. 223–256). Springer US. https://doi.org/10.1007/978-0-387-09751-0_9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free