An Efficient Shortest-Path Routing Algorithm in the Data Centre Network DPillar

DOI10.1007/978-3-319-26626-8_16zbMath1473.68023arXiv1509.01746OpenAlexW2339512183WikidataQ58746802 ScholiaQ58746802MaRDI QIDQ3467847

Alejandro Erickson, Iain A. Stewart, A. E. Kiasari, Javier Navaridas

Publication date: 5 February 2016

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1509.01746

zbMATH Keywords

shortest pathsrouting algorithmsdata centre networks

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms (68W40) Network design and communication in computer systems (68M10)

Uses Software

• DPillar

Cites Work

• On Data Center Network Architectures for Interconnecting Dual-Port Servers
• Expandable and Cost-Effective Network Structures for Data Centers Using Dual-Port Servers

This page was built for publication: An Efficient Shortest-Path Routing Algorithm in the Data Centre Network DPillar