Interactive end-of-chapter exercises


Circuit Switching

Consider the circuit-switched network shown in the figure below, with circuit switches A, B, C, and D. Suppose there are 16 circuits between A and B, 12 circuits between B and C, 10 circuits between C and D, and 18 circuits between D and A.



Question List


1. What is the maximum number of connections that can be ongoing in the network at any one time?

2. Suppose that these maximum number of connections are all ongoing. What happens when another call connection request arrives to the network, will it be accepted? Answer Yes or No

3. Suppose that every connection requires 2 consecutive hops, and calls are connected clockwise. For example, a connection can go from A to C, from B to D, from C to A, and from D to B. With these constraints, what is the is the maximum number of connections that can be ongoing in the network at any one time?

4. Suppose that 16 connections are needed from A to C, and 20 connections are needed from B to D. Can we route these calls through the four links to accommodate all 36 connections? Answer Yes or No




Solution


1. The maximum number of connections that can be ongoing at any one time is the sum of all circuits, which happens when 16 connections go from A to B, 12 connections go from B to C, 10 connections go from C to D, and 18 connections go from D to A. This sum is 56.

2. No, it will be blocked because there are no free circuits.

3. There can be a maximum of 26 connections. Consider routes A->C and C->A, sum the bottleneck links, consider any leftover capacity that would allow for B->D and D->B connections, and compare that value to the equivalent of B->D and D->B.

4. Using our answer from question 4, the sum of our needed connections is 36, and we have 26 available connections, so it is NOT possible.



That's incorrect

That's correct

The answer was: 56

Question 1 of 4

The answer was: No

Question 2 of 4

The answer was: 26

Question 3 of 4

The answer was: No

Question 4 of 4

Try Another Problem

We gratefully acknowledge the programming and problem design work of John Broderick (UMass '21), which has really helped to substantially improve this site.

Copyright © 2010-2022 J.F. Kurose, K.W. Ross
Comments welcome and appreciated: kurose@cs.umass.edu