クラスにCでGo-Back-Nを使用するシミュレートされたネットワーク環境のコードを作成しようとしています。A_timerinterrupt()しかし、私は自分のメソッドを含むある種の無限ループに入り続けています。以下はCファイルなので、それと私のメソッドを見ることができます。
シミュレートされたメッセージの数=10、パケット損失の確率= 0.1、破損の確率= 0.1、平均時間= 5、およびTRACE=0でこれを実行したことに注意してください。
私が得るのは、が呼び出されたA: Timer Stopped!ときにのみ発生するメッセージの無限ループです。A_timerinterrupt
#include <stdio.h>
/* ******************************************************************
ALTERNATING BIT AND GO-BACK-N NETWORK EMULATOR: VERSION 1.1 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).
**********************************************************************/
#define BIDIRECTIONAL 0 /* change to 1 if you're doing extra credit */
/* and write a routine called B_output */
/* a "msg" is the data unit passed from layer 5 (teachers code) to layer */
/* 4 (students' code). It contains the data (characters) to be delivered */
/* to layer 5 via the students transport level protocol entities. */
struct msg {
char data[20];
};
/* a packet is the data unit passed from layer 4 (students code) to layer */
/* 3 (teachers code). Note the pre-defined packet structure, which all */
/* students must follow. */
struct pkt {
int seqnum;
int acknum;
int checksum;
char payload[20];
};
/********* STUDENTS WRITE THE NEXT SEVEN ROUTINES *********/
#define winSize 8
#define maxBuffer 50
#define NACK -1
/* expected seqnum at receiver side */
int expectnum;
/* next seqnum to use in sender side */
int nextnum;
/* the head of sender window */
int base;
/* window packets buffer */
struct pkt winBuffer[winSize];
/* start and end points of window buffer */
int winStart, winEnd;
/* packet number of window buffer */
int pNum;
/* sender message buffer */
struct msg buffer[maxBuffer];
/* message count of buffer */
int msgnum;
/* front and rear pointers of buffer */
int bufStart, bufEnd;
/* computes checksum for packet */
void csum(packet)
struct pkt *packet;
{
int checksum;
int i;
checksum = packet->seqnum;
checksum = checksum + packet->acknum;
for (i = 0; i < 20; i++)
checksum = checksum + (int)(packet->payload[i]);
checksum = 0 - checksum;
packet->checksum = checksum;
}
/* checks if packet is corrupt */
int Corrupted(packet)
struct pkt packet;
{
int checksum;
int i;
checksum = packet.seqnum;
checksum = checksum + packet.acknum;
for (i = 0; i < 20; i++)
checksum = checksum + (int)(packet.payload[i]);
if ((packet.checksum + checksum) == 0)
return (0);
else
return (1);
}
/* called from layer 5, passed the data to be sent to other side */
A_output(message)
struct msg message;
{
int i;
struct pkt sendpkt;
/* if window is not full */
if (nextnum < base + winSize) {
/* create packet */
sendpkt.seqnum = nextnum;
sendpkt.acknum = 0;
printf("A: Sending message\n");
for (i = 0; i < 20; i++)
sendpkt.payload[i] = message.data[i];
/* get checksum */
csum(&sendpkt);
/* send packet */
tolayer3(0, sendpkt);
/* copy packet */
pNum++;
winEnd = (winEnd + 1) % winSize;
winBuffer[winEnd] = sendpkt;
for (i = 0; i < 20; i++)
winBuffer[winEnd].payload[i] = sendpkt.payload[i];
/* start timeout for packet */
if (nextnum == base) {
starttimer(0, 20);
printf("A: Starting timer\n");
}
/* increment nextnum */
nextnum = nextnum + 1;
}
/* if window is full */
else {
printf("A: Send window is full! \n");
/* exit if full */
if (msgnum == maxBuffer) {
printf("A: Buffer is full! \n");
exit(1);
}
/* if not full, buffer message */
else {
printf("A: Buffering message\n");
bufEnd = (bufEnd + 1) % maxBuffer;
for (i = 0; i < 20; i++)
buffer[bufEnd].data[i] = message.data[i];
msgnum++;
}
}
}
B_output(message) /* need be completed only for extra credit */
struct msg message;
{
}
/* called from layer 3, when a packet arrives for layer 4 */
A_input(packet)
struct pkt packet;
{
int i;
struct pkt sendpkt;
/* if received packet is not corrupted and NACK is not received */
if ((Corrupted(packet) == 0) && (packet.acknum != NACK)) {
printf("A: ACK, B got the packet\n");
/* empty window buffer */
winStart = (winStart + (packet.acknum + 1 - base)) % winSize;
pNum = pNum - (packet.acknum + 1 - base);
/* change base */
base = packet.acknum + 1;
stoptimer(0);
if (base < nextnum) {
starttimer(0, 20);
printf("A: Sending packets\n");
}
/* send new packets */
while ((msgnum != 0) && (nextnum < base + winSize)) {
/* make packet */
sendpkt.acknum = 0;
sendpkt.seqnum = nextnum;
bufStart = (bufStart + 1) % maxBuffer;
for (i = 0; i < 20; i++)
sendpkt.payload[i] = buffer[bufStart].data[i];
/* checksum */
csum(&sendpkt);
/* start timeout */
if (base == nextnum) {
starttimer(0, 20);
printf("A: Sending packets\n");
}
/* send packet */
tolayer3(0, sendpkt);
/* copy packet */
winEnd = (winEnd + 1) % winSize;
winBuffer[winEnd] = sendpkt;
pNum++;
/* increment nextnum */
nextnum = nextnum + 1;
/* decrement messages */
msgnum--;
}
} else
printf("A: NAK, B Requested a resend\n");
}
/* called when A's timer goes off */
A_timerinterrupt()
{
int i;
//printf("A: Timer stopped!\n");
/* start timer */
starttimer(0, 20);
/* resend */
for (i = 1; i <= pNum; i++) {
tolayer3(0, winBuffer[(winStart + i) % winSize]);
}
}
/* the following routine will be called once (only) before any other */
/* entity A routines are called. You can use it to do any initialization */
A_init()
{
nextnum = 0;
msgnum = 0;
base = 0;
pNum = 0;
winStart = 0;
winEnd = 0;
bufStart = 0;
bufEnd = 0;
}
/* Note that with simplex transfer from a-to-B, there is no B_output() */
/* called from layer 3, when a packet arrives for layer 4 at B*/
B_input(packet)
struct pkt packet;
{
struct pkt sendpkt;
int i;
/* if not corrupted and packet number is expected */
if ((Corrupted(packet) == 0) && (packet.seqnum == expectnum)) {
printf("B: Packet received, Sending ACK");
/* send an ACK */
/* make packet */
sendpkt.seqnum = 0;
sendpkt.acknum = expectnum;
for (i = 0; i < 20; i++)
sendpkt.payload[i] = '0';
/* get checksum */
csum(&sendpkt);
/* send packet */
tolayer3(1, sendpkt);
/* increment expected packet number */
expectnum = expectnum + 1;
/* send packet up */
tolayer5(1, packet.payload);
}
/* send NACK */
else {
printf("B: Sending NACK, packet not received or was corrupt");
/* make packet */
sendpkt.seqnum = 0;
sendpkt.acknum = NACK;
for (i = 0; i < 20; i++)
sendpkt.payload[i] = '0';
/* get checksum */
csum(&sendpkt);
/* send packet */
tolayer3(1, sendpkt);
}
}
/* called when B's timer goes off */
B_timerinterrupt()
{
int i;
printf("B: Timer was interrupted!\n");
/* start timer */
starttimer(1, 20);
/* resend */
for (i = 1; i <= pNum; i++) {
tolayer5(1, winBuffer[(winStart + i) % winSize]);
}
}
/* the following rouytine will be called once (only) before any other */
/* entity B routines are called. You can use it to do any initialization */
B_init()
{
expectnum = 0;
}
/*****************************************************************
***************** 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
#define A 0
#define B 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 */
main()
{
struct event *eventptr;
struct msg msg2give;
struct pkt pkt2give;
int i, j;
char c;
init();
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 (nsim == nsimmax)
break; /* all done with simulation */
if (eventptr->evtype == FROM_LAYER5) {
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;
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);
}
init()
{ /* initialize the simulator */
int i;
float sum, avg;
float jimsrand();
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);
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;
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()
{
double mmm = 2147483647; /* largest int - MACHINE DEPENDENT!!!!!!!! */
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 */
/*****************************************************/
generate_next_arrival()
{
double x, log(), ceil();
struct event *evptr;
char *malloc();
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);
}
insertevent(p)
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;
}
}
}
printevlist()
{
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 */
stoptimer(AorB)
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");
}
starttimer(AorB, increment)
int AorB; /* A or B is trying to stop timer */
float increment;
{
struct event *q;
struct event *evptr;
char *malloc();
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 ***************/
tolayer3(AorB, packet)
int AorB; /* A or B is trying to stop timer */
struct pkt packet;
{
struct pkt *mypktptr;
struct event *evptr, *q;
char *malloc();
float lastime, x, jimsrand();
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);
}
tolayer5(AorB, datasent)
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");
}
}