Xpander

Valadarsky, Asaf; Dinitz, Michael; Schapira, Michael

doi:10.1145/2834050.2834059

Cited by 21 publications

(4 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…(This approach does not have an aggregation layer, and thus larger α can be used without incurring higher cost.) 4) Expander graph DCN [65], [66]: We use a static uniform mesh topology to simulate a performance upper bound for the expander graph. A uniform mesh topology is an expander with the optimal edge expansion.…”

Section: A Trod Vs Traffic-aware and Traffic-agnostic Dcnsmentioning

confidence: 99%

Threshold-Based Routing-Topology Co-Design for Optical Data Center

Cao

Zhao

Dai

et al. 2023

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

Despite the bandwidth scaling limit of electrical switching and the high cost of building Clos data center networks (DCNs), the adoption of optical DCNs is still limited. There are two reasons. First, existing optical DCN designs usually face high deployment complexity. Second, these designs are not full-optical and the performance benefit over the non-blocking Clos DCN is not clear. After exploring the design tradeoffs of the existing optical DCN designs, we propose TROD (Threshold Routing based Optical Datacenter), a low-complexity optical DCN with superior performance than other optical DCNs. There are two novel designs in TROD that contribute to its success. First, TROD performs robust topology optimization based on the recurring traffic patterns and thus does not need to react to every traffic change, which lowers deployment and management complexity. Second, TROD introduces tVLB (threshold-based Valiant Load Balance), which can avoid network congestion as much as possible even under unexpected traffic bursts. We conduct simulation based on both Facebook's real DCN traces and our synthesized highly bursty DCN traces. TROD reduces flow completion time (FCT) by about 1.15-2.16× compared to Google's Jupiter DCN, at least 2× compared to other optical DCN designs, and about 2.4-3.2× compared to expander graph DCN. Compared with the non-blocking Clos, TROD reduces the hop count of the majority packets by one, and could even outperform the non-blocking Clos with proper bandwidth over-provision at the optical layer. Note that TROD can be built with commercially available hardware and does not require host modifications.

show abstract

Section: A Trod Vs Traffic-aware and Traffic-agnostic Dcnsmentioning

confidence: 99%

Threshold-Based Routing-Topology Co-Design for Optical Data Center

Cao

Zhao

Dai

et al. 2023

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

show abstract

“…The latter focuses on limiting the blast radius of failures in datacenters by carefully striping a Clos; it is complementary to our work that seeks to improve failure resilience by adapting trunk wiring and routing to provide non-blocking behavior in the presence of failures. We do not know of WAN routers that incorporate other topology designs 2 proposed for datacenters, such as FatClique [39], random graphs: Jellyfish [37], Xpander [38], and server-centric designs: BCube [17], DCell [18], so our work focuses on Clos-based WAN routers.…”

Section: Related Workmentioning

confidence: 99%

Towards highly available clos-based WAN routers

Supittayapornpong

Raghavan

Govindan

2019

Proceedings of the ACM Special Interest Group on Data Communication

View full text Add to dashboard Cite

The performance and availability of cloud and content providers often depends on the wide area networks (WANs) they use to interconnect their datacenters. WAN routers, which connect to each other using trunks (bundles of links), are sometimes built using an internal Clos topology connecting merchant-silicon switches. As such, these routers are susceptible to internal link and switch failures, resulting in reduced capacity and low availability. Based on the observation that today's WAN routers use relatively simple trunk wiring and routing techniques, we explore the design of novel wiring and more sophisticated routing techniques to increase failure resilience. Specifically, we describe techniques to 1) optimize trunk wiring to increase effective internal router capacity so as to be resilient to internal failures, 2) compute the effective capacity under different failure patterns, and 3) use these to compute compact routing tables under different failure patterns, since switches have limited routing table sizes. Our evaluations show that our approach can mask failures of up to 75% of switches in some cases without exceeding routing table limits, whereas competing techniques can sometimes lose half of a WAN router's capacity with a single failure.

show abstract

“…The K-Shortest Path Routing Scheme [11] for Jellyfish [12], Xpander [13] and Slim fly [14] Topologies These topologies are based on graphs related to the degreediameter problem, i.e. finding the largest regular graph for a given degree and diameter [18].…”

Section: Routing Schemes Based On Permutation-sort For Cayley Graph (Cg)mentioning

confidence: 99%

“…However, they are not compact. This is the case of the traditional routing scheme K-shortest path [11] that has been proposed to work on Jellyfish [12], Xpander [13] and Slim fly [14] topologies. This scheme can not be considered compact because of its high memory space requirements.…”

mentioning

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

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

Xpander

Cited by 21 publications

References 20 publications

Threshold-Based Routing-Topology Co-Design for Optical Data Center

Threshold-Based Routing-Topology Co-Design for Optical Data Center

Towards highly available clos-based WAN routers

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

Contact Info

Product

Resources

About