Home // ICNS 2013, The Ninth International Conference on Networking and Services // View article

Evaluation of Data Center Network Structures Considering Routing Methods

Authors:
Yuta Shimotsuma
Yuya Tarutani
Yuichi Ohsita
Masayuki Murata

Keywords: data center; network structure; routing method

Abstract:
In a data center, servers communicate with each other to handle a large amount of data, and the network within the data center should provide sufficient bandwidth. In addition, the traffic pattern in a data center changes in a short interval, and the data center network should accommodate such frequently changing traffic. Since it is hard to obtain traffic information of the whole network in a short interval, the routing methods using local traffic information are suitable for a large data center network. Though there are many researches to construct data center networks, none of them discuss the characteristics of the data center network structures that can provide sufficient bandwidth considering the routing methods. In this paper, we evaluate the network structures constructed by setting various parameters of the Generalized Flattened Butterfly (GFB), FatTree and Torus considering the routing methods. The results show that the network constructed in a hierarchical manner and having multiple links from a node in each layer can provide sufficient bandwidth between all servers.

Pages: 146 to 152

Copyright: Copyright (c) IARIA, 2013

Publication date: March 24, 2013

Published in: conference

ISSN: 2308-4006

ISBN: 978-1-61208-256-1

Location: Lisbon, Portugal

Dates: from March 24, 2013 to March 29, 2013