Repeatedly sending packets via the same connection between two hosts is technically possible. List the factors that contribute to the total time it takes for a single packet to go from beginning to finish. Is it expected that one of the delays would last a certain period of time and the other delay's length will be more variable?

Please draw a flow diagram

Write a Java TCP MultipleClient-Server Program for following scenario.   NOTE Server Details are in the above figure Client-Server communicates continuously until the Client send Bye to the Server Use Multithreading for Multiple Clients NOTE : 1 cm =  0.39 inches 1 cm =  0.03 foot 1 cm =  0.01 meter   Sample Ouput: Client Server 1 – cm to inches 2 – cm to foot 3 – cm to meter Enter length in cms (int) : 10 Received from Server 3.9 inches   1 – cm to inches 2 – cm to foot 3 – cm to meter Enter length in cms (int) : BYE Received from Server BYE   Client DISCONNECTED Server Waiting for the Cline to be Connected… CONECTION ESTABLISHED   Received From Client 10 cms Sent to Client 3.9 inches   Received From Client BYE Sent to Client BYE     HINT : When client choses 1 for cm to inches and enter 10, then the client sends the string 110 to the Server. Where the first char ‘1’ represents the cm to inches and the other 2 chars represents the 10.

TCP congestion control example. Consider the figure below, where a TCP sender sends 8 TCP segments at t = 1, 2, 3, 4, 5, 6, 7, 8. Suppose the initial value of the sequence number is 0 and every segment sent to the receiver each contains 100 bytes. The delay between the sender and receiver is 5 time units, and so the first segment arrives at the receiver at t = 6. The ACKs sent by the receiver at t = 6, 7, 8, 10, 11, 12 are shown. The TCP segments (if any) sent by the sender at t = 11, 13, 15, 16, 17, 18 are not shown. The segment sent at t=4 is lost, as is the ACK segment sent at t=7. TCP sender t=1 T t=2 t=3 t=4+ t=5- t=6+ t=11 t=12 t=13 t=14 t=15 t=16 t=17 t=18 I data segment data segment data segment data segment data segment data segment data segment data segment ACK ACK ACK ACK ACK ACK Ty A A V V htt TCP receiver t=6 t=7 t=8 t=9 t=10 t=11 t=12 t=13 What does the sender do at t=17? You can assume for this question that no timeouts have occurred.

It is possible to send many packets from one host to another using the same connection. Please break down the time it takes for a single package to go from beginning to conclusion. Is there going to be one delay that takes a certain length of time and another that varies?

A TCP connection is established through 10 wireless hops in an acoustic underwater ad hoc network. Assume that each hop is 100 meter in the average, acoustic signals travel 1500 meter per second, 10 kilobit data can be sent per second over a link, the source node has one megabyte of data to send, the receiver window size is 64 kilobytes, the maximum segment size is 1 kilobyte and the average processing delay for routing at each node is one millisecond. Assume also that the following segments do not reach the destination: 67, 112, 137. What would be the average utilization of the links for this connection if there is not another communications through them? Explain an alternative approach to increase the bandwidth utilization?

A connection that connects two hosts may transport many packets at the same time. Please break down how much time is spent on each step of the processing of a freight load for me. Should the duration of one delay be predetermined, while the other delay's time might be flexible, depending on the situation?

To ensure the quality of service, especially for multiple applications, regulating the rate at which packets are sent to the network is an important strategy. The leaky bucket is just one of such mechanisms. A flow of packets is said to conform to the leaky bucket specification (r, b), where r is the average rate and b is the burst rate, if the number of packets arriving at the leaky bucket is less than r*t + b in every time interval of t.  What is the implication of that? What will happen if the number of packets arriving at the leaky bucket is equal to or greater than r*t + b?

Give a simple heuristic for finding two paths through a network from a given source to a given destination that can survive the loss of any communication line (assuming two such paths exist). The routers are considered reliable enough, so it is not necessary to worry about the possibility of router crashes.

A host-to-host connection may transport a large number of packets. Please provide me with a breakdown of items load processing time. Should the duration of one delay be set while the length of the other be variable?