-
Notifications
You must be signed in to change notification settings - Fork 1
/
rdt_gbn_cumulative_ack.cpp
508 lines (440 loc) · 15.6 KB
/
rdt_gbn_cumulative_ack.cpp
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
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
#include <queue>
#include "GBN_cumulative_ack.h"
/* ******************************************************************
ALTERNATING BIT AND GO-BACK-N NETWORK EMULATOR: SLIGHTLY MODIFIED
FROM VERSION 1.1 of J.F.Kurose
This code should be used for PA2, unidirectional or bidirectional
data transfer protocols (from A to B. Bidirectional transfer of data
is for extra credit and is not required). Network properties:
- one way network delay averages five time units (longer if there
are other messages in the channel for GBN), but can be larger
- packets can be corrupted (either the header or the data portion)
or lost, according to user-defined probabilities
- packets will be delivered in the order in which they were sent
(although some can be lost).
**********************************************************************/
/********* FUNCTION PROTOTYPES. DEFINED IN THE LATER PART******************/
void timer_init();
void starttimer(int AorB, float increment);
void stoptimer(int AorB);
void tolayer3(int AorB, struct pkt packet);
void tolayer5(int AorB, char datasent[20]);
void printLog(int AorB, char *msg, const struct pkt *p, struct msg *m);
void printStat();
int calc_checksum(const pkt *p);
///============================ Timer Functions ============================
///
void startTimer(int AorB, int timerNo, float increment);
void stopTimer(int AorB, int timerNo);
void resetTimers(int AorB);
void clearTimerFlag(int AorB);
///=========================================================================
/*****************************************************************
***************** NETWORK EMULATION CODE STARTS BELOW ***********
The code below emulates the layer 3 and below network environment:
- emulates the tranmission and delivery (possibly with bit-level corruption
and packet loss) of packets across the layer 3/4 interface
- handles the starting/stopping of a timer, and generates timer
interrupts (resulting in calling students timer handler).
- generates message to be sent (passed from later 5 to 4)
THERE IS NOT REASON THAT ANY STUDENT SHOULD HAVE TO READ OR UNDERSTAND
THE CODE BELOW. YOU SHOLD NOT TOUCH, OR REFERENCE (in your code) ANY
OF THE DATA STRUCTURES BELOW. If you're interested in how I designed
the emulator, you're welcome to look at the code - but again, you should have
to, and you defeinitely should not have to modify
******************************************************************/
struct event {
float evtime; /* event time */
int evtype; /* event type code */
int eventity; /* entity where event occurs */
struct pkt *pktptr; /* ptr to packet (if any) assoc w/ this event */
struct event *prev;
struct event *next;
};
struct event *evlist = NULL; /* the event list */
/* possible events: */
#define TIMER_INTERRUPT 0
#define FROM_LAYER5 1
#define FROM_LAYER3 2
#define OFF 0
#define ON 1
int TRACE = 1; /* for my debugging */
int nsim = 0; /* number of messages from 5 to 4 so far */
int nsimmax = 0; /* number of msgs to generate, then stop */
float time = 0.000;
float lossprob; /* probability that a packet is dropped */
float corruptprob; /* probability that one bit is packet is flipped */
float lambda; /* arrival rate of messages from layer 5 */
int ntolayer3; /* number sent into layer 3 */
int nlost; /* number lost in media */
int ncorrupt; /* number corrupted by media*/
void init();
void generate_next_arrival(void);
void insertevent(struct event *p);
int main() {
struct event *eventptr;
struct msg msg2give;
struct pkt pkt2give;
int i, j;
char c;
init();
freopen("out_gbn_2.doc", "w", stdout);
A_init();
B_init();
while (1) {
eventptr = evlist; /* get next event to simulate */
if (eventptr == NULL)
goto terminate;
evlist = evlist->next; /* remove this event from event list */
if (evlist != NULL)
evlist->prev = NULL;
if (TRACE >= 2) {
printf("\nEVENT time: %f,", eventptr->evtime);
printf(" type: %d", eventptr->evtype);
if (eventptr->evtype == 0)
printf(", timerinterrupt ");
else if (eventptr->evtype == 1)
printf(", fromlayer5 ");
else
printf(", fromlayer3 ");
printf(" entity: %d\n", eventptr->eventity);
}
time = eventptr->evtime; /* update time to next event time */
if (eventptr->evtype == FROM_LAYER5) {
if (nsim < nsimmax) {
if (nsim + 1 < nsimmax)
generate_next_arrival(); /* set up future arrival */
/* fill in msg to give with string of same letter */
j = nsim % 26;
for (i = 0; i < 20; i++)
msg2give.data[i] = 97 + j;
msg2give.data[19] = 0;
if (TRACE > 2) {
printf(" MAINLOOP: data given to student: ");
for (i = 0; i < 20; i++)
printf("%c", msg2give.data[i]);
printf("\n");
}
nsim++;
if (eventptr->eventity == A)
A_output(msg2give);
else
B_output(msg2give);
}
} else if (eventptr->evtype == FROM_LAYER3) {
pkt2give.seqnum = eventptr->pktptr->seqnum;
pkt2give.acknum = eventptr->pktptr->acknum;
pkt2give.checksum = eventptr->pktptr->checksum;
for (i = 0; i < 20; i++)
pkt2give.payload[i] = eventptr->pktptr->payload[i];
if (eventptr->eventity == A) /* deliver packet by calling */
A_input(pkt2give); /* appropriate entity */
else
B_input(pkt2give);
free(eventptr->pktptr); /* free the memory for packet */
} else if (eventptr->evtype == TIMER_INTERRUPT) {
if (eventptr->eventity == A)
A_timerinterrupt();
else
B_timerinterrupt();
} else {
printf("INTERNAL PANIC: unknown event type \n");
}
free(eventptr);
}
terminate:
printf(
" Simulator terminated at time %f\n after sending %d msgs from layer5\n",
time, nsim);
printStat();
}
void init() /* initialize the simulator */
{
int i;
float sum, avg;
float jimsrand();
#ifdef DEBUG
nsimmax = DEBUG_NMSG;
lossprob = DEBUG_PROB_LOSS;
corruptprob = DEBUG_PROB_CORP;
lambda = DEBUG_TIME;
TRACE = DEBUG_TRACE;
printf("----- Stop and Wait Network Simulator Version 1.1 -------- \n\n");
printf("Enter the number of messages to simulate: %d\n", nsimmax);
printf("Enter packet loss probability [enter 0.0 for no loss]: %f\n", lossprob);
printf("Enter packet corruption probability [0.0 for no corruption]: %f\n", corruptprob);
printf("Enter average time between messages from sender's layer5 [ > 0.0]: %f\n", lambda);
printf("Enter TRACE: %d\n", TRACE);
#endif
#ifndef DEBUG
printf("----- Stop and Wait Network Simulator Version 1.1 -------- \n\n");
printf("Enter the number of messages to simulate: ");
scanf("%d", &nsimmax);
printf("Enter packet loss probability [enter 0.0 for no loss]:");
scanf("%f", &lossprob);
printf("Enter packet corruption probability [0.0 for no corruption]:");
scanf("%f", &corruptprob);
printf("Enter average time between messages from sender's layer5 [ > 0.0]:");
scanf("%f", &lambda);
printf("Enter TRACE:");
scanf("%d", &TRACE);
#endif
srand(9999); /* init random number generator */
sum = 0.0; /* test random number generator for students */
for (i = 0; i < 1000; i++)
sum = sum + jimsrand(); /* jimsrand() should be uniform in [0,1] */
avg = sum / 1000.0;
if (avg < 0.25 || avg > 0.75) {
printf("It is likely that random number generation on your machine\n");
printf("is different from what this emulator expects. Please take\n");
printf("a look at the routine jimsrand() in the emulator code. Sorry. \n");
exit(1);
}
ntolayer3 = 0;
nlost = 0;
ncorrupt = 0;
timer_init();
time = 0.0; /* initialize time to 0.0 */
generate_next_arrival(); /* initialize event list */
}
/****************************************************************************/
/* jimsrand(): return a float in range [0,1]. The routine below is used to */
/* isolate all random number generation in one location. We assume that the*/
/* system-supplied rand() function return an int in therange [0,mmm] */
/****************************************************************************/
float jimsrand(void) {
double mmm = RAND_MAX;
float x; /* individual students may need to change mmm */
x = rand() / mmm; /* x should be uniform in [0,1] */
return (x);
}
/********************* EVENT HANDLINE ROUTINES *******/
/* The next set of routines handle the event list */
/*****************************************************/
void generate_next_arrival(void) {
double x, log(), ceil();
struct event *evptr;
float ttime;
int tempint;
if (TRACE > 2)
printf(" GENERATE NEXT ARRIVAL: creating new arrival\n");
x = lambda * jimsrand() * 2; /* x is uniform on [0,2*lambda] */
/* having mean of lambda */
evptr = (struct event *) malloc(sizeof(struct event));
evptr->evtime = time + x;
evptr->evtype = FROM_LAYER5;
if (BIDIRECTIONAL && (jimsrand() > 0.5))
evptr->eventity = B;
else
evptr->eventity = A;
insertevent(evptr);
}
void insertevent(struct event *p) {
struct event *q, *qold;
if (TRACE > 2) {
printf(" INSERTEVENT: time is %lf\n", time);
printf(" INSERTEVENT: future time will be %lf\n", p->evtime);
}
q = evlist; /* q points to header of list in which p struct inserted */
if (q == NULL) /* list is empty */
{
evlist = p;
p->next = NULL;
p->prev = NULL;
} else {
for (qold = q; q != NULL && p->evtime > q->evtime; q = q->next)
qold = q;
if (q == NULL) /* end of list */
{
qold->next = p;
p->prev = qold;
p->next = NULL;
} else if (q == evlist) /* front of list */
{
p->next = evlist;
p->prev = NULL;
p->next->prev = p;
evlist = p;
} else /* middle of list */
{
p->next = q;
p->prev = q->prev;
q->prev->next = p;
q->prev = p;
}
}
}
void printevlist(void) {
struct event *q;
int i;
printf("--------------\nEvent List Follows:\n");
for (q = evlist; q != NULL; q = q->next) {
printf("Event time: %f, type: %d entity: %d\n", q->evtime, q->evtype,
q->eventity);
}
printf("--------------\n");
}
/********************** Student-callable ROUTINES ***********************/
/* called by students routine to cancel a previously-started timer */
void stoptimer(int AorB /* A or B is trying to stop timer */) {
struct event *q, *qold;
if (TRACE > 2)
printf(" STOP TIMER: stopping timer at %f\n", time);
/* for (q=evlist; q!=NULL && q->next!=NULL; q = q->next) */
for (q = evlist; q != NULL; q = q->next)
if ((q->evtype == TIMER_INTERRUPT && q->eventity == AorB)) {
/* remove this event */
if (q->next == NULL && q->prev == NULL)
evlist = NULL; /* remove first and only event on list */
else if (q->next == NULL) /* end of list - there is one in front */
q->prev->next = NULL;
else if (q == evlist) /* front of list - there must be event after */
{
q->next->prev = NULL;
evlist = q->next;
} else /* middle of list */
{
q->next->prev = q->prev;
q->prev->next = q->next;
}
free(q);
return;
}
printf("Warning: unable to cancel your timer. It wasn't running.\n");
}
void starttimer(int AorB /* A or B is trying to start timer */, float increment) {
struct event *q;
struct event *evptr;
if (TRACE > 2)
printf(" START TIMER: starting timer at %f\n", time);
/* be nice: check to see if timer is already started, if so, then warn */
/* for (q=evlist; q!=NULL && q->next!=NULL; q = q->next) */
for (q = evlist; q != NULL; q = q->next)
if ((q->evtype == TIMER_INTERRUPT && q->eventity == AorB)) {
printf("Warning: attempt to start a timer that is already started\n");
return;
}
/* create future event for when timer goes off */
evptr = (struct event *) malloc(sizeof(struct event));
evptr->evtime = time + increment;
evptr->evtype = TIMER_INTERRUPT;
evptr->eventity = AorB;
insertevent(evptr);
}
/************************** TOLAYER3 ***************/
void tolayer3(int AorB, struct pkt packet) {
struct pkt *mypktptr;
struct event *evptr, *q;
float lastime, x;
int i;
ntolayer3++;
/* simulate losses: */
if (jimsrand() < lossprob) {
nlost++;
if (TRACE > 0)
printf(" TOLAYER3: packet being lost\n");
return;
}
/* make a copy of the packet student just gave me since he/she may decide */
/* to do something with the packet after we return back to him/her */
mypktptr = (struct pkt *) malloc(sizeof(struct pkt));
mypktptr->seqnum = packet.seqnum;
mypktptr->acknum = packet.acknum;
mypktptr->checksum = packet.checksum;
for (i = 0; i < 20; i++)
mypktptr->payload[i] = packet.payload[i];
if (TRACE > 2) {
printf(" TOLAYER3: seq: %d, ack %d, check: %d ", mypktptr->seqnum,
mypktptr->acknum, mypktptr->checksum);
for (i = 0; i < 20; i++)
printf("%c", mypktptr->payload[i]);
printf("\n");
}
/* create future event for arrival of packet at the other side */
evptr = (struct event *) malloc(sizeof(struct event));
evptr->evtype = FROM_LAYER3; /* packet will pop out from layer3 */
evptr->eventity = (AorB + 1) % 2; /* event occurs at other entity */
evptr->pktptr = mypktptr; /* save ptr to my copy of packet */
/* finally, compute the arrival time of packet at the other end.
medium can not reorder, so make sure packet arrives between 1 and 10
time units after the latest arrival time of packets
currently in the medium on their way to the destination */
lastime = time;
/* for (q=evlist; q!=NULL && q->next!=NULL; q = q->next) */
for (q = evlist; q != NULL; q = q->next)
if ((q->evtype == FROM_LAYER3 && q->eventity == evptr->eventity))
lastime = q->evtime;
evptr->evtime = lastime + 1 + 9 * jimsrand();
/* simulate corruption: */
if (jimsrand() < corruptprob) {
ncorrupt++;
if ((x = jimsrand()) < .75)
mypktptr->payload[0] = 'Z'; /* corrupt payload */
else if (x < .875)
mypktptr->seqnum = 999999;
else
mypktptr->acknum = 999999;
if (TRACE > 0)
printf(" TOLAYER3: packet being corrupted\n");
}
if (TRACE > 2)
printf(" TOLAYER3: scheduling arrival on other side\n");
insertevent(evptr);
}
void tolayer5(int AorB, char datasent[20]) {
int i;
if (TRACE > 2) {
printf(" TOLAYER5: data received: ");
for (i = 0; i < 20; i++)
printf("%c", datasent[i]);
printf("\n");
}
}
//============================ Timers =====================================
#define MAX_TIMERS (WINDOW_SIZE+1)
bool hasTimerStarted;
//float timersQ[MAX_TIMERS];
std::queue<std::pair<float, float >> timersQ;// startTime,Timeout
void timer_init() {
hasTimerStarted = false;
}
void startTimer(int AorB, int timerNo, float increment) {
if (!hasTimerStarted) {
starttimer(AorB, increment);
hasTimerStarted = true;
return;
}
timersQ.push(std::make_pair(time, increment));
}
void stopTimer(int AorB, int timerNo) {
if (!hasTimerStarted)
return;
stoptimer(AorB);
hasTimerStarted = false;
// clear all timers that already been passed. redundant in GBN
while (!timersQ.empty() && (timersQ.front().second + timersQ.front().first) <= time) timersQ.pop();
if (!timersQ.empty()) {
starttimer(AorB, (timersQ.front().second - (time - timersQ.front().first)));// timeout-elapsed_time
timersQ.pop();
hasTimerStarted = true;
}
}
void resetTimers(int AorB) {
if (!hasTimerStarted)
return;
stoptimer(AorB);
hasTimerStarted = false;
while (!timersQ.empty()) timersQ.pop();
}
void clearTimerFlag(int AorB) {
hasTimerStarted = false;
}
/******************* DEBUG ***********************/
void printLog(int AorB, char *msg, const struct pkt *p, struct msg *m) {
// static bool opened = false;
// if (!opened) opened = true, fclose(fopen("output_gbn_2.log", "w"));
// FILE *fp = fopen("output_gbn_2.log", "a");
writeLog(stdout, AorB, msg, p, m, time);
// else fprintf(fp, "====================================== %s ======================================\n", msg);
// fclose(fp);
}