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

Describe key features of the von neumann architecture, Q. Describe key feat...

Q. Describe key features of the von Neumann Architecture? Describe key features of the von Neumann Architecture: The mainly basic function performed by a computer is exe

What is component diagrams in uml, A component diagram is mainly useful wit...

A component diagram is mainly useful with teams of larger size. UML components are great to perform architectural landscape for an exact system. The component diagram permits to mo

Software Engineering, Software Engineering is a layered technology. Explain...

Software Engineering is a layered technology. Explain

An append structure with pooled or cluster tables, Can we include customizi...

Can we include customizing include or an append structure with Pooled or Cluster tables? No.

How to detect overflow condition, How to detect overflow condition An o...

How to detect overflow condition An overflow condition can be notice by observing the carry into the sign bit position and the carry out of sign bit position. If this carries a

Define deadlock, Define deadlock. A process requests resources; if the ...

Define deadlock. A process requests resources; if the resources are not available at that time, the method enters a wait state. Waiting processes might never again change state

Give example of bus and memory transfer, Give example of bus and memory tra...

Give example of bus and memory transfer For example, the read operation for transfer of a memory unit M from address register AR to another data register DR can be illustrated

The different storage classes in c, What are the different storage classes ...

What are the different storage classes in C?  Storage classes in C  There are four storage classes in C:  a. Automatic storage class:  b. Register storage class:  c

What do you mean by first fit, What do you mean by first fit? First fi...

What do you mean by first fit? First fit allocates the first hole that is big enough. Searching can either begin at the beginning of the set of holes or where the last first-f

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