1. A switching network has the following parameters and values:

N = number of hops between two given end systems = 4

L = message length in bits = 3200

B = data rate, in bits per second, on all links = 9600

P = Packet size (includes header) = 1024

H = Header bits per packet = 16

S = Call setup time for circuit switching and virtual circuit = 0.2 seconds

D = Propagation delay per hop = 0.001 seconds

Compute the end-to-end delay, assuming there are no acknowledgments, for

1. circuit switching
2. datagram packet switching
3. virtual circuit packet switching.

1. Given below is the 6x6 central routing table discussed in class that gives the neighboring node for each pair of source-destination nodes.

1. Complete the matrix by determining:the best path for source nodes B, C and D using Dijkstra ‘s algorithm
2. In each case, show the shortest path (least cost) routing table and the final configuration.

1. For Problem 2,

1. Complete the matrix by determining the best path for source nodes E and F using Bellman-Ford algorithm.
2. In each case, show the shortest path (least cost) routing table and the final configuration.