By Topic

On capacity provisioning in datacenter networks for full bandwidth communication

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Wenda Ni ; Dept. of Systems and Computer Engineering, Carleton University, Ottawa, ON, K1S 5B6, Canada ; Changcheng Huang ; Jing Wu

Recent advances in datacenter network design have enabled full bandwidth communication based on the notion of Valiant load balancing. In this paper, we study from the link capacity viewpoint how such communication paradigm can be supported in the context of link failures, the study of which is currently absent. In particular, we target full bandwidth communication among all the servers, for all valid traffic patterns, and under k arbitrary link failures. We derive the minimum link capacity required on two typical datacenter topologies-VL2 and fat-tree. Our main finding is that given the same server scale, fat-tree requires less total link capacity than VL2 for 1 ≤ k ≤ n/4, where n denotes the port count of homogeneous switches used in fat-tree. For k > n/4, there exists a turning point from which VL2 becomes more capacity-efficient.

Published in:

High Performance Switching and Routing (HPSR), 2013 IEEE 14th International Conference on

Date of Conference:

8-11 July 2013