IN JAVA PLEASE! (caravan analogy provided). Follow instructions! -------------------------------------------------------

[answerhappygod]

IN JAVA PLEASE! (caravan analogy provided). Follow instructions!

In Java Please Caravan Analogy Provided Follow Instructions 1 (95.09 KiB) Viewed 19 times

------------------------------------------------------------------caravan analogy-------------------------------------------------------------------

In Java Please Caravan Analogy Provided Follow Instructions 2 (106.14 KiB) Viewed 19 times

CS450 Topic 1 Programming Assignment Based on the caravan analogy presented in the textbook reading assignment, develop a program that can compute the total delay of a caravan from an initial tollgate (sending node), through an intermediate toll gate (transfer node), and to and through the last toll gate (ending node). Create an interface that prompts the user for the following inputs and then provides the outputs below: Inputs: The number of toll gates on the route The processing delay thru each toll gate (don't assume the delays are all the same for each toll booth) The highway speed limit The number of cars in the caravan Outputs: An echo of the input data • The total time it takes the caravan to complete the journey The program should be a console application (a fancy GUI is not required) and coded in Java (or optionally C++ or Python). Use the provided template program in your textbook as a starting point. This assignment will be scored using the course programming rubric.
An analogy might clarify the notions of transmission and propagation delay. Consider a highway that has a tollbooth every 100 kilometers, as shown in Figure 1.170. You can think of the highway segments between tollbooths as links and the tollbooths as routers. Suppose that cars travel (that is, propagate) on the highway at a rate of 100 km/hour (that is, when a car leaves a tollbooth, it instantaneously accelerates to 100 km/hour and maintains that speed between tollbooths). Suppose next that 10 cars, traveling together as a caravan, follow each other in a fixed order. You can think of each car as a bit and the caravan as a packet. Also suppose that each tollbooth services (that is, transmits) a car at a rate of one car per 12 seconds, and that it is late at night so that the caravan's cars are the only cars on the highway. Finally, suppose that whenever the first car of the caravan arrives at a tollbooth, it waits at the entrance until the other nine cars have arrived and lined up behind it. (Thus, the entire caravan must be stored at the tollbooth before it can begin to be forwarded.) The time required for the tollbooth to push the entire caravan onto the highway is (10 cars)/(5 cars/minute) = 2 minutes. This time is analogous to the transmission delay in a router. The time required for a car to travel from the exit of one tollbooth to the next tollbooth is 100 km/(100 km/hour) = 1 hour. This time is analogous to propagation delay. Therefore, the time from when the caravan is stored in front of a tollbooth until the caravan is stored in front of the next tollbooth is the sum of transmission delay and propagation delay in this example, 62 minutes. Figure 1.17 Caravan analogy Ten-car caravan Toll booth -100 km Toll booth -100 km