Building low-diameter peer-to-peer networks
Peer-to-peer (P2P) computing has emerged as a significant paradigm for providing distributed services, in particular search and data sharing. Current P2P networks (e.g., Gnutella) are constructed by participants following their own uncoordinated (and often whimsical) protocols; they consequently suf...
Gespeichert in:
| Veröffentlicht in: | IEEE journal on selected areas in communications 2003-08, Vol.21 (6), p.995-1002 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 1002 |
|---|---|
| container_issue | 6 |
| container_start_page | 995 |
| container_title | IEEE journal on selected areas in communications |
| container_volume | 21 |
| creator | Pandurangan, G. Raghavan, P. Upfal, E. |
| description | Peer-to-peer (P2P) computing has emerged as a significant paradigm for providing distributed services, in particular search and data sharing. Current P2P networks (e.g., Gnutella) are constructed by participants following their own uncoordinated (and often whimsical) protocols; they consequently suffer from frequent network overload and partitioning into disconnected pieces separated by choke points with inadequate bandwidth. We propose a protocol for participants to build P2P networks in a distributed fashion, and prove that it results in connected networks of constant degree and logarithmic diameter. These properties are crucial for efficient search and data exchange. An important feature of our protocol is that it operates without global knowledge of all the nodes in the network. |
| doi_str_mv | 10.1109/JSAC.2003.814666 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_proquest_miscellaneous_901693525</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1217283</ieee_id><sourcerecordid>2429241091</sourcerecordid><originalsourceid>FETCH-LOGICAL-c393t-c3d2a86a381a975b61c3ce61f40bf13f846e03b72717d8da032f98895ff14823</originalsourceid><addsrcrecordid>eNp9kL1PwzAQxS0EEqWwI7FUDDCghDvbsZ2xVHyqEgPdLTexUUqaFDtRxX-PoyAhMbDcW37v3d0j5BwhRYT89uVtvkgpAEsVciHEAZlglqkEANQhmYBkLFESxTE5CWEDgJwrOiE3d31Vl1XzPqvbfVJWZms762c7a33Stcmgs8Z2-9Z_hFNy5Ewd7NmPTsnq4X61eEqWr4_Pi_kyKVjOujhLapQwTKHJZbYWWLDCCnQc1g6ZU1xYYGtJJcpSlQYYdblSeeYcxpvYlFyPsTvffvY2dHpbhcLWtWls2wedA4qcZTSL5NW_JFUoY6KK4OUfcNP2volPaKU4lRw5RghGqPBtCN46vfPV1vgvjaCHjvXQsR461mPH0XIxWipr7S9OUcal7BszcHU4</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>884274141</pqid></control><display><type>article</type><title>Building low-diameter peer-to-peer networks</title><source>IEEE Electronic Library (IEL)</source><creator>Pandurangan, G. ; Raghavan, P. ; Upfal, E.</creator><creatorcontrib>Pandurangan, G. ; Raghavan, P. ; Upfal, E.</creatorcontrib><description>Peer-to-peer (P2P) computing has emerged as a significant paradigm for providing distributed services, in particular search and data sharing. Current P2P networks (e.g., Gnutella) are constructed by participants following their own uncoordinated (and often whimsical) protocols; they consequently suffer from frequent network overload and partitioning into disconnected pieces separated by choke points with inadequate bandwidth. We propose a protocol for participants to build P2P networks in a distributed fashion, and prove that it results in connected networks of constant degree and logarithmic diameter. These properties are crucial for efficient search and data exchange. An important feature of our protocol is that it operates without global knowledge of all the nodes in the network.</description><identifier>ISSN: 0733-8716</identifier><identifier>EISSN: 1558-0008</identifier><identifier>DOI: 10.1109/JSAC.2003.814666</identifier><identifier>CODEN: ISACEM</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Bandwidth ; Chokes ; Computation ; Computer science ; Construction ; Distributed computing ; Inductors ; IP networks ; Network servers ; Network topology ; Networks ; Partitioning ; Peer to peer computing ; Protocol (computers) ; Protocols ; Searching ; Vehicle dynamics</subject><ispartof>IEEE journal on selected areas in communications, 2003-08, Vol.21 (6), p.995-1002</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2003</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c393t-c3d2a86a381a975b61c3ce61f40bf13f846e03b72717d8da032f98895ff14823</citedby><cites>FETCH-LOGICAL-c393t-c3d2a86a381a975b61c3ce61f40bf13f846e03b72717d8da032f98895ff14823</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/1217283$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,792,27901,27902,54733</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1217283$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Pandurangan, G.</creatorcontrib><creatorcontrib>Raghavan, P.</creatorcontrib><creatorcontrib>Upfal, E.</creatorcontrib><title>Building low-diameter peer-to-peer networks</title><title>IEEE journal on selected areas in communications</title><addtitle>J-SAC</addtitle><description>Peer-to-peer (P2P) computing has emerged as a significant paradigm for providing distributed services, in particular search and data sharing. Current P2P networks (e.g., Gnutella) are constructed by participants following their own uncoordinated (and often whimsical) protocols; they consequently suffer from frequent network overload and partitioning into disconnected pieces separated by choke points with inadequate bandwidth. We propose a protocol for participants to build P2P networks in a distributed fashion, and prove that it results in connected networks of constant degree and logarithmic diameter. These properties are crucial for efficient search and data exchange. An important feature of our protocol is that it operates without global knowledge of all the nodes in the network.</description><subject>Bandwidth</subject><subject>Chokes</subject><subject>Computation</subject><subject>Computer science</subject><subject>Construction</subject><subject>Distributed computing</subject><subject>Inductors</subject><subject>IP networks</subject><subject>Network servers</subject><subject>Network topology</subject><subject>Networks</subject><subject>Partitioning</subject><subject>Peer to peer computing</subject><subject>Protocol (computers)</subject><subject>Protocols</subject><subject>Searching</subject><subject>Vehicle dynamics</subject><issn>0733-8716</issn><issn>1558-0008</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2003</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNp9kL1PwzAQxS0EEqWwI7FUDDCghDvbsZ2xVHyqEgPdLTexUUqaFDtRxX-PoyAhMbDcW37v3d0j5BwhRYT89uVtvkgpAEsVciHEAZlglqkEANQhmYBkLFESxTE5CWEDgJwrOiE3d31Vl1XzPqvbfVJWZms762c7a33Stcmgs8Z2-9Z_hFNy5Ewd7NmPTsnq4X61eEqWr4_Pi_kyKVjOujhLapQwTKHJZbYWWLDCCnQc1g6ZU1xYYGtJJcpSlQYYdblSeeYcxpvYlFyPsTvffvY2dHpbhcLWtWls2wedA4qcZTSL5NW_JFUoY6KK4OUfcNP2volPaKU4lRw5RghGqPBtCN46vfPV1vgvjaCHjvXQsR461mPH0XIxWipr7S9OUcal7BszcHU4</recordid><startdate>20030801</startdate><enddate>20030801</enddate><creator>Pandurangan, G.</creator><creator>Raghavan, P.</creator><creator>Upfal, E.</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SP</scope><scope>8FD</scope><scope>L7M</scope><scope>F28</scope><scope>FR3</scope></search><sort><creationdate>20030801</creationdate><title>Building low-diameter peer-to-peer networks</title><author>Pandurangan, G. ; Raghavan, P. ; Upfal, E.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c393t-c3d2a86a381a975b61c3ce61f40bf13f846e03b72717d8da032f98895ff14823</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2003</creationdate><topic>Bandwidth</topic><topic>Chokes</topic><topic>Computation</topic><topic>Computer science</topic><topic>Construction</topic><topic>Distributed computing</topic><topic>Inductors</topic><topic>IP networks</topic><topic>Network servers</topic><topic>Network topology</topic><topic>Networks</topic><topic>Partitioning</topic><topic>Peer to peer computing</topic><topic>Protocol (computers)</topic><topic>Protocols</topic><topic>Searching</topic><topic>Vehicle dynamics</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Pandurangan, G.</creatorcontrib><creatorcontrib>Raghavan, P.</creatorcontrib><creatorcontrib>Upfal, E.</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>CrossRef</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>ANTE: Abstracts in New Technology & Engineering</collection><collection>Engineering Research Database</collection><jtitle>IEEE journal on selected areas in communications</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Pandurangan, G.</au><au>Raghavan, P.</au><au>Upfal, E.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Building low-diameter peer-to-peer networks</atitle><jtitle>IEEE journal on selected areas in communications</jtitle><stitle>J-SAC</stitle><date>2003-08-01</date><risdate>2003</risdate><volume>21</volume><issue>6</issue><spage>995</spage><epage>1002</epage><pages>995-1002</pages><issn>0733-8716</issn><eissn>1558-0008</eissn><coden>ISACEM</coden><abstract>Peer-to-peer (P2P) computing has emerged as a significant paradigm for providing distributed services, in particular search and data sharing. Current P2P networks (e.g., Gnutella) are constructed by participants following their own uncoordinated (and often whimsical) protocols; they consequently suffer from frequent network overload and partitioning into disconnected pieces separated by choke points with inadequate bandwidth. We propose a protocol for participants to build P2P networks in a distributed fashion, and prove that it results in connected networks of constant degree and logarithmic diameter. These properties are crucial for efficient search and data exchange. An important feature of our protocol is that it operates without global knowledge of all the nodes in the network.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/JSAC.2003.814666</doi><tpages>8</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 0733-8716 |
| ispartof | IEEE journal on selected areas in communications, 2003-08, Vol.21 (6), p.995-1002 |
| issn | 0733-8716 1558-0008 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_901693525 |
| source | IEEE Electronic Library (IEL) |
| subjects | Bandwidth Chokes Computation Computer science Construction Distributed computing Inductors IP networks Network servers Network topology Networks Partitioning Peer to peer computing Protocol (computers) Protocols Searching Vehicle dynamics |
| title | Building low-diameter peer-to-peer networks |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-06T19%3A48%3A44IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Building%20low-diameter%20peer-to-peer%20networks&rft.jtitle=IEEE%20journal%20on%20selected%20areas%20in%20communications&rft.au=Pandurangan,%20G.&rft.date=2003-08-01&rft.volume=21&rft.issue=6&rft.spage=995&rft.epage=1002&rft.pages=995-1002&rft.issn=0733-8716&rft.eissn=1558-0008&rft.coden=ISACEM&rft_id=info:doi/10.1109/JSAC.2003.814666&rft_dat=%3Cproquest_RIE%3E2429241091%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=884274141&rft_id=info:pmid/&rft_ieee_id=1217283&rfr_iscdi=true |