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.005zbMath1436.68233OpenAlexW2969989027MaRDI QIDQ2009644

Javier Navaridas, Iain A. Stewart, Alejandro Erickson

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

zbMATH Keywords

isoperimetric problemsbisection width\(S\)-bisection widthdatacenter networksserver-centric datacenter networksstellar datacenter networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40)

Uses Software

• DPillar

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A framework for solving VLSI graph layout problems
• On the Mathematics of Data Centre Network Topologies
• Generalized Hypercube and Hyperbus Structures for a Computer Network
• Assignment of Numbers to Vertices
• Expandable and Cost-Effective Network Structures for Data Centers Using Dual-Port Servers
• Optimal Assignments of Numbers to Vertices

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