-
Notifications
You must be signed in to change notification settings - Fork 2
/
twoTierTree.py
79 lines (68 loc) · 2.93 KB
/
twoTierTree.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
# Two-Level Data Center Tree implementation for Mininet--http://mininet.org
# Based On:
# Al-Fares, M. et al. 2008. A Scalable, Commodity Data Center Network Architecture. ACM SIGCOMM Computer Communication Review. 38, (2008), 63.
#
# Samuel Jero <sjero@purdue.edu>
# James Lembke <lembkej@purdue.edu>
# Nathan Burow <nburow@purdue.edu>
#
# Copyright (c) 2014
# All rights reserved.
#
# Redistribution and use in source and binary forms, with or without modification,
# are permitted provided that the following conditions are met:
#
# 1. Redistributions of source code must retain the above copyright notice,
# this list of conditions and the following disclaimer.
#
# 2. Redistributions in binary form must reproduce the above copyright notice,
# this list of conditions and the following disclaimer in the documentation
# and/or other materials provided with the distribution.
#
# 3. Neither the name of the copyright holder nor the names of its contributors
# may be used to endorse or promote products derived from this software without
# specific prior written permission.
#
# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
# ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
# WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
# IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,
# INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
# BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
# DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
# OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
# OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
# ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
import sys, random, re
from mininet.topo import Topo
class TwoTierTree(Topo):
def randByte(self):
return hex(random.randint(0, 255))[2:]
def makeMAC(self, i):
return self.randByte() + ":" + self.randByte() + ":" + self.randByte() + ":00:00:" + hex (i)[2:]
def makeDPID(self, i):
a = self.makeMAC(i)
dp = "".join(re.findall(r'[a-f0-9]+', a))
return "0" * (12 - len(dp)) + dp
def __init__(self, hpr = 20, racks = 2, **opts):
Topo.__init__(self, **opts)
if (racks % 2 != 0):
print "Warning number of racks must be even!"
tor = []
numLeaf = hpr * racks
s = 1
#ToR switches
for i in range(racks):
sw = self.addSwitch('s' + str (s), dpid = self.makeDPID(s), **dict(listenPort = (13000 + s - 1)))
s = s + 1
tor.append(sw)
#End Hosts
for i in range(numLeaf):
h = self.addHost('h' + str(i + 1), mac = self.makeMAC(i), ip = "10.0.0." + str (i + 1))
sw = tor[i / hpr]
self.addLink(h, sw)
#Core
csw = self.addSwitch('s' + str(s), dpid = self.makeDPID(s), **dict(listenPort = (13000 + s - 1)))
s = s + 1
for i in range(0, len(tor)):
self.addLink(tor[i], csw)