Advanced search
1 file | 3.46 MB

Comparative study of peer-to-peer architectures for scalable resource discovery

Jeroen Famaey (UGent) , Jef Donders (UGent) , Tim Wauters (UGent) , Frédéric Iterbeke (UGent) , Niels Sluijs (UGent) , Bart De Vleeschauwer (UGent) , Filip De Turck (UGent) , Piet Demeester (UGent) and Rudy Stoop
Author
Organization
Abstract
Resource discovery is an important aspect of many modern large-scale distributed systems. In the past, this problem has been solved using many different approaches, such as a central registry server, flooding-based protocols, and distributed hash tables. In this paper, these three widely used architectures are compared, using measurement results obtained from real implementations run on an Emulab emulation environment. This allows us to study the advantages and disadvantages of the architectures and determine their usefulness. The measurement study lead to several interesting conclusions. First, the centralised architecture incurs the least traffic overhead. However, it balances the load poorly, and introduces a single point-of-failure. Second, of the two decentralised architectures, the distributed hash table generates the least overhead. Finally, hierarchical architectures were shown to be most effective when the fraction of super-peers compared to regular peers is small.
Keywords
file organisation, distributed processing, peer-to-peer computing, resource allocation, peer-to-peer architecture, scalable resource discovery, large-scale distributed system, Emulab emulation, decentralised architecture, distributed hash table

Downloads

  • (...).PDF
    • full text
    • |
    • UGent only
    • |
    • PDF
    • |
    • 3.46 MB

Citation

Please use this url to cite or link to this publication:

Chicago
Famaey, Jeroen, Jef Donders, Tim Wauters, Frédéric Iterbeke, Niels Sluijs, Bart De Vleeschauwer, Filip De Turck, Piet Demeester, and Rudy Stoop. 2009. “Comparative Study of Peer-to-peer Architectures for Scalable Resource Discovery.” In Proceedings of the 2009 First International Conference on Advances in P2P Systems, ed. Antonio Liotta, Nick Antonopoulos, George Exarchakos, and Takahiro Hara, 27–33. Los Alamitos, CA, USA: IEEE Computer Society.
APA
Famaey, J., Donders, J., Wauters, T., Iterbeke, F., Sluijs, N., De Vleeschauwer, B., De Turck, F., et al. (2009). Comparative study of peer-to-peer architectures for scalable resource discovery. In A. Liotta, N. Antonopoulos, G. Exarchakos, & T. Hara (Eds.), Proceedings of the 2009 First International Conference on Advances in P2P Systems (pp. 27–33). Presented at the 1st International Conference on Advances in P2P Systems (AP2PS 2009), Los Alamitos, CA, USA: IEEE Computer Society.
Vancouver
1.
Famaey J, Donders J, Wauters T, Iterbeke F, Sluijs N, De Vleeschauwer B, et al. Comparative study of peer-to-peer architectures for scalable resource discovery. In: Liotta A, Antonopoulos N, Exarchakos G, Hara T, editors. Proceedings of the 2009 First International Conference on Advances in P2P Systems. Los Alamitos, CA, USA: IEEE Computer Society; 2009. p. 27–33.
MLA
Famaey, Jeroen, Jef Donders, Tim Wauters, et al. “Comparative Study of Peer-to-peer Architectures for Scalable Resource Discovery.” Proceedings of the 2009 First International Conference on Advances in P2P Systems. Ed. Antonio Liotta et al. Los Alamitos, CA, USA: IEEE Computer Society, 2009. 27–33. Print.
@inproceedings{797588,
  abstract     = {Resource discovery is an important aspect of many modern large-scale distributed systems. In the past, this problem has been solved using many different approaches, such as a central registry server, flooding-based protocols, and distributed hash tables. In this paper, these three widely used architectures are compared, using measurement results obtained from real implementations run on an Emulab emulation environment. This allows us to study the advantages and disadvantages of the architectures and determine their usefulness. The measurement study lead to several interesting conclusions. First, the centralised architecture incurs the least traffic overhead. However, it balances the load poorly, and introduces a single point-of-failure. Second, of the two decentralised architectures, the distributed hash table generates the least overhead. Finally, hierarchical architectures were shown to be most effective when the fraction of super-peers compared to regular peers is small.},
  author       = {Famaey, Jeroen and Donders, Jef and Wauters, Tim and Iterbeke, Fr{\'e}d{\'e}ric and Sluijs, Niels and De Vleeschauwer, Bart and De Turck, Filip and Demeester, Piet and Stoop, Rudy},
  booktitle    = {Proceedings of the 2009 First International Conference on Advances in P2P Systems},
  editor       = {Liotta, Antonio and Antonopoulos, Nick and Exarchakos, George and Hara, Takahiro},
  isbn         = {9781424450848},
  language     = {eng},
  location     = {Sliema, Malta},
  pages        = {27--33},
  publisher    = {IEEE Computer Society},
  title        = {Comparative study of peer-to-peer architectures for scalable resource discovery},
  url          = {http://dx.doi.org/10.1109/AP2PS.2009.12},
  year         = {2009},
}

Altmetric
View in Altmetric
Web of Science
Times cited: