LIANG, Qingzhong
Question 1:
1) Let n denote the number of notes
n=d 2
d
2) Let m denote the number of edges
m=3 d 2d 1
3) If n > 2, In a HyperRing with n nodes, each node has 3 degree.
4) since each node has only 3 links, they are left,right,i (i means t

The Model & Basic Computations
Chapter 1 and 2
The Model
Broadcast
Spanning Tree Construction
Traversal
Wake-up
Spanning Tree Construction
A spanning tree T of a graph G = (V,E) is an
acyclic subgraph of G such that T=(V,E')
and E' E.
Assumptions:
single

Paola Flocchini
The Model & Basic Computations
Chapter 1 and 2
The Model
Broadcast
Spanning Tree Construction
Traversal
Wake-up
Paola Flocchini
Distributed Environment
Multiplicity
Autonomy
clock
memory
1+2 =3
computing capabilities
Interaction
Paola Floc

Leader Election
Chapter 3
Observations
Election in the Ring
Election in the Mesh
Election in the Hypercube
Election in an arbitrary graph
Election
Theorem [Angluin 80]
The election problem cannot be generally solved if
the entities do not have different i

Paola Flocchini
Election in the Complete Graph
3
6
8
2
1
5
7
4
Paola Flocchini
Trivial Algorithm.
Ask neighbours one at a time
3
2
I am 1
You win
1
5
7
6
Paola Flocchini
1
Paola Flocchini
Trivial Algorithm.
Ask neighbours one at a time
2
3
1
5
7
6
Paola F

Election in Arbitrary Networks
Mega-Merger
Yo-Yo
Some Considerations
Paola Flocchini
Election in Arbitrary Networks
(Gallager, Humblet, Spira 84)
The Mega-Merger
In general networks, the election problem and the
spanning tree construction problem are equi

TEST
1h20m - Closed Books
In the test there will be some short answer questions and some open questions requiring longer
explanations. For the short answer questions, make sure you answer precisely and correctly but
isn a concise way; for example, if th