KnapPath: The Algorithm of Centralized Flow Management for Data Centers.
Andrei Tuchin 1451210
We consider a core algorithm for the centralized management of data-center flows. We focus on the arbiter, a centralized controller for scheduling data flows in a data center. We propose a table-driven mechanism for resource reservation, in which states of all the links in a data-center network are registered in a table, and its information is updated at new flow-request arriving points. We evaluate the performance of the proposed algorithm by computer simulation, investigating the bit rate of overall transferred data, the flow-allocation rate, and the link utilization, under different flow-size distributions. Numerical results show that the algorithm can achieve high link utilization 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.