Scribd
Upload
43 views

Example

Two nodes are connected through an unreliable link. The link may have certain characteristics such as a long round trip delay, high probability of packet loss, or it may have high packet error rate. You may be asked to design a reliable data transfer protocol. Such a protocol may be required to use minimum techniques to reduce the complexity (while guaranteeing reliability)

Uploaded by

api-3722999
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
43 views

Example

Two nodes are connected through an unreliable link. The link may have certain characteristics such as a long round trip delay, high probability of packet loss, or it may have high packet error rate. You may be asked to design a reliable data transfer protocol. Such a protocol may be required to use minimum techniques to reduce the complexity (while guaranteeing reliability)

Uploaded by

api-3722999
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

This is just an example for different potential requirements given a particular scenario.

Assume that two nodes are connected through an unreliable link. The link has certain characteristics. 
For example, it may have a long round trip delay, or it may have high probability of packet loss, or it may 
have high packet error rate, or it may be only half‐duplex. Given only one or a combination of the above 
characteristics, you may be asked to design a reliable data transfer protocol. Such a protocol may be 
required to use minimum techniques to reduce the complexity (while guaranteeing reliability).  

The key is to understand the purposes of different techniques employed such as checksum, sequence 
number, ack, etc. 

You might also like