Assume propagation and processing times are negligible, that the stations have an unlimited number of frames ready for transmission, and that all ACKs are piggybacked onto information frames. 

 

Communication NetworksAssignment 9Due August 24, 2016Question 1Suppose that packets arrive from various sources to a statistical multiplexer thattransmits the packets over a 64 kbps PPP link. Suppose that the PPP frames have lengths thatfollow an exponential distribution with mean 1000 bytes and that the multiplexer can hold up to100 packets at a time. Plot the average packet delay as a function of the packet arrival rate.Question 2Consider a bidirectional link that uses Go-Back-N with N = 3. Suppose thatframes from station A to station B are one unit long and that they use a time-out value of 2, andthat frames in the opposite directions are 2.5 units long and that they use a time-out value of 4.Assume propagation and processing times are negligible, that the stations have an unlimitednumber of frames ready for transmission, and that all ACKs are piggybacked onto informationframes. Assuming stations, A and B begin with their sequence numbers set to zero, show thepattern of transmissions and associated state transitions that result if there are no transmissionerrors.

Attachments:

• 1495508939-Networks Lab Questions.docx