Computational models.
The standard model that imposes restrictions on the bandwidth over the above setting is the \(\mathsf {CONGEST}\)  model [1]}. This is a synchronous model, in which each of \(n\)  nodes can send a message to each of its neighbors in every round, where the size of messages is bounded by \(O(\log {n})\)  bits. This choice of this bound on the size of messages allows sending a node identifier within a single message. Typically, the graph that is processed is the graph that underlies the communication network.
