le/PostsAttach/10617 1870 1.pdf life sending P such packets back-to-back over the N links. P3. Consider an application that transmits data at a steady rate (for example, the sender generates an N-bit unit of data every k time units, where k is small and fixed). Also, when such an application starts, it will continue running for a relatively long period of time. Answer the following questions, briefly justi- a. Would a packet-switched network or a circuit-switched network be more b. Suppose that a packet-switched network is used and the only traffic in fying your answer: appropriate for this application? Why? this network comes from such applications as described above. Further- more, assume that the sum of the application data rates is less than the capacities of each and every link. Is some form of congestion control needed? Why? P4. Consider the circuit-switched network in Figure 1.13. Recall that there are 4 circuits on each link. Label the four switches A, B, C and D, going in the clockwise direction. a. What is the maximum number of simultaneous connections that can be in progress at any one time in this network? b. Suppose that all connections are between switches A and C. What is the c. Suppose we want to make four connections between switches A and C PS. Review the car-caravan analogy in Section 1.4. Assume a propagation speed maximum number of simultaneous connections that can be in progress? and another four connections between switches B and D. Can we route these calls through the four links to accommodate all eight connections? of 100 km/hour. a. Suppose the caravan travels 150 km, beginning in front of one tollbooth, passing through a second tollbooth, and finishing just after a third toll- booth. What is the end-to-end delay? b. Repeat (a), now assuming that there are eight cars in the caravan instead of ten