arrow
Return

Dynamic Scheduling for Wireless Data Center Networks

delete2013-12-01
delete30
PRE
AI
崔勇 cover
崔勇 (Yong Cui) *
H
Hongyi Wang
成秀珍 (Xiuzhen Cheng)
李丹 cover
李丹 (Dan Li)
A
Antti Ylä-Jääski
DOI:10.1109/TPDS.2013.5delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Unbalanced traffic demands of different data center applications are an important issue in designing data center networks (DCN). In this paper, we present our exploratory investigation on a hybrid DCN solution of utilizing wireless transmissions in DCNs. Our work aims to solve the congestion problem caused by a few hot nodes to improve the global performance. We model the wireless transmissions in DCN by considering both the wireless interference and the adaptive transmission rate. Besides, both throughput and job completion time are considered to measure the impact of wireless transmissions on the global performance. Based on the model, we formulate the problem of channel allocation as an optimization problem. We also design an approximation algorithm with an approximation bound of 1/2 and a genetic algorithm to address the scheduling problem. A series of simulations are performed to evaluate and demonstrate the effectiveness of our wireless DCN scheme.
Keywords:
Data center networks
wireless communication
dynamic scheduling
evolutionary computing
genetic algorithms
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

IEEE Transactions on Parallel and Distributed Systems cover
IEEE Transactions on Parallel and Distributed Systems
IF:
6
Papers:
5.2K
Citations:
1.1W

Organization

A
Aalto University
Scholars:
1.6W
Papers: 1.5W
Citations: 2.1W
T
tsinghua university
Scholars:
11.8W
Papers: 10.0W
Citations: 137
G
George Washington University
Scholars:
1.6W
Papers: 1.4W
Citations: 1.7W
researcher View more organizations