Wireless Facility Scheduling for Data Center Network

CHAPTER 1

INTRODUCTION
The control packets in the Data Center Networks (DCNs) have to contest with the data
packets although they are usually much shorter in size and much more important in network
management. Moreover, the uneven distribution of the packets may create potential hotspots
in the DCN which could degrade network performance drastically. To bridge these gaps, a
few proposals have been put forward to construct extra wireless facilities in the DCNs to help
promote the performance of the control traffic and relieve the burden of the hotspots.
However, little attention has been paid on how to efficiently schedule the wireless facilities.

1.1 Introduction

Data Center is a pool of resources inter connected using a communication network. Data
Center network holds a important role in a Data Center, as it interconnects all the data Center
resources together. In this paper, a scheduling method is put forward which contains two
steps,

1. Route calculation

2. Flow control

In the former step, a route set between each node pair is calculated in advance for later
usage. Then, arrived data and control flows are scheduled according to multiple policies
based on the given route sets in the flow scheduling step.To meet the increasing bandwidth
demand of cloud-based computation paradigms, many novel network structures, such as
FatTree, DCell, BCube , Jellyfish , PortLand, VL2, FastPass , have been presented to replace
or enhance the traditional tree-based data center networks (DCNs), whose aggregation links
are potential bottlenecks of the network and may hinder the applications’ Quality of Service

These novel architectures usually provide multiple paths between any two nodes in
the DCN. However, many of them introduce revolutionary changes to the structure like
random cabling in Jellyfish or multi-ports nodes in BCube . These solutions cannot be
applied to existing DCNs since it is very hard, if not impossible, to redesign or reassign the
DCNs without interrupting existing applications.

Dept. of CSE, MITE, Moodbidri Page1

 Wireless Facility Scheduling for Data Center Network

1.2 About the Seminar topic

The novel architectures usually provide multiple paths between any two nodes in the DCN.
However, many of them introduce revolutionary changes to the structure like random cabling
in Jellyfish [4] or multi-ports nodes in BCube [3]. These solutions cannot be applied to
existing DCNs since it is very hard, if not impossible, to redesign or reassign the DCNs
without interrupting existing applications. Therefore, a few proposals have been put forward
without clean-state design of the structure through introducing 60GHz wireless links or
optical links to the network which can be deployed as required between two racks or nodes
within a certain distance.

These novel DCNs which consist of both wired links as well as wireless/optics ones are
named as hybrid DCNs These augmented links are usually utilized to offer extra bandwidth
to promote the QoS of the DCN. Recent researches have revealed that HDCN can remarkably
reduce the number of cables and switches in the DCN and thus can reduce not only
equipment costs but also server installation and reconfiguration costs.

1.3 Outline of seminar

• CHAPTER 1 introduces the attacks on IoT at different layer.

• CHAPTER 2 lists the Related work.

• CHAPTER 3 explains the system architecture and threat model.

• CHAPTER 4 explains the proposed authentication mechanism.

• CHAPTER 5 describes the implementation details.

• CHAPTER 6 provides the performance analysis.

• CHAPTER 7 is the last phase that includes conclusion.

Dept. of CSE, MITE, Moodbidri Page2

 Wireless Facility Scheduling for Data Center Network

CHAPTER 2
RELATED WORK
To enhance the performance of the traditional DCNs, a few proposals have been
proposed based on introducing wireless links or facilities to the data centers.In reference [9],
a wireless facilities network named ANGORA is presented, which can provide robust paths
decoupled from the wired network, and flexibility to adapt to workloads and network
dynamics. In ANGORA, a wired data plane is in charge of switching data packets while the
wireless facilitates deliver control traffic only.

Halperin et al. have explored using 60GHz wireless technology to relieve hotspots in
oversubscribed data center (DC) networks [10]. By experimenting with prototype equipment,
they have shown that the DC environment is well suited to the deployment of 60 GHz links
contrary to concerns about interference and link reliability. The 60GHz radio is named
wireless flyways which is equipped on every rack. The improvement has been testified by
analyzing production traces of DC traffic for four real applications.

Cui et al. have presented a novel DCN architecture, Diamond, which nests the wired
DCN with radios equipped on all servers [13]. To harvest the gain allowed by the rich
reconfigurable wireless resources, they proposed the low-cost deployment of 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.

Besides, there are a few proposals which introduce optical links and switches in to the
DCNs to construct an optical/electricity switch structure. Aktas et al. have put forward
WiCOD, which relies on a wireless control plane serving an all-optical data plane [11]. In
reference [12], Hamedazimi have presented FireFly, an inter-rack network solution using
free-space optics (FSO) that pushes DC network design to the extreme on three key fronts,
i.e. :

(1) all links are reconfigurable

(2) all links are wireless and

(3) non top-of-rack switches are eliminated altogether.

Dept. of CSE, MITE, Moodbidri Page3

 Wireless Facility Scheduling for Data Center Network

CHAPTER 3
CONCEPTS
3.1 60GHz Wireless Technology

License-free 60GHz radios can achieve multi-gigabit Radio Frequency (RF) links
using the allocated sufficient spectrum. Moreover, the very narrow beam associated with
60GHz radios enables multiple 60GHz radios to be easily and accurately installed by a
non-expert installer on the same roof top or mast, even if they are all operated at the same
transmitting and receiving frequencies.

However, 60GHz signals can be absorbed by the Oxygen. This attribute limits the
coverage of 60GHz links.In the same time, compared with other wireless technologies, it
also includes some interference and security advantages. In a word, these unique
characteristics make 60GHz wireless technology suitable for short-to-medium distance,
high-bandwidth applications. TP-LINK has unveiled the first 802.11ad wireless router
named Talon AD7200 which works at the 60GHz spectrum at Consumer Electronics
Show (CES) 2016. This router can cumulatively transfer data at the rate of 7133Mbps [16].

In the DCNs, 60GHz radios are usually installed on the top of the racks and
connected to the ToR switches. The quantity needed of radio depends on the size of the
rack. For example, today’s standard rack is 4ftx2ft and a 60GHz radio is 1ftx1ft [8], so at
most 8 radios can sit atop each rack. Because 60GHz links are highly directional, each
rack can only communicate with a small, constant number of peers in parallel.

Figure 1.60GHz inter-rack wireless link

Dept. of CSE, MITE, Moodbidri Page4

 Wireless Facility Scheduling for Data Center Network

To efficiently utilize the available space while reducing the interference among the 60GHz
wireless links, three typical 60GHz wireless links (as shown in Figure 1) can be built in the
DC:

1. Direct Wireless Link. Two 60GHz radios deployed at neighbor racks can directly
establish a LOS 60GHz wireless link.

2. Raised Wireless Link. A raised radio can establish a wireless link with another raised
radio with the same height.

3. 3D Beamforming Link. Two radios can build a wireless link through the reflector
(mirror) deployed on the ceiling.

Here, all these three link types are adopted. As long as there is no barrier between two
racks and their distance is less than some particular distance, there could be a potential
wireless link between them. Then, a few wireless links can be built between the racks. All the
wireless links make up a Wireless Flyway Network (WFN) in the DCN.

3.2. Problem Formualtion

Based on the topology of the DCN, we can calculate a set of feasible routes for each
pair of nodes. Note that, these sets can be obtained in advance since the topology is relatively
static in DCN. After obtaining these sets, we can schedule the given set of flows
{f1,f2,…,fn}.Therefore, with a given DCN topology and a number of flows, the following
step is to calculate the route sets and then decide the routes for each flow.

Dept. of CSE, MITE, Moodbidri Page5

 Wireless Facility Scheduling for Data Center Network

CHAPTER 4
METHODOLOGY
In the DCN, the topology is more stable than the Internet. Moreover, multiple paths
exist among each node pair. Therefore, we can calculate the routes among each node pair in
advance for the later use. Then, the scheduler can estimate the load of each link based on
ongoing flows on the routes. Finally, the newly arrived flows will be assigned to the routes
based on the traffic estimation results.

4.1 Routes Calculation

There are a few paths among each node pair in DCN, we need to combine the width
first searching algorithm and Tabu search [18] to determine a few non-interaction routes for
each node pair.

They treated the topology as a graph G(V, E), where V and E are the sets of links and
edges respectively. The problem is to decide the routes between any two nodes i and j. We
start from node i, and apply the width first search until node j is found in the tree or the depth
of the searching tree reaches k, which is the maximum length of a route. A tabu list is kept
during the searching process to cut those tree branches encountered before or interacting with
existing routes. The algorithm of this searching process for a pair of nodes i and j is shown in
Algorithm 1.

Algorithm 1 Route Calculation

Input: Topology graph G(V, E), i, j, route length limit k

Output: a set of routes for (i, j)
1.Tabu list T = {}, Route set S = {}, Node set N = {i}
2.For each node b in set N
3. If the length of the path from i to is b is larger than k
4. break
5. End If
6. For each neighbor a of node b
7. If a is equal to j
8. Add the path from i to a in the tree to S
9. Add the nodes in the path to T except i

Dept. of CSE, MITE, Moodbidri Page6

 Wireless Facility Scheduling for Data Center Network

10. Else If a is already included in T

11. Cut a and the subtree rooted at a from the tree
12. End If
13. Add a to N if a N
14. End For
15. Remove b from N
16. End For
17. Return S

4.2 Traffic Estimation

After determining routes for each node pair, each flow will be assigned to one or a few
routes. Then, the load on each link on the route can be calculated based on the assignment
results. For instance, if a flow fi is assigned to a route ri, each link on the route will increase
by the assigned bandwidth of fi. Based on the start and end times of each flow, the scheduler
can estimate all the links’ traffic load.

4.3 Flow Scheduling

According to various scheduling objectives, we can set different scheduling policies. To

be specific, the following four methods can be adopted here:

1. Wired-only. Only the wired networks are utilized for carrying the data and control flows.

2. Wireless-for-control. The wireless links are utilized for carrying control flows while the data
flows are carried on the wired network.

3. Partial-for-data-with-priority. The wireless links are utilized for carrying control flows
and it can also carry a few offloaded data flows if idle bandwidth is available. Here, if a
data flow is partially offloaded to the WFN, we move 10% of its total packets to the WFN
and remaining 90% packets will still be transmitted through the wired network. Moreover,
the control flow’s priority is higher than the offloaded data flows. The offloaded data
flows will be transferred back to the wired network if the control flows need to use its
occupied wireless capacity.

4.Failure-tolerant. The wireless links are utilized for carrying control flows and it carries
the flows for those ToRs whose links to the aggregation switches are failure.

Dept. of CSE, MITE, Moodbidri Page7

 Wireless Facility Scheduling for Data Center Network

CHAPTER 5
SIMULATION
To evaluate the performance of the WFN construction and its scheduling methods proposed
in this paper, a series of simulation experiments are conducted based on extending the flyway
simulator .

5.1 Experimental Settings

Parameter Settings. adopted the typical DC layout in Figure 2 to conduct the experiments
[10]. The FatTree topology is adopted in the wired network [1]. The bandwidths of the
aggregation wired and wireless links are set to be 3Gbps. The bandwidth from the ToR
switch to the aggregate switch is set to be 40Gbps. 10 groups of flows are generated in the
experiments and each flow group is composed of 3 data flows and 2 control flows. Moreover,
these 5 flows have the same destination host and their source host are randomly selected from
the remaining hosts in the DC. Each data flow’s size is set to be a number randomly selected
between 80 and 100Mbps. In contrast, the size of the control flow is relatively smaller and is
randomly selected between 8 and 10Mbps. The time interval between the flows are set to be

t+d(t) where t is 0.1s and t is a random number selected from 0.02 and 0.12. To evaluate the fault
tolerant scenario, two wire links are randomly removed from the DCN.

5.2 Evaluation metrics

 To evaluate different scenarios’ performance, we adopt the following two metrics for
each flow:Completion time of the flow (CTF): CTF is defined to be t2 - t1, where t2 is
the time when all the packets in the flow are received at the flow’s destination and t1 is
time when the first packet of the flow is generated.

 Average one-way delay: It is defined as the average value of a flow’s all packets’ one-
way delays. A packet’s one-way delay is defined as its receiving time at the destination
minus its sending time at the source.

Dept. of CSE, MITE, Moodbidri Page8

 Wireless Facility Scheduling for Data Center Network

CHAPTER 6
RESULTS
6.1 Evaluation Results

6.1.1 WFN Topology

Note that different number of wireless radios can be installed on each rack. Here, we
assume that no more than 8 radios can be installed on each rack and the wireless links are
randomly established among the racks. If a wireless link is established between two racks i
and j, the following conditions should be fulfilled:

 There is a LOS path between i and j and the length of this path is less than 10 meters.

 There is an indirect (3D beamforming or reflected)path i and j whose length is lower

than 10 meters

Based on this setting, Figure 2 demonstrates the wireless relationship among the racks. Each
rectangle represents a rack. The dots on the racks are the wireless radios and the dotted line
between two radios represents a wireless link.

Figure 2. The deployed wireless links for the DC layout.

6.1.2 WFN Scheduling

CTF. The CTF of the data and the control flows are shown in Figure 3 and Figure 4
respectively. In Figure 3, each data flow is indicated by the number of the data flow plus a

Dept. of CSE, MITE, Moodbidri Page9

 Wireless Facility Scheduling for Data Center Network

character ‘D’. For example, 1D is the 1th data flow. Analogously, 1C is the 1th control flow.
From Figure 3 and Figure 4, we can draw the following observation conclusions:

1) Generally speaking, Wired-only scenario has the worst performance among the four
considered scenarios. This is due to the fact that the latter three scenarios can potentially
provide more bandwidths for the data flows as well as the control flows. Note that sometimes,
Partial-for-data-with-priority cannot ensure a better performance for the offloaded data flows
due to the handover time introduced when the packets are offloaded from the wired network
to the wireless links. Moreover, if the length of two wireless antennas is large, the
transmitting delay of the wireless path is non-neglected for the CTF of a flow.

2) Through efficiently scheduling the wireless links, we can promote the performance of
the control flows. This is very critical to ensure the quality of the time-sensitive control flows.
Moreover, timeless delivery of the control flows is also very helpful for the management of
the network.

Dept. of CSE, MITE, Moodbidri Page10

 Wireless Facility Scheduling for Data Center Network

3) In the Failure-tolerant scenario, we randomly make two wired links fail. Here, the
selected fail links influence the 18th and the 25th data flows since their ToRs’ aggregator
links to the aggregator switches fail. Therefore, the 18th and the 25th data flows’ CTFs will be
infinite in the former four scenarios. Under this condition, Failure-tolerant scenario can
deliver their packets through the WFN. This is true for the 13th control flow since it is
influenced by the fail links too. This is critical for ensuring the continuity of the DC service.

6.2 Average one-way delay

The average one-way delays of the data and control flows are shown in Table I. From Table I, we
can see that separating the control flows can dramatically reduce the average one-way delay of the
data and control flows. For the control flows, this is due to the fact that the wireless links can provide
them with extra bandwidths. The offload of the control flows may reduce the burden on the wired
links and thus promote the performance of the data flows. This can greatly benefit the efficient
network management.

Dept. of CSE, MITE, Moodbidri Page11

 Wireless Facility Scheduling for Data Center Network

CHAPTER 7
CONCLUSION
Recent evidences have shown that it is feasible to introduce wireless links into the
data center networks (DCNs) to relieve the hotspot wired links as well as to promote the
performance of the applications. However, wireless link scheduling has drawn little attention.
In this paper, we have presented a wireless links or facilities scheduling method to efficiently
schedule the wireless resources in the DC. It mainly contains three steps, i.e. routes
calculation, traffic estimation and flow scheduling. Routes calculation is in charge of
computing the routes between each node pair in advance since the topology of the DCN is
stable. Then, the traffic on each link is estimated by a scheduler based on the historical
assignment results. In the last step, the newly arrived flows are assigned to the routes
obtained in the first step based on four different kinds of scheduling policies.

Dept. of CSE, MITE, Moodbidri Page12