1. Round trip time will include propagation delay and transmission delay.
Since the distance between node A and node B is 16 KM, hence
propagation time from node A to node B = 16/300000 =
5.33*10-5 sec = 0.0533
Hence round-trip propagation delay = 2*0.0533 = 0.1066
Packet size = 1400+100 = 1500 bytes = 1500*8 bits = 12000 bits
Bandwidth = 1 Gbits/sec =
Transmission delay in sending packet = packet size/ bandwidth =
12000/ 109 = 12
Transmission delay in sending acknowledgement = acknowledge
size/ bandwidth = 1200/ 109 = 1.2
Hence Round trip time = Transmission delay in sending packet +
Transmission delay in sending acknowledgement + round-trip
propagation delay = 12 + 1.2 + 0.1066 =
13.3066
2. Suppose N packets can be transmitted for efficient utilization. This means
N*(transmission delay of sending packet) = Round trip time
=> N*12 = 13.3066
This given N to be roughly 1.
Hence the sequence number should be N+N = 2
For sequence number of 2, window size of 2 is sufficient.
3. Yes since sequence number is upto 2, hence 4 bit sequence number with total 24 = 16 sequence number will be sufficient for both selective repeat and Go-back N.
Please comment for any clarification.
(a) A data link with a 1 Gigabits/sec capacity is used to transmit packets made up of 1400 bytes of data and 100 bytes of protocol control information. Each packet is acknowledged by a short frame of...
please answer the question clearly.
Sliding window protocol with window size of 7 frames are used between the data link layers of machines A and B. Assume that machine B sends an ACK (acknowledgement) for every frame it receives without error, and it sends a NAK (negative acknowledgement) for every frame it receives with error. This corresponds to a receiver window size of 1 frame. Assume also that no frames are lost in the transmission medium. For the scenario shown...
1. For TCP end-to-end flow control, suppose the capacity of the
receiver buffer is 10 packets. Suppose the packets that are being
queued in the receiver buffer are packets 4, 5, 6, 7, 8, 10, 11.
What is the advertised window size the receiver sent to the sender?
Suppose packet 12 is the last packet sent by the sender. What’s the
effective window size at the sender? Can the sender send out packet
13 at this moment? How about packet...
QUESTION 1 "A single router is transmitting packets, each of length L bits, over a single link with transmission rate R Mbps to another router at the other end of the link. Suppose that the packet length is L= 12000 bits, and that the link transmission rate along the link to router on the right is R = 1000 Mbps. What is the maximum number of packets per second that can be transmitted by the link (use a whole number)?"...
help with computer network questions 1. What is the difference between circuit switching and packet switching? 2. What are the different layers in today’s Internet? Why do we create layers? 3. Suppose there is a 10 Mbps microwave link between a geostationary satellite and its base station on Earth. Every minute the satellite takes a digital photo and sends it to the base station. Assume a propagation speed of 2.4 * 10^8 meters/sec. a. What is the propagation delay of...
PLEASE HELP WITH THESE COMPUTER NETWORK QUESTIONS THESE INCLUDE MCQS AND CALCULATIONS With reference to the Go-Back-N and Selective repeat protocols, what does the window value signify? The packets that have already been ACKed The packets sent but remain unACKed The sequence numbers available and not yet sent The sequence numbers of packets not yet available None of the above 1 points QUESTION 2 Which of the following is NOT a component of the TCP congestion control algorithm? Slow...
check my answers for Networking I came up with these answers, can check my answers Question 1: General What data rate is needed to transmit an uncompressed 4" x 6" photograph every second with a resolution of 1200 dots per inch and 24 bits per dot (pixel)? 691,200 kb/s 28.8 kb/s 8.29 Mb/s 829 Mb/s Question 2: Layering "Layering" is commonly used in computer networks because (check all that apply): -It forces all network software to be written in ‘C’....
Q1 Error detection/correction Can these schemes correct bit errors: Internet checksums, two-dimendional parity, cyclic redundancy check (CRC) A. Yes, No, No B. No, Yes, Yes c. No, Yes, No D. No, No, Yes E. Ho, hum, ha Q2 CRC vs Internet checksums Which of these is not true? A. CRC's are commonly used at the link layer B. CRC's can detect any bit error of up to r bits with an r-bit EDC. c. CRC's are more resilient to bursty...