Abstract
Overlay networks are central to the operation of large-scale decentralized applications, be it Internet-scale P2P systems deployed in the wild or cloud applications running in a controlled - albeit large-scale - environment. A number of custom solutions exist for individual applications, each employing a tailor-made mechanism to build and maintain its specific structure. This paper addresses the role of randomness in developing and maintaining such structures. Taking VICINITY, a generic overlay management framework based on self-organization, we explore tradeoffs between deterministic and probabilistic decision-making for structuring overlays. We come to the conclusion that a pinch of randomness may even be needed in overlay construction, but also that much randomness or randomness alone is not good either.
Original language | English |
---|---|
Title of host publication | Middleware 2013 |
Subtitle of host publication | ACM/IFIP/USENIX 14th International Middleware Conference, Beijing, China, December 9-13, 2013, Proceedings |
Editors | David Eyers, Karsten Schwan |
Place of Publication | Berlin, Heidelberg |
Publisher | Springer |
Pages | 21-40 |
Number of pages | 20 |
ISBN (Electronic) | 978-3-642-45065-5 |
ISBN (Print) | 978-3-642-45064-8 |
DOIs | |
Publication status | Published - 1 Dec 2013 |
Externally published | Yes |
Event | 14th ACM/IFIP/USENIX Middleware Conference, Middleware 2013 - Beijing, China Duration: 9 Dec 2013 → 13 Dec 2013 Conference number: 14 |
Publication series
Name | Lecture Notes in Computer Science |
---|---|
Publisher | Springer |
Volume | 8275 |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference
Conference | 14th ACM/IFIP/USENIX Middleware Conference, Middleware 2013 |
---|---|
Country/Territory | China |
City | Beijing |
Period | 9/12/13 → 13/12/13 |
Keywords
- Selection function
- Network size
- Garbage collection
- Torus topology
- Baseline version