A Simple Algorithm of Centralized Flow Management for Data Centers

Andrei E. Tuchin Masahiro Sasabe Shoji Kasahara

In Proc. of Asia-Pacific Conference on Communications (APCC), 2016

Abstract

In this paper, we consider a data-flow management mechanism for data center networks, in which a centralized controller called arbiter manages data flows. We propose a simple algorithm for the arbiter to distribute flows over different time points and paths, in a preemptive scheduling and traffic load-balancing manner. The proposed algorithm is based on table-driven resource reservation, in which states of all the links in a data-center network are registered in a single table, and its information is updated whenever a new flow-request arrives at the arbiter. We evaluate the performance of the proposed algorithm through simulation experiments, investigating bit allocation rate and flow allocation rate, under different flow-size distributions. Numerical results show that the proposed algorithm can achieve high bit allocation rate without collisions. It is also shown that the proposed algorithm can allocate many flows within a small time interval even when the variance of flow-size is large.

Downloads

Text Reference

Andrei E. Tuchin, Masahiro Sasabe, Shoji Kasahara, A Simple Algorithm of Centralized Flow Management for Data Centers, Proc. of Asia-Pacific Conference on Communications (APCC), pp.268-273, August 2016.

BibTex Reference

@inproceedings{tuchin16SimpleAlgorithmCentralized,
    author = "Tuchin, Andrei E. and Sasabe, Masahiro and Kasahara, Shoji",
    title = "A {{Simple Algorithm}} of {{Centralized Flow Management}} for {{Data Centers}}",
    booktitle = "Proc. of {{Asia-Pacific Conference}} on {{Communications}} ({{APCC}})",
    year = "2016",
    month = "August",
    pages = "268--273",
    doi = "10.1109/APCC.2016.7581436"
}