CS447/CS642 Homework Set 6 Winter 2001

Due: Tuesday, March 5

  1. 2 network stations are separated by 4 hops. Data rate is 9600 bps, packets are 1024 bits, including 16 bits of overhead. Propagation delay is 0.001 seconds per hop. Find the Total Delay (including all 1-way propagation, transmission and forwarding delays) for a 3200-bit message using the network as a Packet Switched network.

  2. For the network in question 1, find the total delay for the same message using the network as a Virtual Circuit network with call setup time of 0.2 seconds. Assume that bits are transferred individually among nodes.

    ABCDE
    F--2-4
    E-121
    D4--
    C-3
    B1

  3. Use Dijkstra's (Link-State) algorithm to create B's routing table for the network with (symmetric) link costs shown in the table at the right. List your routing table entries in the order in which the algorithm adds them to the "confirmed" list, INSTEAD OF listing them alphabetically. (In case of a tie, "confirm" the alphabetically earliest node.)

  4. In the network of the preceding question, neglecting link costs, how many packets are generated by flooding a packet from node A with a hop count of 5? Assume that nodes use only the hop count to decide whether or not to flood an incoming packet.

Home Page