Question

25. Suppose you are designing a sliding window protocol for a 1-Mbps point-to-point link to the stationary satellite evolving around the Earth at an altitude of 3 x 104 km. Assuming that each frame carries 1 KB of data, what is the minimum number of bits you need for the sequence number in the following cases? Assume the speed of light is 3 x 108 m/s. (a) RWS-1 (b) RWS-SWS
0 0
Add a comment Improve this question Transcribed image text
Answer #1

25头 r Vm Le (a) Guen emeiulay RAJ リ number %an .cam be -Qroume ar 2 上0 3x1o8 m

Add a comment
Know the answer?
Add Answer to:
25. Suppose you are designing a sliding window protocol for a 1-Mbps point-to-point link to the...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
  • Consider an ARQ algorithm running over 2-Mbps point-to-point link to a stationary satellite orbiting around the...

    Consider an ARQ algorithm running over 2-Mbps point-to-point link to a stationary satellite orbiting around the earth at an altitude of 4 x 104 km. Assume that the speed of light is 3 X 108 m/s and that each frame carries 2 KB (kilobyte) of data. What is the minimum number of bits you need for the sequence number for the following cases? i. RWS = 1 ii. RWS = SWS

  • (a) In a sliding window protocol with RWS=SWS=5, a very large set of possible sequence numbers...

    (a) In a sliding window protocol with RWS=SWS=5, a very large set of possible sequence numbers (assume no wrapping), and in-order packet arrivals, why can the receiver be assured -3- that it will never again receive the frame with sequence number 10 if it is currently expecting frame 17? (b) For the sliding window protocol, if the sender’s window size (SWS) equals the receiver’s window size (RWS), what is the minimum number of sequence numbers that are required? How many...

  • Consider a 1-Mbps satellite channel. Frame length is 1000 bits and the probability of an unsucces...

    Please, answer all the parts of the question. The subject is Networking. Consider a 1-Mbps satellite channel. Frame length is 1000 bits and the probability of an unsuccessfiul frame transmission is P. Assume that the errors on different frames are independent. Neglect acknowledgment transmission time and receiver processing time and assume a sliding window protocol, using the selective-repeat ARQ method of error recovery. Assume t-50x10° seconds (a) What is the average number of transmission per frame N Assume P 0.01...

  • help with computer network questions 1. What is the difference between circuit switching and packet switching?...

    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...

  • Sliding window protocol with window size of 7 frames are used between the data link layers of mac...

    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...

  • 11. Suppose the bandwidth on a point-to-point link is 1 Mbps and the round-trip delay is...

    11. Suppose the bandwidth on a point-to-point link is 1 Mbps and the round-trip delay is 19 milliseconds. Assume that the size of each packet is 1000 bits. Also assume that the size of ACK packet is negligible. Answer each of the following for both go-back-n and selective-repeat schemes. Assume that the sender always has data for transmission. (10 points) (a) Assuming that the link is error-free, what should be the minimum window size to achieve at least 75% utilization....

  • You are hired to design a reliable byte-stream protocol that uses a sliding window (like TCP)....

    You are hired to design a reliable byte-stream protocol that uses a sliding window (like TCP). This protocol will run over a 1-Gbps network. The RTT of the network is 200 ms. How many bits would you include in the AdvertisedWindow field of your protocol header? (choose the closest number that can satisfy the above requirement). Hints: - First, determine how much data to keep the pipe full (i.e. delay * bandwidth) - Second, if we assume the window is...

  • (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...

    (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 size 150 bytes. The propagation speed in the transmission medium is 200,000 km/sec. Consider the buffering and processing time in the nodes to be negligible. A node A communicates with a node B, with a distance between nodes A and B of 16...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT