Kurose Ross Chapter 5 Q 52

Question

P52. Consider a network in which all nodes are connected to three other nodes. In
a single time step, a node can receive all transmitted broadcast packets from
its neighbors, duplicate the packets, and send them to all of its neighbors
(except to the node that sent a given packet). At the next time step, neighboring
nodes can receive, duplicate, and forward these packets, and so on. Suppose that uncontrolled flooding is used to provide broadcast in such a
network. At time step t, how many copies of the broadcast packet will be
transmitted, assuming that during time step 1, a single broadcast packet is
transmitted by the source node to its three neighbors.
 

Answer 1

Here u will get ternary tree

There will be root node having three children

Then this nodes will have 2 children( 2 because it already connected to it parent node)

 At step 1 3 packet

At step 2 3*2=6 packet

At step 3 6*2=12 packet

So at step t  =3×2^t-1

Comments

each node is connected to three other node...does it means that the parent node would not be counted and if counted then only 2 packets should be transmitted at level 2 by each node as one would have been sending it..??

---

ll transmitted broadcast packets from
its neighbors, duplicate the packets, and send them to all of its neighbors
(except to the node that sent a given packet)

Packets never go back ! It seem to me like that, Pooja, what is your logic ?