TCP: TCP stands for Transmission Control protocol. It is the most prominent used protocol on the internet. Establishing a path between the source and the destination represents the connection steering noted as the reliable service for sending message provided by TCP. For example: If man A sends a message to man B, then man B acknowledges that messages and sent the acknowledgement to man A, then another acknowledgement comes from man A to man B. UDP: UDP stands for User Datagram protocol. It is also one of the most prominent used protocols on the internet. It generally provides unreliable service of sending messages. For example: If man A sends a message to man B, but here the man A is not confirmed that does the man B has received his message or not. In this kind of protocol, message can take any path to reach its destination, there is no specific route for the transfer of message also there could be a possibility of losing message on the way of transfer.

Question

Want to see the full answer?

Answer 1

Question

Chapter 4, Problem 43CRP

Program Plan Intro

TCP:

TCP stands for Transmission Control protocol. It is the most prominent used protocol on the internet. Establishing a path between the source and the destination represents the connection steering noted as the reliable service for sending message provided by TCP.

For example: If man A sends a message to man B, then man B acknowledges that messages and sent the acknowledgement to man A, then another acknowledgement comes from man A to man B.

UDP:

UDP stands for User Datagram protocol. It is also one of the most prominent used protocols on the internet. It generally provides unreliable service of sending messages.

For example: If man A sends a message to man B, but here the man A is not confirmed that does the man B has received his message or not. In this kind of protocol, message can take any path to reach its destination, there is no specific route for the transfer of message also there could be a possibility of losing message on the way of transfer.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

solve this questions for me .

a) first player is the minimizing player. What move should be chosen?b) What nodes would not need to be examined using the alpha-beta pruning procedure?

Consider the problem of finding a path in the grid shown below from the position S to theposition G. The agent can move on the grid horizontally and vertically, one square at atime (each step has a cost of one). No step may be made into a forbidden crossed area. Inthe case of ties, break it using up, left, right, and down.(a) Draw the search tree in a greedy search. Manhattan distance should be used as theheuristic function. That is, h(n) for any node n is the Manhattan distance from nto G. The Manhattan distance between two points is the distance in the x-directionplus the distance in the y-direction. It corresponds to the distance traveled along citystreets arranged in a grid. For example, the Manhattan distance between G and S is4. What is the path that is found by the greedy search?(b) Draw the search tree in an A∗search. Manhattan distance should be used as the