Python/ece358_lab2 at master · YangLeoZhao/Python · GitHub

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
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
import pdb
import numpy
import math
import random
import heapq as heap
from collections import deque

#variable declaration
N = 20 			#N: the number of computers connected to the LAN (variable) 20,40,60,80,100
A = 5 			#Data packets arrive at the MAC layer following a Poisson process with an average arrival rate of A packets /second (variable)
W = 1000000.00		#The speed of the LAN (fixed)
L = 1500*8   	#Packet length (fixed)
global P
P = 1 			#Persistence parameter for P-persistent CSMA protocols
timeFactor = 1 #Time scale
simTime =  1.0 #in seconds
packetperSecond = 0
totalNumberOfPacket = 0
collisionCount = 0
kMax = 10
randomBackoffperiod = 0
calculatedProbability = 0
givenProbability = 10
state = 0


packetThroughPut = 0
AggregateCollisionCount = 0
AggregatePacketCount = 0
AggregateErrorCount = 0
AggregateDelayTime = 0

lastPacketTime = 0
currentPacket = 0
lastSender = 0


# Presistency = {}
LANUsers = {}
packetHeap = []
collisionList = []

def poissonDistribution(z):
	packetperSecond = float (numpy.random.poisson(z))
	if (packetperSecond == 0):
		return 0
	else:
		return 1*timeFactor/packetperSecond

class users:
	def __init__(self, userID, lastPacket= 0):
		self.userID = userID
		self.queue = deque ()
		self.lastPacket = lastPacket
		self.backoffCounter = 1
		self.medium = 0

class packet:
	def __init__ (self, packetTime, user, insertTime = 0, deletionTime = 0):
		self.packetTime = packetTime
		self.user = user
		self.insertTime = insertTime
		self.deletionTime = deletionTime

	def __lt__ (self, other):
		#pdb.set_trace ()
		return self.packetTime < other.packetTime

	def __repr__(self):
		return str(self.packetTime) + " " + str(self.user)

#Resolving collisions
def resolveCollision (collisions, counter):
	for x in range (0, counter+1):
		if(LANUsers[collisions[0].user].backoffCounter < kMax):
			LANUsers[collisions[0].user].backoffCounter += 1
			randomBackoffperiod = random.uniform(0, pow(2,LANUsers[collisions[0].user].backoffCounter)-1)*timeFactor*512/W
			delayPacket = packet (collisions[0].packetTime + randomBackoffperiod, LANUsers[collisions[0].user].userID, collisions[0].insertTime)
			#print "Random backoff for "+ str(LANUsers[collisions[0].user].userID) +" "+ str(randomBackoffperiod) + " new packet time " + str(delayPacket.packetTime)
			heap.heappush(packetHeap, delayPacket)
			heap.heapify(packetHeap)
		else:
			#print "User: {0} has failed to send a packet at {1}".format (collisions[0].user, collisions[0].packetTime)
			AggregateErrorCount += 1
		collisions.pop(0)

#N value
for a in range (2,5):
	#A value
	for z in range (1,6):
		#each test run 5 times
		for y in range (0,10):
			#Initializing the users
			for x in range (0, a*10+1):
				LANUsers[x] = users (x)
			#print "User generation done."

			counter = 0
			#Calculating when the packets from upper layers will arrive
			maxPacketPerUser = 0
			condition = len(LANUsers)
			for x in range (0, len(LANUsers)):
				condition = len(LANUsers)
				while LANUsers[x].lastPacket < (simTime * timeFactor):
					timeBuffer = poissonDistribution(z*4)
					if (timeBuffer != 0):
						LANUsers[x].lastPacket += timeBuffer
						if (LANUsers[x].lastPacket < (simTime * timeFactor)):
							insertPacket = packet (LANUsers[x].lastPacket, x, LANUsers[x].lastPacket)
							heap.heappush(packetHeap, insertPacket)
							heap.heapify(packetHeap)
							totalNumberOfPacket +=1
							counter +=1
							#print insertPacket.packetTime, insertPacket.user
				counter = 0
			AggregatePacketCount += totalNumberOfPacket
			#print "Packet generation done."
			#print "Analyzing..."
			#print str(packetHeap)

			#Initialized
			medium = 0
			# Calculating possible collisions
			while (totalNumberOfPacket > 0):
				#pdb.set_trace ()
				if (lastPacketTime >= simTime*timeFactor*0.98):
					break
				currentPacket = heap.heappop(packetHeap)
				#Non-Persistent CSMA/CD
				if (P == 1):
					#pdb.set_trace()
					if (abs(currentPacket.packetTime - lastPacketTime) > (abs(currentPacket.user - lastSender)*10.0*timeFactor/(2*pow(10,8))) and abs(currentPacket.packetTime - lastPacketTime) < (L*timeFactor/W + 96*timeFactor/W + abs(currentPacket.user - lastSender)*10.0*timeFactor/(2*pow(10,8)))):
						print ("Medium busy " + str(currentPacket.packetTime) + " " + str(currentPacket.user) + " " + str(lastPacketTime) + " " + str(lastSender))
						#pdb.set_trace()
						randomNumber = random.uniform(0.0001, pow(2,LANUsers[currentPacket.user].backoffCounter)-1)*timeFactor*512/W
						#if (randomNumber  == 0):
						#	print "WTF"
						currentPacket.packetTime += randomNumber
						currentPacket.packetTime += 0.0001
						heap.heappush(packetHeap, currentPacket)
						heap.heapify(packetHeap)
					else:
						#print "Medium not busy"
						#A group of collisions
						#print " "+str(currentPacket.packetTime) + " " + str(currentPacket.user)
						if (abs(currentPacket.packetTime - lastPacketTime) <= (L*timeFactor/W+ 96*timeFactor/W + abs(currentPacket.user - lastSender)*10.0*timeFactor/(2*pow(10,8)))):
							#if the conflicting packets are between the same user then delay the 2nd packet by the minimal busy time
							#print "Collision "+str(currentPacket.packetTime) + " " + str(currentPacket.user) + " " + str(lastPacketTime) + " " + str(lastSender)
							if(currentPacket.user == lastSender):
								#print "From same user"
								delayCurrentPacket = packet (lastPacketTime + (L*timeFactor/W+ 96*timeFactor/W + abs(currentPacket.user - lastSender)*10.0*timeFactor/(2*pow(10,8)))+1, currentPacket.user)
								heap.heappush(packetHeap, delayCurrentPacket)
								heap.heapify(packetHeap)
							#if the conflicting packets are between different users
							else:
								#print "From different user"
								if(collisionCount == 0):
									previousPacket = packet (lastPacketTime, lastSender, lastPacketCreationTime)
									collisionList.append(previousPacket)
								collisionList.append(currentPacket)
								collisionCount += 1
							print (str(currentPacket.packetTime) + " " + str(currentPacket.user) + " " + str(lastPacketTime) + " " + str(lastSender))
						elif ((abs(currentPacket.packetTime - lastPacketTime) > (L*timeFactor/W+ 96*timeFactor/W + abs(currentPacket.user - lastSender)*10.0*timeFactor/(2*pow(10,8)))) and collisionCount > 0):
							#print ("Collision occured " + str(collisionCount))
							#print "Resolve collsion"
							resolveCollision(collisionList, collisionCount)
							AggregateCollisionCount += collisionCount
							collisionCount = 0
						elif((abs(currentPacket.packetTime - lastPacketTime) > (L*timeFactor/W+ 96*timeFactor/W + abs(currentPacket.user - lastSender)*10.0*timeFactor/(2*pow(10,8)))) and (currentPacket.packetTime < simTime * timeFactor)):
							#print "Packet successfully delivered"
							LANUsers[currentPacket.user].backoffCounter = 0
							currentPacket.deletionTime = currentPacket.packetTime
							packetThroughPut += 1
							totalNumberOfPacket -= 1
							AggregateDelayTime += currentPacket.deletionTime - currentPacket.insertTime
						if (currentPacket.user != lastSender):
							lastPacketTime = currentPacket.packetTime
							lastSender = currentPacket.user
							lastPacketCreationTime = currentPacket.insertTime

				#P-persistent CSMA/CD
				if (P == 2):
					if (abs(currentPacket.packetTime - lastPacketTime) < (abs(currentPacket.user - lastSender)*10.0*timeFactor/(2*pow(10,8))) or abs(currentPacket.packetTime - lastPacketTime) > (L*timeFactor/W + 96*timeFactor/W + abs(currentPacket.user - lastSender)*10.0*timeFactor/(2*pow(10,8)))):
						calculatedProbability = random.random()
						state = 1
						while (state == 1):
							#pdb.set_trace()
							if (calculatedProbability < (givenProbability/10.0)):
								#print "Medium not busy"
								state = 0
								#A group of collisions
								#print " "+str(currentPacket.packetTime) + " " + str(currentPacket.user)
								if (abs(currentPacket.packetTime - lastPacketTime) <= (L*timeFactor/W+ 96*timeFactor/W + abs(currentPacket.user - lastSender)*10.0*timeFactor/(2*pow(10,8)))):
									#if the conflicting packets are between the same user then delay the 2nd packet by the minimal busy time
									#print "Collision "+str(currentPacket.packetTime) + " " + str(currentPacket.user) + " " + str(lastPacketTime) + " " + str(lastSender)
									if(currentPacket.user == lastSender):
										#print "From same user"
										delayCurrentPacket = packet (lastPacketTime + (L*timeFactor/W+ 96*timeFactor/W + abs(currentPacket.user - lastSender)*10.0*timeFactor/(2*pow(10,8)))+1, currentPacket.user)
										heap.heappush(packetHeap, delayCurrentPacket)
										heap.heapify(packetHeap)
									#if the conflicting packets are between different users
									else:
										#print "From different user"
										if(collisionCount == 0):
											previousPacket = packet (lastPacketTime, lastSender, lastPacketCreationTime)
											collisionList.append(previousPacket)
										collisionList.append(currentPacket)
										collisionCount += 1
									#print (str(currentPacket.packetTime) + " " + str(currentPacket.user) + " " + str(lastPacketTime) + " " + str(lastSender))
								elif ((abs(currentPacket.packetTime - lastPacketTime) > (L*timeFactor/W+ 96*timeFactor/W + abs(currentPacket.user - lastSender)*10.0*timeFactor/(2*pow(10,8)))) and collisionCount > 0):
									#print ("Collision occured " + str(collisionCount))
									#print "Resolve collsion"
									resolveCollision(collisionList, collisionCount)
									AggregateCollisionCount += collisionCount
									collisionCount = 0
								elif((abs(currentPacket.packetTime - lastPacketTime) > (L*timeFactor/W+ 96*timeFactor/W + abs(currentPacket.user - lastSender)*10.0*timeFactor/(2*pow(10,8)))) and (currentPacket.packetTime < simTime * timeFactor)):
									#print "Packet successfully delivered"
									LANUsers[currentPacket.user].backoffCounter = 0
									currentPacket.deletionTime = currentPacket.packetTime
									packetThroughPut += 1
									totalNumberOfPacket -= 1
									AggregateDelayTime += currentPacket.deletionTime - currentPacket.insertTime
								if (currentPacket.user != lastSender):
									lastPacketTime = currentPacket.packetTime
									lastSender = currentPacket.user
									lastPacketCreationTime = currentPacket.insertTime
							else:
								#print "Probability > 0.1"
								randomNumber = random.uniform(0.0001, pow(2,LANUsers[currentPacket.user].backoffCounter)-1)*timeFactor*512/W
								currentPacket.packetTime += randomNumber
								currentPacket.packetTime += 0.0001
								if (abs(currentPacket.packetTime - lastPacketTime) > (abs(currentPacket.user - lastSender)*10.0*timeFactor/(2*pow(10,8))) and abs(currentPacket.packetTime - lastPacketTime) < (L*timeFactor/W + 96*timeFactor/W + abs(currentPacket.user - lastSender)*10.0*timeFactor/(2*pow(10,8)))):
									#print "Back off"
									randomNumber = random.uniform(0.0001, pow(2,LANUsers[currentPacket.user].backoffCounter)-1)*timeFactor*512/W
									currentPacket.packetTime += randomNumber
									currentPacket.packetTime += 0.0001
									heap.heappush(packetHeap, currentPacket)
									heap.heapify(packetHeap)
									state = 0


			if (packetThroughPut != 0):
				print " Number of users: " + str(a*10) + " Data packet per second: " +str(z*4) + " Packet Throughput: "+str(packetThroughPut) + " Average Delay: "+str(AggregateDelayTime/packetThroughPut) + " Total packet created: " + str (AggregatePacketCount) + " Collision#: " + str(AggregateCollisionCount) + " Errors : " + str(AggregateErrorCount)
				with open ("data.txt", "a") as testfile:
					testfile.write (str(a*10) + " " + str(z*4) + " " + str(packetThroughPut) + " " + str(AggregateDelayTime/packetThroughPut) + " " + str(AggregateCollisionCount) + " " + str(AggregatePacketCount)+ "\n")
			else:
				pdb.set_trace()
				y-=1

			LANUsers.clear()
			#print "User deletion done."

			packetThroughPut = 0
			AggregateCollisionCount = 0
			AggregatePacketCount = 0
			AggregateErrorCount = 0
			lastPacketTime = 0
			AggregateDelayTime = 0
			lastPacketCreationTime = 0
			totalNumberOfPacket = 0


			while True:
				try:
					heap.heappop(packetHeap)
				except:
					#print "heap empty"
					break