Consider a network in which all nodes are connected to three other nodes. Ina single
Chapter 4, Problem P52(choose chapter or problem)
Consider a network in which all nodes are connected to three other nodes. Ina single time step, a node can receive all transmitted broadcast packets fromits 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, neighboringnodes can receive, duplicate, and forward these packets, and so on. Supposethat uncontrolled flooding is used to provide broadcast in such anetwork. At time step t, how many copies of the broadcast packet will betransmitted, assuming that during time step 1, a single broadcast packet istransmitted by the source node to its three neighbors.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer