Question: 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
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?
the answer is 34 but i don't know why can you please explain in detail. how the answer is 34. thank you
CIRCUIT SWITCHING Consider the circuit-switched network shown in the figure below, with circuit switches A, B, C, and D. Suppose there are 20 circuits between A and B, 15 circuits between B and C, 15 circuits between C and D, and 17 circuits between D and A. A 20 circuits B MEI 17 circuits 15 circuits MEN D 15 circuits
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
