WMGR: A Generic and Compact Routing Scheme for Data Center Networks
| Autor: | Daniela Aguirre-Guerrero, Lluís Fàbrega, Pere Vilà, Miguel Camelo |
|---|---|
| Přispěvatelé: | Ministerio de Economía y Competitividad (Espanya) |
| Jazyk: | angličtina |
| Rok vydání: | 2020 |
| Předmět: |
Routing protocol
Encaminadors (Xarxes d'ordinadors) Computer Networks and Communications Computer science 0102 computer and information sciences 02 engineering and technology Network topology Topology 01 natural sciences 0202 electrical engineering electronic engineering information engineering Electrical and Electronic Engineering Computer networks Computer. Automation Network packet Node (networking) 020206 networking & telecommunications Routers (Computer networks) Computer Science Applications 010201 computation theory & mathematics Path (graph theory) Scalability Mass communications Routing (electronic design automation) Fat tree Engineering sciences. Technology Software Ordinadors Xarxes d' |
| Zdroj: | 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 IEEE/ACM transactions on networking Recercat. Dipósit de la Recerca de Catalunya instname IEEE-ACM Transactions on Networking, 2017, vol.26, núm. 1, p. 356-369 Articles publicats (D-ATC) DUGiDocs – Universitat de Girona |
| ISSN: | 1063-6692 |
| Popis: | 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 This 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—VLAIO |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|