Assume we have a network with N nodes and E edges. Assume that all links (i.e. e
ID: 658549 • Letter: A
Question
Assume we have a network with N nodes and E edges. Assume that all links (i.e. edges)
are point-to-point links. Assume one node, say p, creates a broadcast message (which of
course is sent throughout the network). For a specific link, say (x; y), between two nodes
x and y, what is the maximum number of copies of this message that will be sent over the
link? BRIEFLY explain why only this many.
(b) Again, as in (a), we have a network with N nodes and E edges, and p performs a broadcast.
EXACTLY how many copies of the broadcast message of p will exist in the network?
BRIEFLY explain why.
(c) The code for broadcast is below, but incomplete. Complete the final action.
process p
inp
N : set {x | x neighbor of p}
var
d : array [PID] of integer,
ts : array[PID] of integer,
q,v,t : integer,
begin
when true then
d[p] := any;
ts[p]:= ts[p]+1;
for each g in N do
send bc(p, d[p], ts[p]) to g;
end for
for each g in N do
when receive bc(q, v, t) from g then
{complete this part}
end
Explanation / Answer
Broadcasting is the transmission of messages to all the nodes in the network. In a network of N nodes, if one node wants to broadcast a message it has to send all to all the other N