Awesome q2a theme
0 votes
6 views
Recall that in go-back-N protocol, the transmitting window size is N and the receiver window size is 1. Consider a pipelined, reliable transport protocol that uses go-back-N with cumulative acknowledgment. Assume that the timeouts trigger retransmissions (but note that duplicate acknowledgments do not). Further assume that the receiver does not maintain any receive buffer, the one-way delay between the sender and receiver is 50ms, and every packet is 10,000 bits long. Suppose that the sender must be able to send at a steady rate of 1Gb/s (gigabit per second) under ideal conditions. (a) What should be the window size to allow the steady rate mentioned above? (b) Suppose that the expected number of packets lost per 100,000 packets is 1. If the sender uses a timeout of 500ms and a window size of 20,000 packets, calculate the expected gap between two timeouts, when (i) The bottleneck link rate is 1Gb/s. (ii) The bottleneck link rate is 2Gb/s.
in Computer Networks by (10 points) | 6 views

Please log in or register to answer this question.

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Top Users Apr 2020
  1. Ram Swaroop

    38 Points

  2. Kushagra गुप्ता

    36 Points

  3. !KARAN

    36 Points

  4. sushmitagoswami

    6 Points

  5. iot_ts

    6 Points

  6. Theda53E2483

    5 Points

  7. FrancescoG89

    5 Points

  8. PalmaMast586

    5 Points

  9. MarciaNaranj

    5 Points

  10. AntoniaSchne

    5 Points

3,527 questions
1,658 answers
10,469 comments
90,058 users