Kevin: de Bruijn-based topology with demand-aware links and greedy routing
We propose Kevin, a novel demand-aware reconfigurable rack-to-rack datacenter network realized with a simple and efficient control plane. In particular, Kevin makes effective use of the network capacity by supporting integrated and multi-hop routing as well as work-conserving scheduling. To this end...
Gespeichert in:
| Hauptverfasser: | , , , , |
|---|---|
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | |
| container_volume | |
| creator | Zerwas, Johannes Györgyi, Csaba Blenk, Andreas Schmid, Stefan Avin, Chen |
| description | We propose Kevin, a novel demand-aware reconfigurable rack-to-rack datacenter
network realized with a simple and efficient control plane. In particular,
Kevin makes effective use of the network capacity by supporting integrated and
multi-hop routing as well as work-conserving scheduling. To this end, Kevin
relies on local greedy routing with small forwarding tables which require local
updates only during topological reconfigurations, making this approach ideal
for dynamic networks. Specifically, Kevin is based on a de Bruijn topology
(using a small number of optical circuit switches) in which static links are
enhanced with opportunistic links. |
| doi_str_mv | 10.48550/arxiv.2202.05487 |
| format | Article |
| fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2202_05487</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2202_05487</sourcerecordid><originalsourceid>FETCH-LOGICAL-a677-343dda1d4dbf014f1098e6ba731c09f4e04a1abdf203c0af155f92981244a7c93</originalsourceid><addsrcrecordid>eNotz8tOwzAUBFBvWKDCB7Cqf8Dh-lXH7KDiXYlN99FNbKeG1KmctCV_TymsRqORRjqE3HAoVKk13GL-jodCCBAFaFWaS_L27g8x3VHn6UPex8_Eahy8o2O_67u-negxjpvTusXkGB4xe9rF9DXQU6dt9t5NNPf7Mab2ilwE7AZ__Z8zsn56XC9f2Orj-XV5v2K4MIZJJZ1D7pSrA3AVONjSL2o0kjdgg_KgkGPtggDZAAaudbDCllwohaaxckbmf7dnTLXLcYt5qn5R1RklfwAz9UdW</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Kevin: de Bruijn-based topology with demand-aware links and greedy routing</title><source>arXiv.org</source><creator>Zerwas, Johannes ; Györgyi, Csaba ; Blenk, Andreas ; Schmid, Stefan ; Avin, Chen</creator><creatorcontrib>Zerwas, Johannes ; Györgyi, Csaba ; Blenk, Andreas ; Schmid, Stefan ; Avin, Chen</creatorcontrib><description>We propose Kevin, a novel demand-aware reconfigurable rack-to-rack datacenter
network realized with a simple and efficient control plane. In particular,
Kevin makes effective use of the network capacity by supporting integrated and
multi-hop routing as well as work-conserving scheduling. To this end, Kevin
relies on local greedy routing with small forwarding tables which require local
updates only during topological reconfigurations, making this approach ideal
for dynamic networks. Specifically, Kevin is based on a de Bruijn topology
(using a small number of optical circuit switches) in which static links are
enhanced with opportunistic links.</description><identifier>DOI: 10.48550/arxiv.2202.05487</identifier><language>eng</language><subject>Computer Science - Networking and Internet Architecture</subject><creationdate>2022-02</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,781,886</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2202.05487$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2202.05487$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Zerwas, Johannes</creatorcontrib><creatorcontrib>Györgyi, Csaba</creatorcontrib><creatorcontrib>Blenk, Andreas</creatorcontrib><creatorcontrib>Schmid, Stefan</creatorcontrib><creatorcontrib>Avin, Chen</creatorcontrib><title>Kevin: de Bruijn-based topology with demand-aware links and greedy routing</title><description>We propose Kevin, a novel demand-aware reconfigurable rack-to-rack datacenter
network realized with a simple and efficient control plane. In particular,
Kevin makes effective use of the network capacity by supporting integrated and
multi-hop routing as well as work-conserving scheduling. To this end, Kevin
relies on local greedy routing with small forwarding tables which require local
updates only during topological reconfigurations, making this approach ideal
for dynamic networks. Specifically, Kevin is based on a de Bruijn topology
(using a small number of optical circuit switches) in which static links are
enhanced with opportunistic links.</description><subject>Computer Science - Networking and Internet Architecture</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2022</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotz8tOwzAUBFBvWKDCB7Cqf8Dh-lXH7KDiXYlN99FNbKeG1KmctCV_TymsRqORRjqE3HAoVKk13GL-jodCCBAFaFWaS_L27g8x3VHn6UPex8_Eahy8o2O_67u-negxjpvTusXkGB4xe9rF9DXQU6dt9t5NNPf7Mab2ilwE7AZ__Z8zsn56XC9f2Orj-XV5v2K4MIZJJZ1D7pSrA3AVONjSL2o0kjdgg_KgkGPtggDZAAaudbDCllwohaaxckbmf7dnTLXLcYt5qn5R1RklfwAz9UdW</recordid><startdate>20220211</startdate><enddate>20220211</enddate><creator>Zerwas, Johannes</creator><creator>Györgyi, Csaba</creator><creator>Blenk, Andreas</creator><creator>Schmid, Stefan</creator><creator>Avin, Chen</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20220211</creationdate><title>Kevin: de Bruijn-based topology with demand-aware links and greedy routing</title><author>Zerwas, Johannes ; Györgyi, Csaba ; Blenk, Andreas ; Schmid, Stefan ; Avin, Chen</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a677-343dda1d4dbf014f1098e6ba731c09f4e04a1abdf203c0af155f92981244a7c93</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2022</creationdate><topic>Computer Science - Networking and Internet Architecture</topic><toplevel>online_resources</toplevel><creatorcontrib>Zerwas, Johannes</creatorcontrib><creatorcontrib>Györgyi, Csaba</creatorcontrib><creatorcontrib>Blenk, Andreas</creatorcontrib><creatorcontrib>Schmid, Stefan</creatorcontrib><creatorcontrib>Avin, Chen</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Zerwas, Johannes</au><au>Györgyi, Csaba</au><au>Blenk, Andreas</au><au>Schmid, Stefan</au><au>Avin, Chen</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Kevin: de Bruijn-based topology with demand-aware links and greedy routing</atitle><date>2022-02-11</date><risdate>2022</risdate><abstract>We propose Kevin, a novel demand-aware reconfigurable rack-to-rack datacenter
network realized with a simple and efficient control plane. In particular,
Kevin makes effective use of the network capacity by supporting integrated and
multi-hop routing as well as work-conserving scheduling. To this end, Kevin
relies on local greedy routing with small forwarding tables which require local
updates only during topological reconfigurations, making this approach ideal
for dynamic networks. Specifically, Kevin is based on a de Bruijn topology
(using a small number of optical circuit switches) in which static links are
enhanced with opportunistic links.</abstract><doi>10.48550/arxiv.2202.05487</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | DOI: 10.48550/arxiv.2202.05487 |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_arxiv_primary_2202_05487 |
| source | arXiv.org |
| subjects | Computer Science - Networking and Internet Architecture |
| title | Kevin: de Bruijn-based topology with demand-aware links and greedy routing |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-16T10%3A30%3A55IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Kevin:%20de%20Bruijn-based%20topology%20with%20demand-aware%20links%20and%20greedy%20routing&rft.au=Zerwas,%20Johannes&rft.date=2022-02-11&rft_id=info:doi/10.48550/arxiv.2202.05487&rft_dat=%3Carxiv_GOX%3E2202_05487%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |