000 06047nam a22006015i 4500
001 978-3-540-45748-0
003 DE-He213
005 20160624102007.0
007 cr nn 008mamaa
008 121227s2002 gw | s |||| 0|eng d
020 _a9783540457480
_9978-3-540-45748-0
024 7 _a10.1007/3-540-45748-8
_2doi
050 4 _aTK5105.5-5105.9
072 7 _aUKN
_2bicssc
072 7 _aCOM075000
_2bisacsh
082 0 4 _a004.6
_223
245 1 0 _aPeer-to-Peer Systems
_h[electronic resource] :
_bFirst InternationalWorkshop, IPTPS 2002 Cambridge, MA, USA, March 7–8, 2002 Revised Papers /
_cedited by Peter Druschel, Frans Kaashoek, Antony Rowstron.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2002.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2002.
300 _aX, 346 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v2429
505 0 _aWorkshop Report for IPTPS’02 1st International Workshop on Peer-to-Peer Systems 7–8 March 2002 — MIT Faculty Club, Cambridge, MA, USA -- Workshop Report for IPTPS’02 1st International Workshop on Peer-to-Peer Systems 7–8 March 2002 — MIT Faculty Club, Cambridge, MA, USA -- Structure Overlay Routing Protocols: State of the Art and Future Directions -- Observations on the Dynamic Evolution of Peer-to-Peer Networks -- Brocade: Landmark Routing on Overlay Networks -- Routing Algorithms for DHTs: Some Open Questions -- Kademlia: A Peer-to-Peer Information System Based on the XOR Metric -- Efficient Peer-to-Peer Lookup Based on a Distributed Trie -- Self-Organizing Subsets: From Each According to His Abilities, to Each According to His Needs -- Deployed Peer-to-Peer Systems -- Mapping the Gnutella Network: Macroscopic Properties of Large-Scale Peer-to-Peer Systems -- Can Heterogeneity Make Gnutella Scalable? -- Experiences Deploying a Large-Scale Emergent Network -- Anonymous Overlays -- Anonymizing Censorship Resistant Systems -- Introducing Tarzan, a Peer-to-Peer Anonymizing Network Layer -- Applications -- Mnemosyne: Peer-to-Peer Steganographic Storage -- ConChord: Cooperative SDSI Certificate Storage and Name Resolution -- Serving DNS Using a Peer-to-Peer Lookup Service -- Network Measurement as a Cooperative Enterprise -- The Case for Cooperative Networking* -- Internet Indirection Infrastructure -- Peer-to-Peer Caching Schemes to Address Flash Crowds -- Evaluation -- Exploring the Design Space of Distributed and Peer-to-Peer Systems: Comparing the Web, TRIAD, and Chord/CFS -- Are Virtualized Overlay Networks Too Much of a Good Thing? -- Searching and Indexing -- Locating Data in (Small-World?) Peer-to-Peer Scientific Collaborations -- Complex Queries in DHT-based Peer-to-Peer Networks -- The Sybil Attack -- Security Considerations for Peer-to-Peer Distributed Hash Tables -- Dynamically Fault-Tolerant Content Addressable Networks -- Data Management -- Scalable Management and Data Mining Using Astrolabe* -- Atomic Data Access in Distributed Hash Tables -- Dynamic Replica Placement for Scalable Content Delivery -- Peer-to-Peer Resource Trading in a Reliable Distributed System -- Erasure Coding Vs. Replication: A Quantitative Comparison.
520 _aPeer-to-peer has emerged as a promising new paradigm for large-scale distributed computing. The International Workshop on Peer-to-Peer Systems (IPTPS) aimed to provide a forum for researchers active in peer-to-peer computing to discuss the state of the art and to identify key research challenges. The goal of the workshop was to examine peer-to-peer technologies, appli- tions, and systems, and also to identify key research issues and challenges that lie ahead. In the context of this workshop, peer-to-peer systems were characterized as being decentralized, self-organizing distributed systems, in which all or most communication is symmetric. The program of the workshop was a combination of invited talks, pres- tations of position papers, and discussions covering novel peer-to-peer appli- tions and systems, peer-to-peer infrastructure, security in peer-to-peer systems, anonymity and anti-censorship, performance of peer-to-peer systems, and wo- load characterization for peer-to-peer systems. To ensure a productive workshop environment, attendance was limited to 55 participants. Each potential participant was asked to submit a position paper of 5 pages that exposed a new problem, advocated a speci?c solution, or reported on actual experience. We received 99 submissions and were able to accept 31. Participants were invited based on the originality, technical merit, and topical relevance of their submissions, as well as the likelihood that the ideas expressed in their submissions would lead to insightful technical discussions at the workshop.
650 0 _aComputer science.
650 0 _aComputer Communication Networks.
650 0 _aOperating systems (Computers).
650 0 _aData structures (Computer science).
650 0 _aComputer software.
650 0 _aInformation systems.
650 0 _aTelecommunication.
650 1 4 _aComputer Science.
650 2 4 _aComputer Communication Networks.
650 2 4 _aInformation Systems Applications (incl.Internet).
650 2 4 _aOperating Systems.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aData Structures.
650 2 4 _aCommunications Engineering, Networks.
700 1 _aDruschel, Peter.
_eeditor.
700 1 _aKaashoek, Frans.
_eeditor.
700 1 _aRowstron, Antony.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540441793
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v2429
856 4 0 _uhttp://dx.doi.org/10.1007/3-540-45748-8
942 _2EBK5555
_cEBK
999 _c34849
_d34849