Efficient Broadcast in Structured P2P Networks
In this position paper, we present an efficient algorithm for performing a broadcast operation with minimal cost in structured DHT-based P2P networks. In a system of N nodes, a broadcast message originating at an arbitrary node reaches all other nodes after exactly N − 1 messages. We emphasize the p...
Gespeichert in:
| Veröffentlicht in: | Lecture notes in computer science 2003, Vol.2735, p.304-314 |
|---|---|
| Hauptverfasser: | , , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 314 |
|---|---|
| container_issue | |
| container_start_page | 304 |
| container_title | Lecture notes in computer science |
| container_volume | 2735 |
| creator | El-Ansary, Sameh Alima, Luc Onana Brand, Per Haridi, Seif |
| description | In this position paper, we present an efficient algorithm for performing a broadcast operation with minimal cost in structured DHT-based P2P networks. In a system of N nodes, a broadcast message originating at an arbitrary node reaches all other nodes after exactly N − 1 messages. We emphasize the perception of a class of DHT systems as a form of distributed k-ary search and we take advantage of that perception in constructing a spanning tree that is utilized for efficient broadcasting. We consider broadcasting as a basic service that adds to existing DHTs the ability to search using arbitrary queries as well as dissiminate/collect global information. |
| doi_str_mv | 10.1007/978-3-540-45172-3_28 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_swepu</sourceid><recordid>TN_cdi_pascalfrancis_primary_15690845</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>EBC3088836_26_314</sourcerecordid><originalsourceid>FETCH-LOGICAL-c426t-4feffbcec2f1990cc7735508daacce6103db42f8e2442708ada4b5ef59da49023</originalsourceid><addsrcrecordid>eNpFkEtPHDEQhE1Coqxg_wGHueQWg-328wiEPCQUkCC5tjweGya77Cy2V4h_Hy-sQl_cqq4qWR8hR5wdc8bMiTOWAlWSUam4ERRQ2D0ybzI08UWDd2TGNecUQLr3bzdmhHT7ZMaACeqMhI9k5hRorZTmn8i8lL-sDQilrJmR44uUxjDGVe3O8uSH4EvtxlV3U_Mm1E2OQ3ctrrtfsT5NeVEOyYfklyXOd-8B-f3t4vb8B728-v7z_PSSBil0pTLFlPoQg0jcORaCMaAUs4P3IUTNGQy9FMlGIaUwzPrBy17FpFxbHBNwQL689panuN70uM7jg8_POPkRv45_TnHKd7io9yhaq232z6_2tS_BL1P2qzCW_ymutGNWquYTu9p2Wt3FjP00LQpyhlvu2CAiYMOIL4xxy72FYFeep8dNLBXjNhUas-yX4d6va8wFoX3EgkahEbiEf7cJf5s</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>EBC3088836_26_314</pqid></control><display><type>article</type><title>Efficient Broadcast in Structured P2P Networks</title><source>Springer Books</source><creator>El-Ansary, Sameh ; Alima, Luc Onana ; Brand, Per ; Haridi, Seif</creator><contributor>Stoica, Ion ; Kaashoek, Frans ; Stoica, Ion ; Kaashoek, M. Frans</contributor><creatorcontrib>El-Ansary, Sameh ; Alima, Luc Onana ; Brand, Per ; Haridi, Seif ; Stoica, Ion ; Kaashoek, Frans ; Stoica, Ion ; Kaashoek, M. Frans</creatorcontrib><description>In this position paper, we present an efficient algorithm for performing a broadcast operation with minimal cost in structured DHT-based P2P networks. In a system of N nodes, a broadcast message originating at an arbitrary node reaches all other nodes after exactly N − 1 messages. We emphasize the perception of a class of DHT systems as a form of distributed k-ary search and we take advantage of that perception in constructing a spanning tree that is utilized for efficient broadcasting. We consider broadcasting as a basic service that adds to existing DHTs the ability to search using arbitrary queries as well as dissiminate/collect global information.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISSN: 1611-3349</identifier><identifier>ISBN: 9783540407249</identifier><identifier>ISBN: 3540407243</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 9783540451723</identifier><identifier>EISBN: 3540451722</identifier><identifier>DOI: 10.1007/978-3-540-45172-3_28</identifier><identifier>OCLC: 953665561</identifier><identifier>LCCallNum: TK5105.5-5105.9</identifier><language>eng</language><publisher>Germany: Springer Berlin / Heidelberg</publisher><subject>Applied sciences ; Computer engineering ; Computer science; control theory; systems ; Computer systems and distributed systems. User interface ; Datorteknik ; Exact sciences and technology ; Information technology ; Informationsteknik ; Software ; TECHNOLOGY ; TEKNIKVETENSKAP</subject><ispartof>Lecture notes in computer science, 2003, Vol.2735, p.304-314</ispartof><rights>Springer-Verlag Berlin Heidelberg 2003</rights><rights>2004 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c426t-4feffbcec2f1990cc7735508daacce6103db42f8e2442708ada4b5ef59da49023</citedby></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Uhttps://ebookcentral.proquest.com/covers/3088836-l.jpg</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/978-3-540-45172-3_28$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/978-3-540-45172-3_28$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,775,776,780,785,786,789,881,4036,4037,27902,38232,41418,42487</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=15690845$$DView record in Pascal Francis$$Hfree_for_read</backlink><backlink>$$Uhttps://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-25088$$DView record from Swedish Publication Index$$Hfree_for_read</backlink></links><search><contributor>Stoica, Ion</contributor><contributor>Kaashoek, Frans</contributor><contributor>Stoica, Ion</contributor><contributor>Kaashoek, M. Frans</contributor><creatorcontrib>El-Ansary, Sameh</creatorcontrib><creatorcontrib>Alima, Luc Onana</creatorcontrib><creatorcontrib>Brand, Per</creatorcontrib><creatorcontrib>Haridi, Seif</creatorcontrib><title>Efficient Broadcast in Structured P2P Networks</title><title>Lecture notes in computer science</title><description>In this position paper, we present an efficient algorithm for performing a broadcast operation with minimal cost in structured DHT-based P2P networks. In a system of N nodes, a broadcast message originating at an arbitrary node reaches all other nodes after exactly N − 1 messages. We emphasize the perception of a class of DHT systems as a form of distributed k-ary search and we take advantage of that perception in constructing a spanning tree that is utilized for efficient broadcasting. We consider broadcasting as a basic service that adds to existing DHTs the ability to search using arbitrary queries as well as dissiminate/collect global information.</description><subject>Applied sciences</subject><subject>Computer engineering</subject><subject>Computer science; control theory; systems</subject><subject>Computer systems and distributed systems. User interface</subject><subject>Datorteknik</subject><subject>Exact sciences and technology</subject><subject>Information technology</subject><subject>Informationsteknik</subject><subject>Software</subject><subject>TECHNOLOGY</subject><subject>TEKNIKVETENSKAP</subject><issn>0302-9743</issn><issn>1611-3349</issn><issn>1611-3349</issn><isbn>9783540407249</isbn><isbn>3540407243</isbn><isbn>9783540451723</isbn><isbn>3540451722</isbn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2003</creationdate><recordtype>article</recordtype><recordid>eNpFkEtPHDEQhE1Coqxg_wGHueQWg-328wiEPCQUkCC5tjweGya77Cy2V4h_Hy-sQl_cqq4qWR8hR5wdc8bMiTOWAlWSUam4ERRQ2D0ybzI08UWDd2TGNecUQLr3bzdmhHT7ZMaACeqMhI9k5hRorZTmn8i8lL-sDQilrJmR44uUxjDGVe3O8uSH4EvtxlV3U_Mm1E2OQ3ctrrtfsT5NeVEOyYfklyXOd-8B-f3t4vb8B728-v7z_PSSBil0pTLFlPoQg0jcORaCMaAUs4P3IUTNGQy9FMlGIaUwzPrBy17FpFxbHBNwQL689panuN70uM7jg8_POPkRv45_TnHKd7io9yhaq232z6_2tS_BL1P2qzCW_ymutGNWquYTu9p2Wt3FjP00LQpyhlvu2CAiYMOIL4xxy72FYFeep8dNLBXjNhUas-yX4d6va8wFoX3EgkahEbiEf7cJf5s</recordid><startdate>2003</startdate><enddate>2003</enddate><creator>El-Ansary, Sameh</creator><creator>Alima, Luc Onana</creator><creator>Brand, Per</creator><creator>Haridi, Seif</creator><general>Springer Berlin / Heidelberg</general><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>FFUUA</scope><scope>IQODW</scope><scope>ADTPV</scope><scope>AOWAS</scope><scope>D8V</scope></search><sort><creationdate>2003</creationdate><title>Efficient Broadcast in Structured P2P Networks</title><author>El-Ansary, Sameh ; Alima, Luc Onana ; Brand, Per ; Haridi, Seif</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c426t-4feffbcec2f1990cc7735508daacce6103db42f8e2442708ada4b5ef59da49023</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2003</creationdate><topic>Applied sciences</topic><topic>Computer engineering</topic><topic>Computer science; control theory; systems</topic><topic>Computer systems and distributed systems. User interface</topic><topic>Datorteknik</topic><topic>Exact sciences and technology</topic><topic>Information technology</topic><topic>Informationsteknik</topic><topic>Software</topic><topic>TECHNOLOGY</topic><topic>TEKNIKVETENSKAP</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>El-Ansary, Sameh</creatorcontrib><creatorcontrib>Alima, Luc Onana</creatorcontrib><creatorcontrib>Brand, Per</creatorcontrib><creatorcontrib>Haridi, Seif</creatorcontrib><collection>ProQuest Ebook Central - Book Chapters - Demo use only</collection><collection>Pascal-Francis</collection><collection>SwePub</collection><collection>SwePub Articles</collection><collection>SWEPUB Kungliga Tekniska Högskolan</collection><jtitle>Lecture notes in computer science</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>El-Ansary, Sameh</au><au>Alima, Luc Onana</au><au>Brand, Per</au><au>Haridi, Seif</au><au>Stoica, Ion</au><au>Kaashoek, Frans</au><au>Stoica, Ion</au><au>Kaashoek, M. Frans</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Efficient Broadcast in Structured P2P Networks</atitle><jtitle>Lecture notes in computer science</jtitle><date>2003</date><risdate>2003</risdate><volume>2735</volume><spage>304</spage><epage>314</epage><pages>304-314</pages><issn>0302-9743</issn><issn>1611-3349</issn><eissn>1611-3349</eissn><isbn>9783540407249</isbn><isbn>3540407243</isbn><eisbn>9783540451723</eisbn><eisbn>3540451722</eisbn><abstract>In this position paper, we present an efficient algorithm for performing a broadcast operation with minimal cost in structured DHT-based P2P networks. In a system of N nodes, a broadcast message originating at an arbitrary node reaches all other nodes after exactly N − 1 messages. We emphasize the perception of a class of DHT systems as a form of distributed k-ary search and we take advantage of that perception in constructing a spanning tree that is utilized for efficient broadcasting. We consider broadcasting as a basic service that adds to existing DHTs the ability to search using arbitrary queries as well as dissiminate/collect global information.</abstract><cop>Germany</cop><pub>Springer Berlin / Heidelberg</pub><doi>10.1007/978-3-540-45172-3_28</doi><oclcid>953665561</oclcid><tpages>11</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0302-9743 |
| ispartof | Lecture notes in computer science, 2003, Vol.2735, p.304-314 |
| issn | 0302-9743 1611-3349 1611-3349 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_15690845 |
| source | Springer Books |
| subjects | Applied sciences Computer engineering Computer science control theory systems Computer systems and distributed systems. User interface Datorteknik Exact sciences and technology Information technology Informationsteknik Software TECHNOLOGY TEKNIKVETENSKAP |
| title | Efficient Broadcast in Structured P2P 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-01T11%3A15%3A37IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_swepu&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Efficient%20Broadcast%20in%20Structured%20P2P%20Networks&rft.jtitle=Lecture%20notes%20in%20computer%20science&rft.au=El-Ansary,%20Sameh&rft.date=2003&rft.volume=2735&rft.spage=304&rft.epage=314&rft.pages=304-314&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=9783540407249&rft.isbn_list=3540407243&rft_id=info:doi/10.1007/978-3-540-45172-3_28&rft_dat=%3Cproquest_swepu%3EEBC3088836_26_314%3C/proquest_swepu%3E%3Curl%3E%3C/url%3E&rft.eisbn=9783540451723&rft.eisbn_list=3540451722&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=EBC3088836_26_314&rft_id=info:pmid/&rfr_iscdi=true |