Empirical Studies of Load Generation for Data Center Networks
Abstract
Data center networks form the backbone for modern Internet giants like Google, Facebook, Microsoft, and Amazon. Such networks consist of a layer of a large number of storage and compute servers connected through two or three layers of switches. Depending on the target application, data center networks can be designed to have the desired properties. In many cases, the service providers have to meet service level agreements for target applications. These
agreements include the provision for redundant paths, the acceptable level of encryption, and the acceptable latency. The design choice available at the onset is architecture selection. Once the architecture is fixed, the general design choices include path selection, admission control, and encryption levels.
The performance of a data center network depends critically on the traffic profile in the network. Unfortunately, most traffic data is proprietary and seldom available to academic researchers. The industry benchmark performance tests are performed for periodic and burst packet traffic transmission. These are not representative of real traffic in the data center networks. In this work, we focus on the problem of representative load generation for the
empirical studies of data center networks through emulation and simulation.
The main characteristic of traffic is the inter-arrival time of flows for each source destination pair, their corresponding lifetimes, and their bandwidths. In this thesis, we study the type of traffic required and how to generate realistic traffic that is rich enough to test the data center networks. We propose an open source simulation framework to understand the type of traffic required and an open source realistic traffic generator which plays real life traffic traces, which
would help us understand the response of the data center networks in production. The traffic generator contains a library of traffic patterns that can be used for the load testing by varying lifetime, packet types, data rate and a few other traits obtained from traffic archive groups like MAWI, NLANR, WIDE, etc.
Collections
Related items
Showing items related by title, author, creator and subject.
-
Wireless Sensor Networks : Bit Transport Maximization and Delay Efficient Function Computation
Shukla, Samta (2018-04-02)We consider a wireless sensor network, in which end users are interested in maximizing the useful information supplied by the network till network partition due to inevitable node deaths. Neither throughput maximization ... -
On Network Coding and Network-Error Correction
Prasad, Krishnan (2018-04-24)The paradigm of network coding was introduced as a means to conserve bandwidth (or equivalently increase throughput) in information flow networks. Network coding makes use of the fact that unlike physical commodities, ... -
Topics In Modeling, Analysis And Optimisation Of Wireless Networks
Ramaiyan, Venkatesh (2010-11-02)The work in this thesis is concerned with two complementary aspects of wireless networks research; performance analysis and resource optimization. The first part of the thesis focusses on the performance analysis of IEEE ...