Define a protocol when an error recovery develop for a link, Computer Engineering

Assignment Help:

Suppose you have to develop an error recovery protocol for a link that is unreliable and delay sensitive, which of the following protocol would you choose?

(i) Stop & wait.

(ii) Selective Repeat.

(iii) Go back.

Justify your answer.

Selective- repeat and Go -back both work well if errors are rare. Although if error rate is high than many bandwidth will be wasted in retransmission of frames. Therefore both the above methods are not appropriate for a link which is unreliable and delay sensitive. For such type of link stop and wait protocol is most appropriate protocol. In such protocol sender waits after transmitting all packets. While the receiver is ready for other packet, the receiver sends a control message, as a rule in form of acknowledgement. Though such protocol prevents over run, they can reason extremely inefficient utilization of network capacity.


Related Discussions:- Define a protocol when an error recovery develop for a link

How color depth impacts on image quality and file size, Question : 1. ...

Question : 1. Define the term Color Depth. Explain how it impacts on image quality and file size. 2. Using an appropriate example, explain when you will consider using GIF

Explain the working of a three bit binary ripple counter, With the help of ...

With the help of clocked JK flip flops and waveforms, explain the working of a three bit binary ripple counter. Write truth table for clock transitions. Ans. Three-Bit Binary Rip

Explain jk flip-flop using sr flip-flop, Q. Explain 4 bit Ripple counter wi...

Q. Explain 4 bit Ripple counter with necessary diagram. Q. Explain JK Master-slave Flip-flop with block diagram and logic design. Q. Explain JK flip-flop using SR flip-flop

State the concept of hierarchy in object oriented, Hierarchy Hierarchy...

Hierarchy Hierarchy is a process of ranking or ordering of abstraction. Hierarchy is decided by the help of 'divide and conquer' principle. Complex objects can be described

Explain register indirect addressing, Q. Explain Register Indirect Addressi...

Q. Explain Register Indirect Addressing? In this addressing technique the operand is data in memory pointed to by a register. Or we can say in other words that the operand fie

Define deadlock with resource request and allocation graph, Define Deadlock...

Define Deadlock with Resource request and allocation graph (RRAG) Deadlocks can be described through a directed bipartite graph termed as a RRAG that is Resource Request All

Intuitively simple - user friendliness, Intuitively Simple - User Friendlin...

Intuitively Simple - User Friendliness This is the degree to which the system operates in congruence with human operation, in effect the machine does what we naturally think i

One pointer variable be subtracted from another, Under what conditions can ...

Under what conditions can one pointer variable be subtracted from another? Pointer subtraction isn't used very much, but can be handy to determine the distances between two arr

State the concept of multiplicity, Multiplicity Multiplicity in an ass...

Multiplicity Multiplicity in an association specifies tells us about number of objects participate in a relationship. It decides the number of related objects. Multiplicity is

Define general purpose register architecture, Q. Define General Purpose Reg...

Q. Define General Purpose Register Architecture? General Purpose Register (GPR) Architecture: A register is a word of internal memory similar to the accumulator. GPR architec

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd