About the journal

• Home page
• Contact information
• Aims and scope
• Indexing information
• Editorial policies
• ComSIS consortium
• Journal boards
• Managing board

For authors

• Information for contributors
• Paper submission
• Article submission through OJS
• Copyright transfer form
• Download section

For readers

• Forthcoming articles
• Current issue
• Archive

For reviewers

• View and review submissions

News

• Journal's Facebook page
• Calls for special issues
• New issue notification

Routing Optimization for Server-Centric Data Center Networks

Huanzhao Wang^1,2, Kun Qian¹, ChengChen Hu¹, Che Zhang¹ and Yadong Zhou¹

1. Department of Computer Science and Technology, Xian Jiaotong University
   710049 Xian, China
   fhzhwang,chengchenhu,ydzhoug@mail.xjtu.edu.cn,qiankun11516@sina.cn,chezhang.china@gmail.com
2. Science and Technology on Information Transmission and Dissemination in Communication Networks Laboratory
   Shijiazhuang 050081,China
   hzhwang@mail.xjtu.edu.cn

Abstract

Server-centric data center architecture has been proposed to provide high throughput, scalable construction and error tolerance with commodity servers and switches for cloud data centers. To fully utilize those advantages of servercentric data center, an effective routing algorithm to find high quality multiple paths in Server-centric network is needed. However, current routing algorithms cannot achieve this completely: 1) the state-of-art routing algorithms in server-centric data center just consider hop count when selecting paths; 2) traditional multi-constraint QoS routing algorithms only find one feasible path and are usually switch-oriented; 3) present multi-path algorithms cannot guarantee the performance of the founded paths. In this paper, we propose a multi-constrained routing algorithm for servercentric data centers, named Server-Centric Multi-Constrained Routing Algorithm (SCRAT). This algorithm exploits the topology features of the Server-Centric data center to decrease the algorithm complexity and returns optimal and feasible paths simultaneously. In simulations, SCRAT has a very high probability (more than 96%) to find the exact optimal path, and the cost of the optimal path found in SCRAT is about 10% less compared with path found in previous TS MCOP. Compared with previous MPTCP, SCRAT reduces the path delay by 18% less and increase the bandwidth by 20%.

Key words

server-centric, data center, routing optimization

Digital Object Identifier (DOI)

https://doi.org/10.2298/CSIS160228017W

Publication information

Volume 13, Issue 2 (June 2016)
Year of Publication: 2016
ISSN: 2406-1018 (Online)
Publisher: ComSIS Consortium

Full text

Available in PDF
Portable Document Format

How to cite

Wang, H., Qian, K., Hu, C., Zhang, C., Zhou, Y.: Routing Optimization for Server-Centric Data Center Networks. Computer Science and Information Systems, Vol. 13, No. 2, 593–608. (2016), https://doi.org/10.2298/CSIS160228017W