Exploiting Power-Law Node Degree Distribution in Chord Overlays
In this paper, we propose to extend the topology of Chord to a bidirectional graph to provide a super-peer based lookup algorithm and a scalable broadcast search support. We consider routing algorithms for a bidirectional variant of Chord network and show how the resulting structure extends the sear...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 5 |
|---|---|
| container_issue | |
| container_start_page | 1 |
| container_title | |
| container_volume | |
| creator | Ktari, S. Hecker, A. Labiod, H. |
| description | In this paper, we propose to extend the topology of Chord to a bidirectional graph to provide a super-peer based lookup algorithm and a scalable broadcast search support. We consider routing algorithms for a bidirectional variant of Chord network and show how the resulting structure extends the search region and provides an efficient resource lookup service at a very little additional cost. |
| doi_str_mv | 10.1109/NGI.2009.5175761 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_5175761</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>5175761</ieee_id><sourcerecordid>5175761</sourcerecordid><originalsourceid>FETCH-LOGICAL-i90t-b9d75b4f5ce9415c881e148b526a49e0446cce48e473381f573ca390cbe0b75e3</originalsourceid><addsrcrecordid>eNo1T1FLwzAYjMhAN_su-JI_0Jo0X5rkSWTOOSibD3sfSfp1Rmo70urcv7fivOM4Do6DI-SWs4xzZu7Xy1WWM2YyyZVUBb8giVGaQw4wSsIlmf4HEBMy_e0axo3WVyTp-3c2Qko98po8LL4PTReG0O7pa3fEmJb2SNddhfQJ9xFHC_0Qg_scQtfS0NL5WxcruvnC2NhTf0MmtW16TM4-I9vnxXb-kpab5Wr-WKbBsCF1plLSQS09GuDSa82Rg3YyLywYZACF9wgaQQmheS2V8FYY5h0ypySKGbn7mw2IuDvE8GHjaXf-L34A4DFLFQ</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Exploiting Power-Law Node Degree Distribution in Chord Overlays</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Ktari, S. ; Hecker, A. ; Labiod, H.</creator><creatorcontrib>Ktari, S. ; Hecker, A. ; Labiod, H.</creatorcontrib><description>In this paper, we propose to extend the topology of Chord to a bidirectional graph to provide a super-peer based lookup algorithm and a scalable broadcast search support. We consider routing algorithms for a bidirectional variant of Chord network and show how the resulting structure extends the search region and provides an efficient resource lookup service at a very little additional cost.</description><identifier>ISBN: 1424442443</identifier><identifier>ISBN: 9781424442447</identifier><identifier>EISBN: 9781424442454</identifier><identifier>EISBN: 1424442451</identifier><identifier>DOI: 10.1109/NGI.2009.5175761</identifier><identifier>LCCN: 2009901988</identifier><language>eng</language><publisher>IEEE</publisher><subject>Broadcasting ; Computer network reliability ; Computer networks ; Costs ; Distributed computing ; Floods ; Network topology ; Peer to peer computing ; Routing ; Telecommunication network topology</subject><ispartof>2009 Next Generation Internet Networks, 2009, p.1-5</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/5175761$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2052,27902,54895</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/5175761$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Ktari, S.</creatorcontrib><creatorcontrib>Hecker, A.</creatorcontrib><creatorcontrib>Labiod, H.</creatorcontrib><title>Exploiting Power-Law Node Degree Distribution in Chord Overlays</title><title>2009 Next Generation Internet Networks</title><addtitle>NGI</addtitle><description>In this paper, we propose to extend the topology of Chord to a bidirectional graph to provide a super-peer based lookup algorithm and a scalable broadcast search support. We consider routing algorithms for a bidirectional variant of Chord network and show how the resulting structure extends the search region and provides an efficient resource lookup service at a very little additional cost.</description><subject>Broadcasting</subject><subject>Computer network reliability</subject><subject>Computer networks</subject><subject>Costs</subject><subject>Distributed computing</subject><subject>Floods</subject><subject>Network topology</subject><subject>Peer to peer computing</subject><subject>Routing</subject><subject>Telecommunication network topology</subject><isbn>1424442443</isbn><isbn>9781424442447</isbn><isbn>9781424442454</isbn><isbn>1424442451</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2009</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNo1T1FLwzAYjMhAN_su-JI_0Jo0X5rkSWTOOSibD3sfSfp1Rmo70urcv7fivOM4Do6DI-SWs4xzZu7Xy1WWM2YyyZVUBb8giVGaQw4wSsIlmf4HEBMy_e0axo3WVyTp-3c2Qko98po8LL4PTReG0O7pa3fEmJb2SNddhfQJ9xFHC_0Qg_scQtfS0NL5WxcruvnC2NhTf0MmtW16TM4-I9vnxXb-kpab5Wr-WKbBsCF1plLSQS09GuDSa82Rg3YyLywYZACF9wgaQQmheS2V8FYY5h0ypySKGbn7mw2IuDvE8GHjaXf-L34A4DFLFQ</recordid><startdate>200907</startdate><enddate>200907</enddate><creator>Ktari, S.</creator><creator>Hecker, A.</creator><creator>Labiod, H.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>200907</creationdate><title>Exploiting Power-Law Node Degree Distribution in Chord Overlays</title><author>Ktari, S. ; Hecker, A. ; Labiod, H.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i90t-b9d75b4f5ce9415c881e148b526a49e0446cce48e473381f573ca390cbe0b75e3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2009</creationdate><topic>Broadcasting</topic><topic>Computer network reliability</topic><topic>Computer networks</topic><topic>Costs</topic><topic>Distributed computing</topic><topic>Floods</topic><topic>Network topology</topic><topic>Peer to peer computing</topic><topic>Routing</topic><topic>Telecommunication network topology</topic><toplevel>online_resources</toplevel><creatorcontrib>Ktari, S.</creatorcontrib><creatorcontrib>Hecker, A.</creatorcontrib><creatorcontrib>Labiod, H.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Ktari, S.</au><au>Hecker, A.</au><au>Labiod, H.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Exploiting Power-Law Node Degree Distribution in Chord Overlays</atitle><btitle>2009 Next Generation Internet Networks</btitle><stitle>NGI</stitle><date>2009-07</date><risdate>2009</risdate><spage>1</spage><epage>5</epage><pages>1-5</pages><isbn>1424442443</isbn><isbn>9781424442447</isbn><eisbn>9781424442454</eisbn><eisbn>1424442451</eisbn><abstract>In this paper, we propose to extend the topology of Chord to a bidirectional graph to provide a super-peer based lookup algorithm and a scalable broadcast search support. We consider routing algorithms for a bidirectional variant of Chord network and show how the resulting structure extends the search region and provides an efficient resource lookup service at a very little additional cost.</abstract><pub>IEEE</pub><doi>10.1109/NGI.2009.5175761</doi><tpages>5</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISBN: 1424442443 |
| ispartof | 2009 Next Generation Internet Networks, 2009, p.1-5 |
| issn | |
| language | eng |
| recordid | cdi_ieee_primary_5175761 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Broadcasting Computer network reliability Computer networks Costs Distributed computing Floods Network topology Peer to peer computing Routing Telecommunication network topology |
| title | Exploiting Power-Law Node Degree Distribution in Chord Overlays |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-08T13%3A33%3A08IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Exploiting%20Power-Law%20Node%20Degree%20Distribution%20in%20Chord%20Overlays&rft.btitle=2009%20Next%20Generation%20Internet%20Networks&rft.au=Ktari,%20S.&rft.date=2009-07&rft.spage=1&rft.epage=5&rft.pages=1-5&rft.isbn=1424442443&rft.isbn_list=9781424442447&rft_id=info:doi/10.1109/NGI.2009.5175761&rft_dat=%3Cieee_6IE%3E5175761%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=9781424442454&rft.eisbn_list=1424442451&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=5175761&rfr_iscdi=true |