Flocks: Interest-Based Construction of Overlay Networks
Self-organizing overlay networks have received a lot of attention in the recent years. However, despite the popularity of content-aware and topology-aware overlay networks, surprisingly little research has been done to combine both approaches. In this paper, we create robust and flexible overlay net...
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 | 124 |
|---|---|
| container_issue | |
| container_start_page | 119 |
| container_title | |
| container_volume | |
| creator | Wieser, Stefan Böszörmenyi, Laszlo |
| description | Self-organizing overlay networks have received a lot of attention in the recent years. However, despite the popularity of content-aware and topology-aware overlay networks, surprisingly little research has been done to combine both approaches. In this paper, we create robust and flexible overlay networks that we call "Flocks", which can be content-aware, topology-aware, or a combination of both. We model affinity with interests and properties and show the resulting overlay networks work in a decentralized, self-organizing way, and stabilize quickly. |
| doi_str_mv | 10.1109/MMEDIA.2010.22 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_5501616</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>5501616</ieee_id><sourcerecordid>5501616</sourcerecordid><originalsourceid>FETCH-LOGICAL-i90t-fe6dc6d1d62fad55d3721cf17b9136eefa3f157cde8a1667b2870361a55ad2ff3</originalsourceid><addsrcrecordid>eNotjD1PwzAUAI0QErR0ZWHJH0jx88dzwlZCC5FaunSvXPtZCg0Jsg2o_55KcMtJNxxjd8DnALx-2GyWz-1iLvg5CHHBJtxgrRXHCi_ZBJRQyghj8JrNUnrnZ5QWHNUNM6t-dMf0WLRDpkgpl082kS-acUg5frncjUMxhmL7TbG3p-KN8s8Yj-mWXQXbJ5r9e8p2q-WueS3X25e2WazLrua5DITeoQePIlivtZdGgAtgDjVIJApWBtDGeaosIJqDqAyXCFZr60UIcsru_7YdEe0_Y_dh42mvNQcElL9z8EZL</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Flocks: Interest-Based Construction of Overlay Networks</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Wieser, Stefan ; Böszörmenyi, Laszlo</creator><creatorcontrib>Wieser, Stefan ; Böszörmenyi, Laszlo</creatorcontrib><description>Self-organizing overlay networks have received a lot of attention in the recent years. However, despite the popularity of content-aware and topology-aware overlay networks, surprisingly little research has been done to combine both approaches. In this paper, we create robust and flexible overlay networks that we call "Flocks", which can be content-aware, topology-aware, or a combination of both. We model affinity with interests and properties and show the resulting overlay networks work in a decentralized, self-organizing way, and stabilize quickly.</description><identifier>ISBN: 1424472776</identifier><identifier>ISBN: 9781424472772</identifier><identifier>EISBN: 0769540686</identifier><identifier>EISBN: 9781424472789</identifier><identifier>EISBN: 9780769540689</identifier><identifier>EISBN: 1424472784</identifier><identifier>DOI: 10.1109/MMEDIA.2010.22</identifier><language>eng</language><publisher>IEEE</publisher><subject>Content based retrieval ; Delay estimation ; distributed (networks) ; Information technology ; Overlay (networks) ; Peer to peer computing ; Predictive models ; Propagation delay ; Quality of service ; Relays ; Robustness ; self-organization ; Uncertainty</subject><ispartof>2010 Second International Conferences on Advances in Multimedia, 2010, p.119-124</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/5501616$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,778,782,787,788,2054,27908,54903</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/5501616$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Wieser, Stefan</creatorcontrib><creatorcontrib>Böszörmenyi, Laszlo</creatorcontrib><title>Flocks: Interest-Based Construction of Overlay Networks</title><title>2010 Second International Conferences on Advances in Multimedia</title><addtitle>MMEDIA</addtitle><description>Self-organizing overlay networks have received a lot of attention in the recent years. However, despite the popularity of content-aware and topology-aware overlay networks, surprisingly little research has been done to combine both approaches. In this paper, we create robust and flexible overlay networks that we call "Flocks", which can be content-aware, topology-aware, or a combination of both. We model affinity with interests and properties and show the resulting overlay networks work in a decentralized, self-organizing way, and stabilize quickly.</description><subject>Content based retrieval</subject><subject>Delay estimation</subject><subject>distributed (networks)</subject><subject>Information technology</subject><subject>Overlay (networks)</subject><subject>Peer to peer computing</subject><subject>Predictive models</subject><subject>Propagation delay</subject><subject>Quality of service</subject><subject>Relays</subject><subject>Robustness</subject><subject>self-organization</subject><subject>Uncertainty</subject><isbn>1424472776</isbn><isbn>9781424472772</isbn><isbn>0769540686</isbn><isbn>9781424472789</isbn><isbn>9780769540689</isbn><isbn>1424472784</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2010</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotjD1PwzAUAI0QErR0ZWHJH0jx88dzwlZCC5FaunSvXPtZCg0Jsg2o_55KcMtJNxxjd8DnALx-2GyWz-1iLvg5CHHBJtxgrRXHCi_ZBJRQyghj8JrNUnrnZ5QWHNUNM6t-dMf0WLRDpkgpl082kS-acUg5frncjUMxhmL7TbG3p-KN8s8Yj-mWXQXbJ5r9e8p2q-WueS3X25e2WazLrua5DITeoQePIlivtZdGgAtgDjVIJApWBtDGeaosIJqDqAyXCFZr60UIcsru_7YdEe0_Y_dh42mvNQcElL9z8EZL</recordid><startdate>201006</startdate><enddate>201006</enddate><creator>Wieser, Stefan</creator><creator>Böszörmenyi, Laszlo</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>201006</creationdate><title>Flocks: Interest-Based Construction of Overlay Networks</title><author>Wieser, Stefan ; Böszörmenyi, Laszlo</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i90t-fe6dc6d1d62fad55d3721cf17b9136eefa3f157cde8a1667b2870361a55ad2ff3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2010</creationdate><topic>Content based retrieval</topic><topic>Delay estimation</topic><topic>distributed (networks)</topic><topic>Information technology</topic><topic>Overlay (networks)</topic><topic>Peer to peer computing</topic><topic>Predictive models</topic><topic>Propagation delay</topic><topic>Quality of service</topic><topic>Relays</topic><topic>Robustness</topic><topic>self-organization</topic><topic>Uncertainty</topic><toplevel>online_resources</toplevel><creatorcontrib>Wieser, Stefan</creatorcontrib><creatorcontrib>Böszörmenyi, Laszlo</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>Wieser, Stefan</au><au>Böszörmenyi, Laszlo</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Flocks: Interest-Based Construction of Overlay Networks</atitle><btitle>2010 Second International Conferences on Advances in Multimedia</btitle><stitle>MMEDIA</stitle><date>2010-06</date><risdate>2010</risdate><spage>119</spage><epage>124</epage><pages>119-124</pages><isbn>1424472776</isbn><isbn>9781424472772</isbn><eisbn>0769540686</eisbn><eisbn>9781424472789</eisbn><eisbn>9780769540689</eisbn><eisbn>1424472784</eisbn><abstract>Self-organizing overlay networks have received a lot of attention in the recent years. However, despite the popularity of content-aware and topology-aware overlay networks, surprisingly little research has been done to combine both approaches. In this paper, we create robust and flexible overlay networks that we call "Flocks", which can be content-aware, topology-aware, or a combination of both. We model affinity with interests and properties and show the resulting overlay networks work in a decentralized, self-organizing way, and stabilize quickly.</abstract><pub>IEEE</pub><doi>10.1109/MMEDIA.2010.22</doi><tpages>6</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISBN: 1424472776 |
| ispartof | 2010 Second International Conferences on Advances in Multimedia, 2010, p.119-124 |
| issn | |
| language | eng |
| recordid | cdi_ieee_primary_5501616 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Content based retrieval Delay estimation distributed (networks) Information technology Overlay (networks) Peer to peer computing Predictive models Propagation delay Quality of service Relays Robustness self-organization Uncertainty |
| title | Flocks: Interest-Based Construction of Overlay Networks |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-17T06%3A52%3A54IST&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=Flocks:%20Interest-Based%20Construction%20of%20Overlay%20Networks&rft.btitle=2010%20Second%20International%20Conferences%20on%20Advances%20in%20Multimedia&rft.au=Wieser,%20Stefan&rft.date=2010-06&rft.spage=119&rft.epage=124&rft.pages=119-124&rft.isbn=1424472776&rft.isbn_list=9781424472772&rft_id=info:doi/10.1109/MMEDIA.2010.22&rft_dat=%3Cieee_6IE%3E5501616%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=0769540686&rft.eisbn_list=9781424472789&rft.eisbn_list=9780769540689&rft.eisbn_list=1424472784&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=5501616&rfr_iscdi=true |