Load Balancing and Range Queries in P2P Systems Using P-Ring

Load Balancing and Range Queries in P2P Systems Using P-Ring

In peer-to-peer (P2P) systems, computers from around the globe share data and can participate in distributed computation. P2P became famous, and infamous, due to file-sharing systems like Napster. However, the scalability and robustness of these systems make them appealing to a wide range of applica...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:ACM transactions on Internet technology 2011-03, Vol.10 (4), p.1-30
Hauptverfasser: Crainiceanu, Adina, Linga, Prakash, Machanavajjhala, Ashwin, Gehrke, Johannes, Shanmugasundaram, Jayavel
Format: Artikel
Sprache:eng
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 30
container_issue 4
container_start_page 1
container_title ACM transactions on Internet technology
container_volume 10
creator Crainiceanu, Adina
Linga, Prakash
Machanavajjhala, Ashwin
Gehrke, Johannes
Shanmugasundaram, Jayavel
description In peer-to-peer (P2P) systems, computers from around the globe share data and can participate in distributed computation. P2P became famous, and infamous, due to file-sharing systems like Napster. However, the scalability and robustness of these systems make them appealing to a wide range of applications. This article introduces P-Ring, a new peer-to-peer index structure. P-Ring is fully distributed, fault tolerant, and provides load balancing and logarithmic search performance while supporting both equality and range queries. Our theoretical analysis as well as experimental results, obtained both in a simulated environment and on PlanetLab, show the performance of our system.
doi_str_mv 10.1145/1944339.1944343
format Article
fullrecord <record><control><sourceid>crossref</sourceid><recordid>TN_cdi_crossref_primary_10_1145_1944339_1944343</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>10_1145_1944339_1944343</sourcerecordid><originalsourceid>FETCH-LOGICAL-c241t-a23a4f9429186b3c2b9cda8ec9408001ba6cbfe5e9d8e4a40ad91c270e78a9df3</originalsourceid><addsrcrecordid>eNotj0tLw0AUhQdRsFbXbucPTDt3HkkuuNHiCwLGatfhZuamRNpUMnXRf2-rWX1ncTicT4hb0DMA5-eAzlmLsz86eyYm4H2uMu3h_JStVd4iXoqrlL60Bp-BnYi7ckdRPtCG-tD1a0l9lEvq1yzff3joOMmul5Wp5Mch7Xmb5CqdapVaHnEtLlraJL4ZORWrp8fPxYsq355fF_elCsbBXpGx5Fp0BqHIGhtMgyFSwQGdLo5PGspC07JnjAU7cpoiQjC55rwgjK2divn_bhh2KQ3c1t9Dt6XhUIOuT_L1KF-P8vYXr8BK9w</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Load Balancing and Range Queries in P2P Systems Using P-Ring</title><source>ACM Digital Library Complete</source><creator>Crainiceanu, Adina ; Linga, Prakash ; Machanavajjhala, Ashwin ; Gehrke, Johannes ; Shanmugasundaram, Jayavel</creator><creatorcontrib>Crainiceanu, Adina ; Linga, Prakash ; Machanavajjhala, Ashwin ; Gehrke, Johannes ; Shanmugasundaram, Jayavel</creatorcontrib><description>In peer-to-peer (P2P) systems, computers from around the globe share data and can participate in distributed computation. P2P became famous, and infamous, due to file-sharing systems like Napster. However, the scalability and robustness of these systems make them appealing to a wide range of applications. This article introduces P-Ring, a new peer-to-peer index structure. P-Ring is fully distributed, fault tolerant, and provides load balancing and logarithmic search performance while supporting both equality and range queries. Our theoretical analysis as well as experimental results, obtained both in a simulated environment and on PlanetLab, show the performance of our system.</description><identifier>ISSN: 1533-5399</identifier><identifier>EISSN: 1557-6051</identifier><identifier>DOI: 10.1145/1944339.1944343</identifier><language>eng</language><ispartof>ACM transactions on Internet technology, 2011-03, Vol.10 (4), p.1-30</ispartof><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c241t-a23a4f9429186b3c2b9cda8ec9408001ba6cbfe5e9d8e4a40ad91c270e78a9df3</citedby><cites>FETCH-LOGICAL-c241t-a23a4f9429186b3c2b9cda8ec9408001ba6cbfe5e9d8e4a40ad91c270e78a9df3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,27901,27902</link.rule.ids></links><search><creatorcontrib>Crainiceanu, Adina</creatorcontrib><creatorcontrib>Linga, Prakash</creatorcontrib><creatorcontrib>Machanavajjhala, Ashwin</creatorcontrib><creatorcontrib>Gehrke, Johannes</creatorcontrib><creatorcontrib>Shanmugasundaram, Jayavel</creatorcontrib><title>Load Balancing and Range Queries in P2P Systems Using P-Ring</title><title>ACM transactions on Internet technology</title><description>In peer-to-peer (P2P) systems, computers from around the globe share data and can participate in distributed computation. P2P became famous, and infamous, due to file-sharing systems like Napster. However, the scalability and robustness of these systems make them appealing to a wide range of applications. This article introduces P-Ring, a new peer-to-peer index structure. P-Ring is fully distributed, fault tolerant, and provides load balancing and logarithmic search performance while supporting both equality and range queries. Our theoretical analysis as well as experimental results, obtained both in a simulated environment and on PlanetLab, show the performance of our system.</description><issn>1533-5399</issn><issn>1557-6051</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2011</creationdate><recordtype>article</recordtype><recordid>eNotj0tLw0AUhQdRsFbXbucPTDt3HkkuuNHiCwLGatfhZuamRNpUMnXRf2-rWX1ncTicT4hb0DMA5-eAzlmLsz86eyYm4H2uMu3h_JStVd4iXoqrlL60Bp-BnYi7ckdRPtCG-tD1a0l9lEvq1yzff3joOMmul5Wp5Mch7Xmb5CqdapVaHnEtLlraJL4ZORWrp8fPxYsq355fF_elCsbBXpGx5Fp0BqHIGhtMgyFSwQGdLo5PGspC07JnjAU7cpoiQjC55rwgjK2divn_bhh2KQ3c1t9Dt6XhUIOuT_L1KF-P8vYXr8BK9w</recordid><startdate>201103</startdate><enddate>201103</enddate><creator>Crainiceanu, Adina</creator><creator>Linga, Prakash</creator><creator>Machanavajjhala, Ashwin</creator><creator>Gehrke, Johannes</creator><creator>Shanmugasundaram, Jayavel</creator><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>201103</creationdate><title>Load Balancing and Range Queries in P2P Systems Using P-Ring</title><author>Crainiceanu, Adina ; Linga, Prakash ; Machanavajjhala, Ashwin ; Gehrke, Johannes ; Shanmugasundaram, Jayavel</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c241t-a23a4f9429186b3c2b9cda8ec9408001ba6cbfe5e9d8e4a40ad91c270e78a9df3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2011</creationdate><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Crainiceanu, Adina</creatorcontrib><creatorcontrib>Linga, Prakash</creatorcontrib><creatorcontrib>Machanavajjhala, Ashwin</creatorcontrib><creatorcontrib>Gehrke, Johannes</creatorcontrib><creatorcontrib>Shanmugasundaram, Jayavel</creatorcontrib><collection>CrossRef</collection><jtitle>ACM transactions on Internet technology</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Crainiceanu, Adina</au><au>Linga, Prakash</au><au>Machanavajjhala, Ashwin</au><au>Gehrke, Johannes</au><au>Shanmugasundaram, Jayavel</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Load Balancing and Range Queries in P2P Systems Using P-Ring</atitle><jtitle>ACM transactions on Internet technology</jtitle><date>2011-03</date><risdate>2011</risdate><volume>10</volume><issue>4</issue><spage>1</spage><epage>30</epage><pages>1-30</pages><issn>1533-5399</issn><eissn>1557-6051</eissn><abstract>In peer-to-peer (P2P) systems, computers from around the globe share data and can participate in distributed computation. P2P became famous, and infamous, due to file-sharing systems like Napster. However, the scalability and robustness of these systems make them appealing to a wide range of applications. This article introduces P-Ring, a new peer-to-peer index structure. P-Ring is fully distributed, fault tolerant, and provides load balancing and logarithmic search performance while supporting both equality and range queries. Our theoretical analysis as well as experimental results, obtained both in a simulated environment and on PlanetLab, show the performance of our system.</abstract><doi>10.1145/1944339.1944343</doi><tpages>30</tpages></addata></record>
fulltext fulltext
identifier ISSN: 1533-5399
ispartof ACM transactions on Internet technology, 2011-03, Vol.10 (4), p.1-30
issn 1533-5399
1557-6051
language eng
recordid cdi_crossref_primary_10_1145_1944339_1944343
source ACM Digital Library Complete
title Load Balancing and Range Queries in P2P Systems Using P-Ring
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-31T23%3A46%3A04IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-crossref&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Load%20Balancing%20and%20Range%20Queries%20in%20P2P%20Systems%20Using%20P-Ring&rft.jtitle=ACM%20transactions%20on%20Internet%20technology&rft.au=Crainiceanu,%20Adina&rft.date=2011-03&rft.volume=10&rft.issue=4&rft.spage=1&rft.epage=30&rft.pages=1-30&rft.issn=1533-5399&rft.eissn=1557-6051&rft_id=info:doi/10.1145/1944339.1944343&rft_dat=%3Ccrossref%3E10_1145_1944339_1944343%3C/crossref%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true