Greedy Forwarding in Dynamic Scale-Free Networks Embedded in Hyperbolic Metric Spaces
We show that complex (scale-free) network topologies naturally emerge from hyperbolic metric spaces. Hyperbolic geometry facilitates maximally efficient greedy forwarding in these networks. Greedy forwarding is topology-oblivious. Nevertheless, greedy packets find their destinations with 100% probab...
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 | 9 |
|---|---|
| container_issue | |
| container_start_page | 1 |
| container_title | |
| container_volume | |
| creator | Papadopoulos, Fragkiskos Krioukov, Dmitri Bogua, Marian Vahdat, Amin |
| description | We show that complex (scale-free) network topologies naturally emerge from hyperbolic metric spaces. Hyperbolic geometry facilitates maximally efficient greedy forwarding in these networks. Greedy forwarding is topology-oblivious. Nevertheless, greedy packets find their destinations with 100% probability following almost optimal shortest paths. This remarkable efficiency sustains even in highly dynamic networks. Our findings suggest that forwarding information through complex networks, such as the Internet, is possible without the overhead of existing routing protocols, and may also find practical applications in overlay networks for tasks such as application-level routing, information sharing, and data distribution. |
| doi_str_mv | 10.1109/INFCOM.2010.5462131 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_5462131</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>5462131</ieee_id><sourcerecordid>5462131</sourcerecordid><originalsourceid>FETCH-LOGICAL-i286t-48858feaec92954e6ec0809d015e45a06f93c291a03973be1c10d9de69ef72113</originalsourceid><addsrcrecordid>eNo1kMtuwjAURN2X1JTyBWzyA6G-fsVeVpQAEo9Fi9QdMvZNlTYhkRMJ5e8bVDqbke6cuYshZAJ0CkDNy2qbzXabKaPDQQrFgMMNGZtUg2BCSM11eksipgQkRqfijjz9B0rdk4imgieg1OcjGbftNx0kJAx4RPaLgOj7OKvD2QZfnL7i4hS_9SdbFS5-d7bEJBuQeIvduQ4_bTyvjug9-gu37BsMx7oc0A124dJorMP2mTzktmxxfPUR2Wfzj9kyWe8Wq9nrOimYVl0itJY6R4vOMCMFKnRUU-MpSBTSUpUb7pgBS7lJ-RHBAfXGozKYpwyAj8jk72-BiIcmFJUN_eG6EP8FDIFVag</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Greedy Forwarding in Dynamic Scale-Free Networks Embedded in Hyperbolic Metric Spaces</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Papadopoulos, Fragkiskos ; Krioukov, Dmitri ; Bogua, Marian ; Vahdat, Amin</creator><creatorcontrib>Papadopoulos, Fragkiskos ; Krioukov, Dmitri ; Bogua, Marian ; Vahdat, Amin</creatorcontrib><description>We show that complex (scale-free) network topologies naturally emerge from hyperbolic metric spaces. Hyperbolic geometry facilitates maximally efficient greedy forwarding in these networks. Greedy forwarding is topology-oblivious. Nevertheless, greedy packets find their destinations with 100% probability following almost optimal shortest paths. This remarkable efficiency sustains even in highly dynamic networks. Our findings suggest that forwarding information through complex networks, such as the Internet, is possible without the overhead of existing routing protocols, and may also find practical applications in overlay networks for tasks such as application-level routing, information sharing, and data distribution.</description><identifier>ISSN: 0743-166X</identifier><identifier>ISBN: 1424458366</identifier><identifier>ISBN: 9781424458363</identifier><identifier>EISSN: 2641-9874</identifier><identifier>EISBN: 9781424458387</identifier><identifier>EISBN: 1424458374</identifier><identifier>EISBN: 1424458382</identifier><identifier>EISBN: 9781424458370</identifier><identifier>DOI: 10.1109/INFCOM.2010.5462131</identifier><language>eng</language><publisher>IEEE</publisher><subject>Cities and towns ; Complex networks ; Extraterrestrial measurements ; Information geometry ; IP networks ; Network topology ; Peer to peer computing ; Routing ; Social network services ; Wireless sensor networks</subject><ispartof>2010 Proceedings IEEE INFOCOM, 2010, p.1-9</ispartof><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/5462131$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,778,782,787,788,2054,27912,54907</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/5462131$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Papadopoulos, Fragkiskos</creatorcontrib><creatorcontrib>Krioukov, Dmitri</creatorcontrib><creatorcontrib>Bogua, Marian</creatorcontrib><creatorcontrib>Vahdat, Amin</creatorcontrib><title>Greedy Forwarding in Dynamic Scale-Free Networks Embedded in Hyperbolic Metric Spaces</title><title>2010 Proceedings IEEE INFOCOM</title><addtitle>INFCOM</addtitle><description>We show that complex (scale-free) network topologies naturally emerge from hyperbolic metric spaces. Hyperbolic geometry facilitates maximally efficient greedy forwarding in these networks. Greedy forwarding is topology-oblivious. Nevertheless, greedy packets find their destinations with 100% probability following almost optimal shortest paths. This remarkable efficiency sustains even in highly dynamic networks. Our findings suggest that forwarding information through complex networks, such as the Internet, is possible without the overhead of existing routing protocols, and may also find practical applications in overlay networks for tasks such as application-level routing, information sharing, and data distribution.</description><subject>Cities and towns</subject><subject>Complex networks</subject><subject>Extraterrestrial measurements</subject><subject>Information geometry</subject><subject>IP networks</subject><subject>Network topology</subject><subject>Peer to peer computing</subject><subject>Routing</subject><subject>Social network services</subject><subject>Wireless sensor networks</subject><issn>0743-166X</issn><issn>2641-9874</issn><isbn>1424458366</isbn><isbn>9781424458363</isbn><isbn>9781424458387</isbn><isbn>1424458374</isbn><isbn>1424458382</isbn><isbn>9781424458370</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2010</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNo1kMtuwjAURN2X1JTyBWzyA6G-fsVeVpQAEo9Fi9QdMvZNlTYhkRMJ5e8bVDqbke6cuYshZAJ0CkDNy2qbzXabKaPDQQrFgMMNGZtUg2BCSM11eksipgQkRqfijjz9B0rdk4imgieg1OcjGbftNx0kJAx4RPaLgOj7OKvD2QZfnL7i4hS_9SdbFS5-d7bEJBuQeIvduQ4_bTyvjug9-gu37BsMx7oc0A124dJorMP2mTzktmxxfPUR2Wfzj9kyWe8Wq9nrOimYVl0itJY6R4vOMCMFKnRUU-MpSBTSUpUb7pgBS7lJ-RHBAfXGozKYpwyAj8jk72-BiIcmFJUN_eG6EP8FDIFVag</recordid><startdate>201003</startdate><enddate>201003</enddate><creator>Papadopoulos, Fragkiskos</creator><creator>Krioukov, Dmitri</creator><creator>Bogua, Marian</creator><creator>Vahdat, Amin</creator><general>IEEE</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIO</scope></search><sort><creationdate>201003</creationdate><title>Greedy Forwarding in Dynamic Scale-Free Networks Embedded in Hyperbolic Metric Spaces</title><author>Papadopoulos, Fragkiskos ; Krioukov, Dmitri ; Bogua, Marian ; Vahdat, Amin</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i286t-48858feaec92954e6ec0809d015e45a06f93c291a03973be1c10d9de69ef72113</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2010</creationdate><topic>Cities and towns</topic><topic>Complex networks</topic><topic>Extraterrestrial measurements</topic><topic>Information geometry</topic><topic>IP networks</topic><topic>Network topology</topic><topic>Peer to peer computing</topic><topic>Routing</topic><topic>Social network services</topic><topic>Wireless sensor networks</topic><toplevel>online_resources</toplevel><creatorcontrib>Papadopoulos, Fragkiskos</creatorcontrib><creatorcontrib>Krioukov, Dmitri</creatorcontrib><creatorcontrib>Bogua, Marian</creatorcontrib><creatorcontrib>Vahdat, Amin</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan (POP) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP) 1998-present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Papadopoulos, Fragkiskos</au><au>Krioukov, Dmitri</au><au>Bogua, Marian</au><au>Vahdat, Amin</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Greedy Forwarding in Dynamic Scale-Free Networks Embedded in Hyperbolic Metric Spaces</atitle><btitle>2010 Proceedings IEEE INFOCOM</btitle><stitle>INFCOM</stitle><date>2010-03</date><risdate>2010</risdate><spage>1</spage><epage>9</epage><pages>1-9</pages><issn>0743-166X</issn><eissn>2641-9874</eissn><isbn>1424458366</isbn><isbn>9781424458363</isbn><eisbn>9781424458387</eisbn><eisbn>1424458374</eisbn><eisbn>1424458382</eisbn><eisbn>9781424458370</eisbn><abstract>We show that complex (scale-free) network topologies naturally emerge from hyperbolic metric spaces. Hyperbolic geometry facilitates maximally efficient greedy forwarding in these networks. Greedy forwarding is topology-oblivious. Nevertheless, greedy packets find their destinations with 100% probability following almost optimal shortest paths. This remarkable efficiency sustains even in highly dynamic networks. Our findings suggest that forwarding information through complex networks, such as the Internet, is possible without the overhead of existing routing protocols, and may also find practical applications in overlay networks for tasks such as application-level routing, information sharing, and data distribution.</abstract><pub>IEEE</pub><doi>10.1109/INFCOM.2010.5462131</doi><tpages>9</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 0743-166X |
| ispartof | 2010 Proceedings IEEE INFOCOM, 2010, p.1-9 |
| issn | 0743-166X 2641-9874 |
| language | eng |
| recordid | cdi_ieee_primary_5462131 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Cities and towns Complex networks Extraterrestrial measurements Information geometry IP networks Network topology Peer to peer computing Routing Social network services Wireless sensor networks |
| title | Greedy Forwarding in Dynamic Scale-Free Networks Embedded in Hyperbolic Metric Spaces |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-15T15%3A13%3A45IST&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=Greedy%20Forwarding%20in%20Dynamic%20Scale-Free%20Networks%20Embedded%20in%20Hyperbolic%20Metric%20Spaces&rft.btitle=2010%20Proceedings%20IEEE%20INFOCOM&rft.au=Papadopoulos,%20Fragkiskos&rft.date=2010-03&rft.spage=1&rft.epage=9&rft.pages=1-9&rft.issn=0743-166X&rft.eissn=2641-9874&rft.isbn=1424458366&rft.isbn_list=9781424458363&rft_id=info:doi/10.1109/INFCOM.2010.5462131&rft_dat=%3Cieee_6IE%3E5462131%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=9781424458387&rft.eisbn_list=1424458374&rft.eisbn_list=1424458382&rft.eisbn_list=9781424458370&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=5462131&rfr_iscdi=true |