WMGR: A Generic and Compact Routing Scheme for Data Center Networks

Data center networks (DCNs) connect hundreds and thousands of computers and, as a result of the exponential growth in their number of nodes, the design of scalable (compact) routing schemes plays a pivotal role in the optimal operation of the DCN. Traditional trends in the design of DCN architecture...

Full description

Bibliographic Details
Authors: Aguirre Guerrero, Daniela, Camelo Botero, Miguel Hernando, Fàbrega i Soler, Lluís, Vilà Talleda, Pere
Format: article
Status:Published version
Publication Date:2018
Country:España
Institution:Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya)
Repository:Recercat. Dipósit de la Recerca de Catalunya
OAI Identifier:oai:recercat.cat:10256/15014
Online Access:http://hdl.handle.net/10256/15014
Access Level:Open access
Keyword:Ordinadors, Xarxes d'
Computer networks
Encaminadors (Xarxes d'ordinadors)
Routers (Computer networks)
id ES_868aa7b930cb48c257533b02bea71ab3
oai_identifier_str oai:recercat.cat:10256/15014
network_acronym_str ES
network_name_str España
repository_id_str
spelling WMGR: A Generic and Compact Routing Scheme for Data Center NetworksAguirre Guerrero, DanielaCamelo Botero, Miguel HernandoFàbrega i Soler, LluísVilà Talleda, PereOrdinadors, Xarxes d'Computer networksEncaminadors (Xarxes d'ordinadors)Routers (Computer networks)Data center networks (DCNs) connect hundreds and thousands of computers and, as a result of the exponential growth in their number of nodes, the design of scalable (compact) routing schemes plays a pivotal role in the optimal operation of the DCN. Traditional trends in the design of DCN architectures have led to solutions, where routing schemes and network topologies are interdependent, i.e., specialized routing schemes. Unlike these, we propose a routing scheme that is compact and generic, i.e., independent of the DCN topology, the word-metric-based greedy routing. In this scheme, each node is assigned to a coordinate (or label) in the word-metric space (WMS) of an algebraic group and then nodes forward packets to the closest neighbor to the destination in this WMS. We evaluate our scheme and compare it with other routing schemes in several topologies. We prove that the memory space requirements in nodes and the forwarding decision time grow sub-linearly (with respect to n, the number of nodes) in all of these topologies. The scheme finds the shortest paths in topologies based on Cayley graphs and trees (e.g. Fat tree), while in the rest of topologies, the length of any path is stretched by a factor that grows logarithmically (with respect to n). Moreover, the simulation results show that many of the paths remain far below this upper boundThis work was supported in part by the Mexican Government under Grant CONACYT-SENER 2015-409697, in part by the Spanish Government under Grant TEC 2015-66412-R and Grant TEC 2015-71932-REDT, in part by the Catalan Government under Grant SGR-1469, and in part by the Flanders Government through the SMILE-IT Project—VLAIOMinisterio de Economía y Competitividad (Espanya)2018info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionpeer-reviewedapplication/pdfhttp://hdl.handle.net/10256/15014http://hdl.handle.net/10256/15014IEEE-ACM Transactions on Networking, 2017, vol.26, núm. 1, p. 356-369Articles publicats (D-ATC)Aguirre-Guerrero, Daniela Camelo, Miguel Fàbrega i Soler, Lluís Vilà Talleda, Pere 2017 WMGR: A Generic and Compact Routing Scheme for Data Center Networks IEEE-ACM Transactions on Networking PP 99reponame:Recercat. Dipósit de la Recerca de Catalunyainstname:Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya)Inglésinfo:eu-repo/semantics/altIdentifier/doi/10.1109/TNET.2017.2779866info:eu-repo/semantics/altIdentifier/issn/1063-6692info:eu-repo/grantAgreement/MINECO//TEC2015-66412-RReconeixement 3.0 Internacionalhttp://creativecommons.org/licenses/by/3.0info:eu-repo/semantics/openAccessoai:recercat.cat:10256/150142026-05-29T05:05:01Z
dc.title.none.fl_str_mv WMGR: A Generic and Compact Routing Scheme for Data Center Networks
title WMGR: A Generic and Compact Routing Scheme for Data Center Networks
spellingShingle WMGR: A Generic and Compact Routing Scheme for Data Center Networks
Aguirre Guerrero, Daniela
Ordinadors, Xarxes d'
Computer networks
Encaminadors (Xarxes d'ordinadors)
Routers (Computer networks)
title_short WMGR: A Generic and Compact Routing Scheme for Data Center Networks
title_full WMGR: A Generic and Compact Routing Scheme for Data Center Networks
title_fullStr WMGR: A Generic and Compact Routing Scheme for Data Center Networks
title_full_unstemmed WMGR: A Generic and Compact Routing Scheme for Data Center Networks
title_sort WMGR: A Generic and Compact Routing Scheme for Data Center Networks
dc.creator.none.fl_str_mv Aguirre Guerrero, Daniela
Camelo Botero, Miguel Hernando
Fàbrega i Soler, Lluís
Vilà Talleda, Pere
author Aguirre Guerrero, Daniela
author_facet Aguirre Guerrero, Daniela
Camelo Botero, Miguel Hernando
Fàbrega i Soler, Lluís
Vilà Talleda, Pere
author_role author
author2 Camelo Botero, Miguel Hernando
Fàbrega i Soler, Lluís
Vilà Talleda, Pere
author2_role author
author
author
dc.contributor.none.fl_str_mv Ministerio de Economía y Competitividad (Espanya)
dc.subject.none.fl_str_mv Ordinadors, Xarxes d'
Computer networks
Encaminadors (Xarxes d'ordinadors)
Routers (Computer networks)
topic Ordinadors, Xarxes d'
Computer networks
Encaminadors (Xarxes d'ordinadors)
Routers (Computer networks)
description Data center networks (DCNs) connect hundreds and thousands of computers and, as a result of the exponential growth in their number of nodes, the design of scalable (compact) routing schemes plays a pivotal role in the optimal operation of the DCN. Traditional trends in the design of DCN architectures have led to solutions, where routing schemes and network topologies are interdependent, i.e., specialized routing schemes. Unlike these, we propose a routing scheme that is compact and generic, i.e., independent of the DCN topology, the word-metric-based greedy routing. In this scheme, each node is assigned to a coordinate (or label) in the word-metric space (WMS) of an algebraic group and then nodes forward packets to the closest neighbor to the destination in this WMS. We evaluate our scheme and compare it with other routing schemes in several topologies. We prove that the memory space requirements in nodes and the forwarding decision time grow sub-linearly (with respect to n, the number of nodes) in all of these topologies. The scheme finds the shortest paths in topologies based on Cayley graphs and trees (e.g. Fat tree), while in the rest of topologies, the length of any path is stretched by a factor that grows logarithmically (with respect to n). Moreover, the simulation results show that many of the paths remain far below this upper bound
publishDate 2018
dc.date.none.fl_str_mv 2018
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
peer-reviewed
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv http://hdl.handle.net/10256/15014
http://hdl.handle.net/10256/15014
url http://hdl.handle.net/10256/15014
dc.language.none.fl_str_mv Inglés
language_invalid_str_mv Inglés
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/doi/10.1109/TNET.2017.2779866
info:eu-repo/semantics/altIdentifier/issn/1063-6692
info:eu-repo/grantAgreement/MINECO//TEC2015-66412-R
dc.rights.none.fl_str_mv Reconeixement 3.0 Internacional
http://creativecommons.org/licenses/by/3.0
info:eu-repo/semantics/openAccess
rights_invalid_str_mv Reconeixement 3.0 Internacional
http://creativecommons.org/licenses/by/3.0
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv IEEE-ACM Transactions on Networking, 2017, vol.26, núm. 1, p. 356-369
Articles publicats (D-ATC)
Aguirre-Guerrero, Daniela Camelo, Miguel Fàbrega i Soler, Lluís Vilà Talleda, Pere 2017 WMGR: A Generic and Compact Routing Scheme for Data Center Networks IEEE-ACM Transactions on Networking PP 99
reponame:Recercat. Dipósit de la Recerca de Catalunya
instname:Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya)
instname_str Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya)
reponame_str Recercat. Dipósit de la Recerca de Catalunya
collection Recercat. Dipósit de la Recerca de Catalunya
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869412381359079424
score 15,811543

Similar Items