Relating the bisection width of dual-port, server-centric datacenter networks and the solution of edge isoperimetric problems in graphs
DOI10.1016/J.JCSS.2019.08.005zbMATH Open1436.68233OpenAlexW2969989027MaRDI QIDQ2009644FDOQ2009644
Authors: Alejandro Erickson, Javier Navaridas, Iain Stewart 
Publication date: 29 November 2019
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2019.08.005
Recommendations
isoperimetric problemsbisection width\(S\)-bisection widthdatacenter networksserver-centric datacenter networksstellar datacenter networks
Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40) Network design and communication in computer systems (68M10)
Cites Work
- Title not available (Why is that?)
- Generalized Hypercube and Hyperbus Structures for a Computer Network
- Title not available (Why is that?)
- Optimal Assignments of Numbers to Vertices
- A framework for solving VLSI graph layout problems
- Assignment of Numbers to Vertices
- Title not available (Why is that?)
- On the mathematics of data centre network topologies
- Expandable and Cost-Effective Network Structures for Data Centers Using Dual-Port Servers
Cited In (3)
Uses Software
This page was built for publication: Relating the bisection width of dual-port, server-centric datacenter networks and the solution of edge isoperimetric problems in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2009644)
