Efficient Routing in Data Center with Underlying Cayley Graph

Camelo, Miguel; Papadimitriou, Dimitri; Fàbrega, Lluís; Vilà, Pere

doi:10.1007/978-3-319-05401-8_18

Cited by 10 publications

(11 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The forwarding process in topologies embedded into the WMS of their underlying CG is performed by using Algorithm 3, which improves the temporal complexity with respect to Algorithm 2 and the forwarding technique proposed in [15] and [34]. Let u and v be node labels of a source and a destination nodes.…”

Section: Greedy Forwarding Algorithmsmentioning

confidence: 99%

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

Aguirre-Guerrero

Camelo

Fàbrega

et al. 2018

IEEE/ACM Trans. Networking

Self Cite

View full text Add to dashboard Cite

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.

show abstract

Section: Greedy Forwarding Algorithmsmentioning

confidence: 99%

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

Aguirre-Guerrero

Camelo

Fàbrega

et al. 2018

IEEE/ACM Trans. Networking

Self Cite

View full text Add to dashboard Cite

show abstract

“…On the right of Figure 5.3 is the transversally Markov slider graph − → S Σ A 3 obtained by removing the de Bruijn transitions α 1 α 2 α 3 ∼ α 2 α 3 α 4 with α 1 = α 4 = 1. The following class of examples of transversally Markov circular slider graphs is inspired by the lamplighters (see below Section 6) and is based on the notion of the Cayley graph of a group (the use of which is currently becoming popular in the theory of interconnection networks, see [RNT12], [CPFV14]). Let us first remind that the (directed) Cayley graph (≡ Cayley topological Markov chain) − − → Cay(G, K) on a group G determined by a subset K ⊂ G has the vertex set G and the arrows g ∼ gk , g ∈ G, k ∈ K .…”

Section: Missing Links and Transversally Markov Circular Slider Graphsmentioning

confidence: 99%

Circular slider graphs: de Bruijn, Kautz, Rauzy, lamplighters and spiders

Kaimanovich¹

2018

Unimodularity in Randomly Generated Graphs

View full text Add to dashboard Cite

show abstract

“…In [124], Camelo et al present a low space and time complexity routing algorithm for any interconnection network where its underlying graph is a CG of some finite group. The proposed algorithm is based on the fact that finite groups are Automatics and have a Shortlex Automatic Structure (SAS).…”

Section: ) Emulation Of Existing Topologiesmentioning

confidence: 99%

Wireless Communication in Data Centers: A Survey

Hamza

Deogun

Alexander

2016

IEEE Commun. Surv. Tutorials

100

View full text Add to dashboard Cite

Abstract-Data centers (DCs) is becoming increasingly an integral part of the computing infrastructures of most enterprises. Therefore, the concept of DC networks (DCNs) is receiving an increased attention in the network research community. Most DCNs deployed today can be classified as wired DCNs as copper and optical fiber cables are used for intra-and inter-rack connections in the network. Despite recent advances, wired DCNs face two inevitable problems; cabling complexity and hotspots.To address these problems, recent research works suggest the incorporation of wireless communication technology into DCNs. Wireless links can be used to either augment conventional wired DCNs, or to realize a pure wireless DCN. As the design spectrum of DCs broadens, so does the need for a clear classification to differentiate various design options. In this paper, we analyze the free space optical (FSO) communication and the 60 GHz radio frequency (RF), the two key candidate technologies for implementing wireless links in DCNs. We present a generic classification scheme that can be used to classify current and future DCNs based on the communication technology used in the network. The proposed classification is then used to review and summarize major research in this area. We also discuss open questions and future research directions in the area of wireless DCs.Index Terms-Wireless data centers, 60 GHz, free space optical (FSO), optical wireless communication (OWC), data centers, data center network.

show abstract

Efficient Routing in Data Center with Underlying Cayley Graph

Cited by 10 publications

References 17 publications

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

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

Circular slider graphs: de Bruijn, Kautz, Rauzy, lamplighters and spiders

Wireless Communication in Data Centers: A Survey

Contact Info

Product

Resources

About