-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathAdversary.py
182 lines (155 loc) · 4.39 KB
/
Adversary.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
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
import math
from Algorithm import Algorithm
epsilon = 0.001
wait = -1
class Adversary(Algorithm):
algorithmType = "ADV"
def __lt__(self, other):
return not isinstance(other, Adversary)
class NoErrors(Adversary):
def generate(self):
while True:
for p in self.model.packets:
if self.queue[p]:
yield p
break
def algorithmSchedules(self, packet):
pass
def adversarySchedules(self, packet):
pass
class SiroccoThm9(Adversary):
counter = 0
def generate(self):
while True:
send = ([packet for packet in reversed(self.model.packets) if self.queue[packet]] or [None])[0]
yield send
def algorithmSchedules(self, packet):
l1, l2 = self.model.packets
if packet == l2:
error = l2-l1 if self.counter % 2 == 0 else l1
self.counter += 1
return error
def adversarySchedules(self, packet):
pass
class SiroccoThm11(Adversary):
def generate(self):
l1 = self.model.packets[0]
while True:
yield l1 if self.queue[l1] else None
def algorithmSchedules(self, packet):
l1, l2 = self.model.packets
return l1 / (1 if self.queue[l1] and self.queue[l2] else 2)
def adversarySchedules(self, packet):
pass
class SiroccoL(Adversary):
mode = 'short'
def generate(self):
while True:
if self.mode == 'short':
# SL
send = ([packet for packet in self.model.packets if self.queue[packet]] or [None])[0]
yield send
else:
# LL
send = ([packet for packet in reversed(self.model.packets) if self.queue[packet]] or [None])[0]
yield send
def algorithmSchedules(self, packet):
l1, l2 = self.model.packets
if not self.sending:
if packet == l2:
self.mode = 'short'
return l2 - epsilon
else:
self.mode = 'long'
if self.queue[l2]:
return l2
else:
return epsilon
def adversarySchedules(self, packet):
pass
class Sirocco(Adversary):
mode = None
sentShort = 0
def generate(self):
l1, l2 = self.model.packets
self.shortInPhase = math.ceil(l2 / l1) - 1
while True:
if self.mode == "short":
packet = l1 if self.queue[l1] else None
if packet:
self.sentShort += 1
else:
self.sentShort = self.shortInPhase
yield packet
else:
yield ([packet for packet in reversed(self.model.packets) if self.queue[packet]] or [None])[0]
def algorithmSchedules(self, packet):
l1, l2 = self.model.packets
if not self.sending:
self.sentShort = 0
if packet == l2:
self.mode = "short"
if not self.queue[l1]: return wait
elif packet == l1:
self.mode = "long"
return l2 if self.queue[l2] else wait
elif packet is None:
self.mode = "long"
def adversarySchedules(self, packet):
l1, l2 = self.model.packets
if self.sending and self.sentShort == self.shortInPhase:
# print("% shortInPhase", self.sentShort, self.shortInPhase)
return l1
if not self.sending:
return wait
class ESirocco(Adversary):
mode = None
sentInPhase = 0
def generate(self):
while True:
if self.mode == "short":
leftInPhase = self.algPacket - self.sentInPhase
packets = list(filter(lambda p: self.queue[p] and p < leftInPhase, self.model.packets))
if packets:
packet = packets[0]
self.sentInPhase += packet
yield packet
else:
yield None
elif self.mode == "long":
packets = list(filter(lambda p: self.queue[p] and p > self.algPacket, self.model.packets))
yield packets[0] if packets else None
else:
packets = list(filter(lambda p: self.queue[p], self.model.packets))
yield packets[0] if packets else None
# if self.mode == 'short':
# selected = self.model.packets
# elif self.mode == 'long':
# selected = self.model.packets[1:]
# else:
# selected = []
# send = ([packet for packet in selected if self.queue[packet]] or [None])[0]
# yield send
def algorithmSchedules(self, packet):
if not self.sending:
self.algPacket = packet
self.sentInPhase = 0
if packet == self.model.packets[0]:
self.mode = "long"
if not list(filter(lambda p: self.queue[p] and p > self.algPacket, self.model.packets)): return wait
elif packet is None:
self.mode = None
else:
self.mode = "short"
if not list(filter(lambda p: self.queue[p] and p < packet, self.model.packets)): return wait
def adversarySchedules(self, packet):
if packet:
if self.mode == "long" or self.mode == None:
return packet
else:
if self.mode == "short":
if self.sentInPhase:
self.sentInPhase = 0
return epsilon
else:
return wait