Online-Batch Joint Routing and Channel Allocation for Hybrid Data Center Networks
Résumé
To cope with the unprecedented traffic explosion, Internet giants are urged to rethink their data center design. Unfortunately, the conventional wired data centers struggle to support the impressive growth of both data and online services. In this regard, we resort to augmenting the wired data center network (DCN) with wireless communication (60 GHz technology). Heretofore, only few research work have dealt with the optimization of multi-hop communications in such hybrid DCN (HDCN) infrastructures. In this paper, we investigate, in HDCN, the issue of jointly: 1) routing and 2) channel allocating, in both online and batch arrival modes. First, we formulate the online joint routing and channel assignment problem as a minimum weighted perfect matching problem. We propose a new strategy named joint routing and channel allocation algorithm that makes use of the Blossom algorithm and sequentially computes the optimal routing communication paths. Second, to handle the batched arrivals of flows, we formulate the batch joint routing and channel assignment problem as an advanced multi-commodity flow model. We propose two scalable approaches: 1) a heuristic based solution, named joint routing and channel assignment heuristic and 2) an approximate solution, named scalable joint batch routing and channel allocation, based on the Lagrangian relaxation technique. Based on extensive network simulations conducted in QualNet simulator while considering the full protocol stack, the obtained results for both: 1) real Facebook's data center and 2) uniform, traces, show that our schemes outperform the related strategies.