Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Self-Organizing Subsets: From Each According to His Abilities, To Each According to His Needs
Duke.ORCID iD: 0000-0002-1256-1070
Show others and affiliations
2002 (English)In: Peer-to-Peer Systems: First InternationalWorkshop, IPTPS 2002 Cambridge, MA, USA, March 7–8, 2002 Revised Papers, Springer Berlin/Heidelberg, 2002, 76-84 p.Conference paper, Published paper (Refereed)
Abstract [en]

The key principles behind current peer-to-peer research include fully distributing service functionality among all nodes participating in the system and routing individual requests based on a small amount of locally maintained state. The goals extend much further than just improving raw system performance: such systems must survive massive concurrent failures, denial of service attacks, etc. These efforts are uncovering fundamental issues in the design and deployment of distributed services. However, the work ignores a number of practical issues with the deployment of general peer-to-peer systems, including i) the overhead of maintaining consistency among peers replicating mutable data and ii) the resource waste incurred by the replication necessary to counteract the loss in locality that results from random content distribution. This position paper argues that the key challenge in peer-to-peer research is not to distribute service functions among all participants, but rather to distribute functions to meet target levels of availability, survivability, and performance. In many cases, only a subset of participating hosts should take on server roles. The benefit of peerto- peer architectures then comes from massive diversity rather than massive decentralization: with high probability, there is always some node available to provide the required functionality should the need arise.

Place, publisher, year, edition, pages
Springer Berlin/Heidelberg, 2002. 76-84 p.
Series
Lecture Notes in Computer Science, ISSN 0302-9743 ; 2429
National Category
Computer Science
Identifiers
URN: urn:nbn:se:kth:diva-147149DOI: 10.1007/3-540-45748-8_7ISBN: 978-3-540-44179-3 (print)OAI: oai:DiVA.org:kth-147149DiVA: diva2:727731
Conference
The First International Peer to Peer Symposium (IPTPS),7-8 March 2002 - MIT Faculty Club, Cambridge, MA, USA
Note

Qc 20140707

Available from: 2014-06-23 Created: 2014-06-23 Last updated: 2014-07-07Bibliographically approved

Open Access in DiVA

fulltext(88 kB)47 downloads
File information
File name FULLTEXT01.pdfFile size 88 kBChecksum SHA-512
a7ec6727b261524b4f47b5d21873f0952b054b37e83e4107fef79619b7548d399224008b10f4ebaec18ad65f055c362fced2b984e6c6c44c132d582c40c52351
Type fulltextMimetype application/pdf

Other links

Publisher's full textSpringerlink

Search in DiVA

By author/editor
Kostic, Dejan
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 47 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 52 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf