Explain that lost acknowledgement in packet retransmission, Computer Engineering

Assignment Help:

Explain that the lost acknowledgement does not necessarily enforce retransmission of the packet.

To guarantee reliable transfer, protocols utilize positive acknowledgement along with retransmission. Whenever receiver acquires the packet an acknowledgement is sent.

Generally packet is retransmitted, if an acknowledgement is lost. Retransmission cannot succeed if a hardware failure has lastingly disconnected the network or if getting computer has crashed. Hence, protocols retransmitting the messages bound the maximum number of transmissions. While the bound has been reached, the protocol stops retransmission of packet still if acknowledges is not acquired. Hence, lost acknowledgement does not necessarily enforce retransmission of packet.


Related Discussions:- Explain that lost acknowledgement in packet retransmission

Prove boolean identities using boolean algebra, Prove the following Boolean...

Prove the following Boolean identities using the laws of Boolean algebra: ABC + AB ‾C + ABC ‾ = A(B + C) Ans. ABC+AB'C+ABC'=A(B + C) LHS AC(B+B')+AB(C+C') OR  AC+AB OR  A(B

Explain magnetic read and write mechanisms, Q. Explain Magnetic Read and Wr...

Q. Explain Magnetic Read and Write Mechanisms? Data are recorded on and then retrieved from disk via a conducting coil called the head. In numerous systems there are two heads,

Universal elimination, Universal Elimination: Here for any sentence, t...

Universal Elimination: Here for any sentence, there is A, containing a universally quantified variable, v, just for any ground term, g, so we can substitute g for v in A. Thus

The last character of the ldb name, The last character of the LDB name deno...

The last character of the LDB name denote?? Application

Show the transmission control protocol, Q. Show the Transmission Control Pr...

Q. Show the Transmission Control Protocol? Transmission Control Protocol (TCP) TCP makes Internet reliable. TCP solves many problems which can occur in a packet switching

Define technique of improving priority of process wait queue, is a techniqu...

is a technique of improving the priority of process waiting in Queue for CPU allocation? Ageing is a technique of enhancing the priority of process waiting in Queue for CPU all

Specifying research problems, Specifying Research Problems: In our age...

Specifying Research Problems: In our agent terminology or in technique history, a problem to be solved is a specific and justified manner where the agent has starts with the b

What is shadow ram, Shadow RAM is a copy of Basic Input/Output Operating Sy...

Shadow RAM is a copy of Basic Input/Output Operating System (BIOS) routines from read-only memory (ROM) into a particular area of random access memory (RAM) so that they can be acc

Direct or random access of elements, Direct or random access of elements is...

Direct or random access of elements is not possible in:- In Linked list direct or random access of elements is not possible

Explain non-pre-emptive algorithms, Explain non-pre-emptive algorithms?   ...

Explain non-pre-emptive algorithms?   Non preemptive algorithms: In this algorithm a job is provided to CPU for execution as long as the job is non-completed the CPU cannot

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