Geodesic
Routing Optimization for Server-Centric Data Center Networks
Computer Science and Information Systems, Tome 13 (2016) no. 2.

Voir la notice de l'article provenant de la source Computer Science and Information Systems website

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%.
Keywords: server-centric, data center, routing optimization 
@article{CSIS_2016_13_2_a16,
     author = {Huanzhao Wang and Kun Qian and ChengChen Hu and Che Zhang and Yadong Zhou},
     title = {Routing {Optimization} for {Server-Centric} {Data} {Center} {Networks}},
     journal = {Computer Science and Information Systems},
     publisher = {mathdoc},
     volume = {13},
     number = {2},
     year = {2016},
     url = {http://geodesic.mathdoc.fr/item/CSIS_2016_13_2_a16/}
}
TY  - JOUR
AU  - Huanzhao Wang
AU  - Kun Qian
AU  - ChengChen Hu
AU  - Che Zhang
AU  - Yadong Zhou
TI  - Routing Optimization for Server-Centric Data Center Networks
JO  - Computer Science and Information Systems
PY  - 2016
VL  - 13
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/CSIS_2016_13_2_a16/
ID  - CSIS_2016_13_2_a16
ER  - 
%0 Journal Article
%A Huanzhao Wang
%A Kun Qian
%A ChengChen Hu
%A Che Zhang
%A Yadong Zhou
%T Routing Optimization for Server-Centric Data Center Networks
%J Computer Science and Information Systems
%D 2016
%V 13
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/CSIS_2016_13_2_a16/
%F CSIS_2016_13_2_a16
Huanzhao Wang; Kun Qian; ChengChen Hu; Che Zhang; Yadong Zhou. Routing Optimization for Server-Centric Data Center Networks. Computer Science and Information Systems, Tome 13 (2016) no. 2. http://geodesic.mathdoc.fr/item/CSIS_2016_13_2_a16/