Towards Topology Aware Networks
We focus on efficient protocols that enhance a network with topology awareness. We discuss centralized algorithms with provable performance, and introduce decentralized asynchronous heuristics that use only local information and local computations. These algorithms are based on distributed solutions...
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 | 2595 |
|---|---|
| container_issue | |
| container_start_page | 2591 |
| container_title | |
| container_volume | |
| creator | Gkantsidis, C. Goel, G. Mihail, M. Saberi, A. |
| description | We focus on efficient protocols that enhance a network with topology awareness. We discuss centralized algorithms with provable performance, and introduce decentralized asynchronous heuristics that use only local information and local computations. These algorithms are based on distributed solutions of convex programs expressing optimization of various spectral properties of the matrix associated with the graph of the network topology. For example, these algorithms assign special weights to links crossing or directed towards small cuts by minimizing the second eigenvalue. Our main technical ingredient is to perform the decentralized asynchronous computations in a manner that preserves critical invariants of the exact second eigenvalue of the adjacency matrix associated with the network topology. |
| doi_str_mv | 10.1109/INFCOM.2007.327 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_4215909</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4215909</ieee_id><sourcerecordid>4215909</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-a4e4cec75b3fa7cb5a0def64d4f359928da22f93e4b431a3aea580d71036a05f3</originalsourceid><addsrcrecordid>eNotzE1Lw0AQgOHFDzDWnj14MH8g6czu7G72WILVQj8uEbyVSTIr0UpKUij99wr19PJcXqUeEXJECLPlZlFu17kG8LnR_kol2hFmofB0re6RNBEC-XCjEvBkMnTu405Nx_ELADC4onAhUc9Vf-KhHdOqP_T7_vOczv8s6UaOp374Hh_UbeT9KNP_TtT74qUq37LV9nVZzldZh94eMyahRhpvaxPZN7VlaCU6aikaG4IuWtY6BiNUk0E2LGwLaD2CcQw2mol6unw7Edkdhu6Hh_OONNoAwfwCZeU_tg</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Towards Topology Aware Networks</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Gkantsidis, C. ; Goel, G. ; Mihail, M. ; Saberi, A.</creator><creatorcontrib>Gkantsidis, C. ; Goel, G. ; Mihail, M. ; Saberi, A.</creatorcontrib><description>We focus on efficient protocols that enhance a network with topology awareness. We discuss centralized algorithms with provable performance, and introduce decentralized asynchronous heuristics that use only local information and local computations. These algorithms are based on distributed solutions of convex programs expressing optimization of various spectral properties of the matrix associated with the graph of the network topology. For example, these algorithms assign special weights to links crossing or directed towards small cuts by minimizing the second eigenvalue. Our main technical ingredient is to perform the decentralized asynchronous computations in a manner that preserves critical invariants of the exact second eigenvalue of the adjacency matrix associated with the network topology.</description><identifier>ISSN: 0743-166X</identifier><identifier>ISBN: 1424410479</identifier><identifier>ISBN: 9781424410477</identifier><identifier>EISSN: 2641-9874</identifier><identifier>DOI: 10.1109/INFCOM.2007.327</identifier><language>eng</language><publisher>IEEE</publisher><subject>Communications Society ; Computer networks ; Convergence ; Distributed computing ; Educational institutions ; Eigenvalues and eigenfunctions ; IP networks ; Network topology ; Protocols ; USA Councils</subject><ispartof>IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications, 2007, p.2591-2595</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/4215909$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>310,311,782,786,791,792,2062,27934,54929</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/4215909$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Gkantsidis, C.</creatorcontrib><creatorcontrib>Goel, G.</creatorcontrib><creatorcontrib>Mihail, M.</creatorcontrib><creatorcontrib>Saberi, A.</creatorcontrib><title>Towards Topology Aware Networks</title><title>IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications</title><addtitle>INFCOM</addtitle><description>We focus on efficient protocols that enhance a network with topology awareness. We discuss centralized algorithms with provable performance, and introduce decentralized asynchronous heuristics that use only local information and local computations. These algorithms are based on distributed solutions of convex programs expressing optimization of various spectral properties of the matrix associated with the graph of the network topology. For example, these algorithms assign special weights to links crossing or directed towards small cuts by minimizing the second eigenvalue. Our main technical ingredient is to perform the decentralized asynchronous computations in a manner that preserves critical invariants of the exact second eigenvalue of the adjacency matrix associated with the network topology.</description><subject>Communications Society</subject><subject>Computer networks</subject><subject>Convergence</subject><subject>Distributed computing</subject><subject>Educational institutions</subject><subject>Eigenvalues and eigenfunctions</subject><subject>IP networks</subject><subject>Network topology</subject><subject>Protocols</subject><subject>USA Councils</subject><issn>0743-166X</issn><issn>2641-9874</issn><isbn>1424410479</isbn><isbn>9781424410477</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2007</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotzE1Lw0AQgOHFDzDWnj14MH8g6czu7G72WILVQj8uEbyVSTIr0UpKUij99wr19PJcXqUeEXJECLPlZlFu17kG8LnR_kol2hFmofB0re6RNBEC-XCjEvBkMnTu405Nx_ELADC4onAhUc9Vf-KhHdOqP_T7_vOczv8s6UaOp374Hh_UbeT9KNP_TtT74qUq37LV9nVZzldZh94eMyahRhpvaxPZN7VlaCU6aikaG4IuWtY6BiNUk0E2LGwLaD2CcQw2mol6unw7Edkdhu6Hh_OONNoAwfwCZeU_tg</recordid><startdate>200705</startdate><enddate>200705</enddate><creator>Gkantsidis, C.</creator><creator>Goel, G.</creator><creator>Mihail, M.</creator><creator>Saberi, A.</creator><general>IEEE</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIO</scope></search><sort><creationdate>200705</creationdate><title>Towards Topology Aware Networks</title><author>Gkantsidis, C. ; Goel, G. ; Mihail, M. ; Saberi, A.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-a4e4cec75b3fa7cb5a0def64d4f359928da22f93e4b431a3aea580d71036a05f3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2007</creationdate><topic>Communications Society</topic><topic>Computer networks</topic><topic>Convergence</topic><topic>Distributed computing</topic><topic>Educational institutions</topic><topic>Eigenvalues and eigenfunctions</topic><topic>IP networks</topic><topic>Network topology</topic><topic>Protocols</topic><topic>USA Councils</topic><toplevel>online_resources</toplevel><creatorcontrib>Gkantsidis, C.</creatorcontrib><creatorcontrib>Goel, G.</creatorcontrib><creatorcontrib>Mihail, M.</creatorcontrib><creatorcontrib>Saberi, A.</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>Gkantsidis, C.</au><au>Goel, G.</au><au>Mihail, M.</au><au>Saberi, A.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Towards Topology Aware Networks</atitle><btitle>IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications</btitle><stitle>INFCOM</stitle><date>2007-05</date><risdate>2007</risdate><spage>2591</spage><epage>2595</epage><pages>2591-2595</pages><issn>0743-166X</issn><eissn>2641-9874</eissn><isbn>1424410479</isbn><isbn>9781424410477</isbn><abstract>We focus on efficient protocols that enhance a network with topology awareness. We discuss centralized algorithms with provable performance, and introduce decentralized asynchronous heuristics that use only local information and local computations. These algorithms are based on distributed solutions of convex programs expressing optimization of various spectral properties of the matrix associated with the graph of the network topology. For example, these algorithms assign special weights to links crossing or directed towards small cuts by minimizing the second eigenvalue. Our main technical ingredient is to perform the decentralized asynchronous computations in a manner that preserves critical invariants of the exact second eigenvalue of the adjacency matrix associated with the network topology.</abstract><pub>IEEE</pub><doi>10.1109/INFCOM.2007.327</doi><tpages>5</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 0743-166X |
| ispartof | IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications, 2007, p.2591-2595 |
| issn | 0743-166X 2641-9874 |
| language | eng |
| recordid | cdi_ieee_primary_4215909 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Communications Society Computer networks Convergence Distributed computing Educational institutions Eigenvalues and eigenfunctions IP networks Network topology Protocols USA Councils |
| title | Towards Topology Aware Networks |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-01T07%3A51%3A41IST&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=Towards%20Topology%20Aware%20Networks&rft.btitle=IEEE%20INFOCOM%202007%20-%2026th%20IEEE%20International%20Conference%20on%20Computer%20Communications&rft.au=Gkantsidis,%20C.&rft.date=2007-05&rft.spage=2591&rft.epage=2595&rft.pages=2591-2595&rft.issn=0743-166X&rft.eissn=2641-9874&rft.isbn=1424410479&rft.isbn_list=9781424410477&rft_id=info:doi/10.1109/INFCOM.2007.327&rft_dat=%3Cieee_6IE%3E4215909%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=4215909&rfr_iscdi=true |