Data Communications II, Autumn 2003
Problem set 4 (15.10.2003)
Consider one sender and 32 receivers. Suppose the sender is connected to the receivers through a binary tree of routers. The sender is the root and the receivers are the leaves in the tree and in each node between has a router. The sender sents a packet first to the next router, that sends it to the router below etc until the packet reaches the the receiver.
Suppose node C is chosen as the center in a center-based multicast routing algorithm. Assuming that each attached router in the multicast group (= A, B, E and F) uses its least-cost path to node C, show the resulting center-based multicast routing tree. Is the resulting tree a minimum-cost Steiner tree?
1 1 B ------------ D ------------ E | . .| | . . | | . . | | . 2 2 . | 4 | . . | 1 | . . | | . . | | . . | | . . | A -------- C --------------- F 3 2
Supposing that in the net of the previous problem the cost of the link BC becomes fivefold, that is changes to 10. Find the Steiner tree that connects all the nodes A, B, E and F belonging to the group. It is not necessary to use the Steiner tree construction algorithm. It is enough to inspect the net in order to find the Steiner tree.
Consider the network below. Supposing that the link costs are equal on all links, what kind of "reverse path forwarding" -tree would you make for node F? How is this tree actually formed? When node F sends a broadcast packet, how many packets are really sent in the subnetwork?
B --------------------------------------------- C | | E -----|---------------------------- A | | | | | | | | | H -----|------------ I ------------- F --------------- D | | | . | | L | . | | . | . | | . | . | | . | . | | . | . | | . | . | |. | . | K -------- M ------- N -- O -- J --------------------- G