scispace - formally typeset
Journal ArticleDOI

Dynamic Scheduling for Wireless Data Center Networks

TLDR
This work aims to solve the congestion problem caused by a few hot nodes to improve the global performance and designs an approximation algorithm with an approximation bound of 1/2 and a genetic algorithm to address the scheduling problem.
Abstract
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.

read more

Citations
More filters
Journal ArticleDOI

Enabling technologies for future data center networking: a primer

TL;DR: This article presents a survey on enabling DCN technologies for future cloud infrastructures through which the huge amount of resources in data centers can be efficiently managed.
Journal ArticleDOI

Wireless Communication in Data Centers: A Survey

TL;DR: A generic classification scheme is presented that can be used to classify current and future DCNs based on the communication technology used in the network and the two key candidate technologies for implementing wireless links in DCNs are analyzed.
Proceedings Article

Diamond: nesting the data center network with wireless rings in 3D space

TL;DR: In this paper, the authors propose a scalable 3D ring reflection spaces (RRSs) which are interconnected with streamlined wired herringbone to enable large number of concurrent wireless transmissions through high-performance multi-reflection of radio signals over metal.
Proceedings ArticleDOI

A survey of wireless data center networks

TL;DR: A deep investigation about wireless data center networks is conducted, some works that enhance the performance of the network are described, then some remarks and critiques are given.
Proceedings ArticleDOI

Cracking network monitoring in DCNs with SDN

TL;DR: Software defined network (SDN) is used to make the severely low determined network tomography (TM estimation) problem in DCNs to be a more determined one and many classic network tomographic algorithms in ISP networks become feasible for DCNs.
References
More filters
Journal ArticleDOI

MapReduce: simplified data processing on large clusters

TL;DR: This paper presents the implementation of MapReduce, a programming model and an associated implementation for processing and generating large data sets that runs on a large cluster of commodity machines and is highly scalable.
Journal ArticleDOI

MapReduce: simplified data processing on large clusters

TL;DR: This presentation explains how the underlying runtime system automatically parallelizes the computation across large-scale clusters of machines, handles machine failures, and schedules inter-machine communication to make efficient use of the network and disks.
Journal ArticleDOI

OpenFlow: enabling innovation in campus networks

TL;DR: This whitepaper proposes OpenFlow: a way for researchers to run experimental protocols in the networks they use every day, based on an Ethernet switch, with an internal flow-table, and a standardized interface to add and remove flow entries.
Journal ArticleDOI

A scalable, commodity data center network architecture

TL;DR: This paper shows how to leverage largely commodity Ethernet switches to support the full aggregate bandwidth of clusters consisting of tens of thousands of elements and argues that appropriately architected and interconnected commodity switches may deliver more performance at less cost than available from today's higher-end solutions.
Journal ArticleDOI

Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks

TL;DR: The stability of a queueing network with interdependent servers is considered and a policy is obtained which is optimal in the sense that its Stability Region is a superset of the stability region of every other scheduling policy, and this stability region is characterized.
Related Papers (5)