Beruflich Dokumente
Kultur Dokumente
TeachCloud
DartCSim+
CloudSim
CloudSim
CloudSim
EMUSIM
CDOSim
Network
Analyst
Cloud
MR-
CloudSim,
Platform SimJava CloudSim CloudSim
AEF
Language Java
Availability Open Source - Open source
Graphical User Interface
Application Model
Parameters
Communication Model Limited Full Limited Limited Limited Limited Limited Full
Energy Model
VM Support
SLA Support
Cost Model
Network Topology
Model
Addressing Schemes
Congestion Control
Traffic patterns
iCanCloud
GroudSim
MDCSim
DCSim
SPECI
SimIC
OMNET,
Java
Platform NS-2 CSim MPI - - SimJava
DES
(SIMCAN)
C++,
Language Java, C++ C++ Java Java Java Java
OTcl
Open Open Open Open Open
Availability Commercial -
Source Source Source Source source
Graphical User
Limited Limited
Interface
Parameters
Application Model
Communication
Full Limited Full Limited
Model
Rough Rough
Energy Model
Estimation Estimation
VM Support
SLA Support
Cost Model
Network Topology
Limited
Model
Addressing Schemes
Congestion Control
Traffic patterns
found that about 40% of links remained idle but were [35], and Hedera [24] are multipath flow forwarding
constantly changing, making it hard to utilize the unused schemes. DCTCP [34] was presented to address tail latency.
links. Hence the bursty and unpredictable nature of data It shortened tail latency somehow but it was not deadline
center traffic makes the present traffic engineering schemes aware. D3 [33] is first deadline aware flow scheduler which
less appropriate. was presented to root out limitations present in DCTCP. D 3
The authors in [29] studied the efficiency of different shortened the tail latency and was also deadline aware. D3 is
traditional traffic engineering techniques (normally ECMP centralized scheme which uses a proactive approach. For
based) and experienced that these schemes are insufficient bandwidth allocation it uses first come first serve approach.
for data center network and provided three different reasons: It does not consider deadline parameter when allocating the
(1) absence of multipath routing, (2) absence of load bandwidth which is a big problem. Another practical
understanding and (3) absence of an overall view traffic shortcoming with D3 is that it cannot coexist with TCP. To
engineering decision making. They have studied the data eliminate the shortcomings of D3 another scheme D2TCP
center’s traffic patterns very closely and observed that there was proposed. D2TCP [32] is a deadline aware scheme
is short term predictability in data centers with duration which handle the fan-in bursts. It is a decentralized scheme
which only last for few seconds. They have also suggested which uses reactive approach in which sender react to the
requirements for a good traffic engineering technique such congestion. It back-off those flows which have far deadline
as utilization of path diversities, coordination in traffic and allocate bandwidth to those flows which have near-
scheduling and adaptation of short term predictability and at deadline. It requires no information about other flows. It is
the end they have presented their own frame work MicroTE. also compatible with legacy TCP.
This leads to the conclusion that having traffic patterns in CONGA [35] is a distributed multipath flow forwarding
simulators is of vital importance in order to study DCN scheme which splits TCP flow into small flowlets and
behavior. estimate real-time congestion on paths. CONGA uses a two
Simulators discussed in section II failed to offer this party (leaf to leaf) mechanism to convey path wise
feature. Our current work on cloud simulator Nutshell aims congestion metrics between pairs of top of the rack switches
to overcome this shortcoming of existing simulators. Based in DC. CONGA uses global congestion information. The
on the knowledge of datacenter traffic, we aim to provide remote switches provide feedback and on the basis of which
application models that depicts the traffic patterns of a real paths are assigned to the flowlets. This enables CONGA to
datacenter. The application models for datacenter traffic efficiently balance the load without requiring any TCP
patterns, will result an accurate cloud simulation, providing modifications. CONGA achieves two to eight times better
a realistic view of datacenter and accurate calculation of throughput than MPTCP [35]. Hedera [24] is a dynamic
delay, bandwidth, energy, performance and cost. flow scheduling technique for multipath topologies of DCN.
Hedera exploits the path diversity in DCNs topologies to
IV. DATACENTER NETWORK CONGESTION CONTROL enable near optimal bisection bandwidth for a range of
Datacenter network require proper consideration, since it traffic patterns. Hedera target long lived flows. The
is the backbone of cloud platform. Datacenter network is operation of Hedera includes three steps. First it detect long
confronted with different challenges [28], [30], among flows at edge switches. 2nd it estimates natural bandwidth
which flow transmission and congestion control is a big demand of elephant flows and uses placement algorithm to
issue. Increase in intra-datacenter communication is compute path for the flow. Simulated annealing placement
expected [31]. The flows in DCNs can be classified into algorithm is used for placing the elephant flow and finally
short and long flow based on size, their simultaneous these paths are installed on switches.
existence may lead to congestion resulting in performance Absence of such schemes for congestion control in
degradation. current simulators, motivates our current work on Nutshell,
Working in a cloud environment, the service providers to provide congestion control in simulation of cloud
and developers need to anticipate the change in network environment. This feature will facilitate researchers and
traffic patterns and adjust swiftly to these changes or at least modelers to experiment with a setup close to real network
find system’s bottlenecks. Hence, congestion control must environment of cloud, allowing implementation of
be considered when working in cloud environment, and congestion based algorithms. Table 3 shows different
must be a part of simulator. Congestion control is not characteristics of MPTCP, Hedera and CONGA, such as,
implemented in any simulator discussed in section II. balancing network load, targeted flows, and their
Many congestion control schemes for datacenter implementation category. While table 4 shows different
network are presented to root out the congestion problem. properties of DCTCP, D2TCP and D3, such as, deadline,
Among these schemes some are deadline aware schemes flow priority, handling network traffic burst, and their
like D2TCP [32] and D3 [33], and some are deadline compatibility with legacy TCP.
unaware like DCTCP [34] which is TCP based. CONGA
Table 3 Comparison of MPTCP, Hedera, and CONGA
Scheme Control Plane Method for network Load Targeted Traffic flow Implementation
Balancing
MPTCP Distributed Several addresses from the same All kind of flows Modified TCP/IP stack
source and destination+ ECMP
Hedera Centralized Hash-based dispatching+ routing of Elephant flows Openflows
flow based on link utilization
CONGA Distributed Flowlet routing All kind of flows Custom switching ASICs
[12] S. Mostinckx, T. Van Cutsem, S. Timbermont, E. G. Boix, É. [26] T. Benson, a Anand, a Akella, and M. Zhang, “The case for
Tanter, and W. De Meuter, “EMUSIM: an integrated emulation fine-grained traffic engineering in data-centers,” Proc.
and simulation environment for modeling, evaluation, and INM/WREN’10, 2010.
validation of performance of Cloud computing applications,”
[27] H. Wang, H. Xie, L. Qiu, and Y. Yang, “COPE: traffic
engineering in dynamic networks,” Acm Sigcomm …, pp. 99–
110, 2006.