09/11/2020

Distributed Algorithms - 83453 - Homework 1

due: 26/11/2020

1) Assume we are given a network G and a Tree T with a root. The root begins
with m items {I1, …, Im} of size O(log n) each, that it needs to deliver to the
parties. Each item is designated to a single party, Ii = (partyi, valuei )
(each party might get zero or more items).

a. Show a synchronous-CONGEST algorithm that delivers all items in

time O(m + depth(T ))
b. Prove that Ω(Depth(T )) time is required.
c. Prove that Ω(m) time is required in the worst case. Describe this case.

2) Complete the proof of Slide 10 in Presentation 2.

I.e., prove the correctness of the asynchronous BFS algorithm shown in class.

3) A 2-approximation of a function f : G → ℝ, is an algorithm that computes a

1
value g ∈ ℝ such that for any graph G we get that f (G ) ≤ g ≤ 2f (G ).
2

Show how to compute a 2-approximation of the Diameter of G in time O(D).

(You can assume a designated node r that begins the computation)

Bar–Ilan University | Ramat–Gan, 5290002 | Israel

‫ | ישראל‬5290002 ‫ מיקוד‬,‫אילן | רמת גן‬-‫אוניברסיטת בר‬
4) In class we saw a proof that Ω(m) is a lower bound on the messages any
broadcast algorithm sends, by showing G and G’ in which we replaced an edge
(u,v) by (u,u’) and (v,v’). As pointed out by Or, there was a flaw in the proof,
which we will now correct.

Recall the model: Congest; synchronous; nodes have IDs; a node knows only
its own ID but not the IDs of its neighbors; node v sees d eg(v) ports, numbered
{1,2,…,d eg(v)} to which it can send messages and from which it receives
messages.
There is a unique initiator node s that holds a message to be broadcast.

For a graph G=(V,E) define the graph G’=(V’,E’) to be exactly like G giving
different names to the nodes (i.e., if v ∈ V then v′ ∈ V′, and if (u, v) ∈ E then
(u′, v′) ∈ G′). Note that | V | = | V′| , | E | = | E′| . Let G̃ = G ∪ G′ the be the graph
that contains both G and G’. Note that s′ ∈ G̃ is a not an initiator.

For any e = (u, v) ∈ | E | define a new graph G e = (V e, E e ) to be exactly like G̃

except for these changes: delete the edges e = (u, v), e′ = (u′, v′) and add the
edges (u, v′), (v, u′). Note that, for any e, the graph G e is connected (while G̃ is
not).

4.1) For this part only let G be a clique with 3 nodes V = {s,1,2}.
Draw G̃ and G (1,2).

4.2) Prove the following Lemma 1:

If a broadcast algorithm B sends no message over either e and e′ when
executed over G̃, then B fails to work over G e.

4.3) Prove the following Lemma 2:

If B is a broadcast algorithm with message complexity < m/4, then there must
exist an edge e ∈ E such that when B runs on G̃ it sends no message on either
e and e′.

4.4) conclude that any broadcast protocol in this model has message
complexity Ω(m).

Bar–Ilan University | Ramat–Gan, 5290002 | Israel

‫ | ישראל‬5290002 ‫ מיקוד‬,‫אילן | רמת גן‬-‫אוניברסיטת בר‬