Download presentation
Presentation is loading. Please wait.
1
ETH Zurich – Distributed Computing Group Stephan HolzerETH Zurich – Distributed Computing – www.disco.ethz.ch Stephan Holzer - ETH Zürich Thomas Locher - ABB Switzerland Yvonne Anne Pignolet - ABB Switzerland Roger Wattenhofer - ETH Zürich TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AAAA A A AA AA Deterministic Multi-Channel Information Exchange
2
ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange Problem : n:= # nodes
3
ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange Problem : n:= # nodes k:= # information Have information Disseminate to all! ?
4
ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange Problem : Disseminate to all! ?
5
ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange Problem : Disseminate to all! ?
6
ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange Problem : n:= # nodes 1 2 3 4 5 n Unique IDs 1…n
7
ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange Problem : Disseminate to all! ? Easy: O(n) Faster?
8
ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange I can: send / receive reach each node
9
ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange I can: send / receive ? reach each node
10
ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange no collision detection I can: send / receive reach each node
11
ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange switch channels no collision detection I can: send / receive reach each node 101 Mhz 117 Mhz 132 Mhz … synchronus
12
ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange switch channels no collision detection I can: send / receive reach each node complexity computation: free radio: time 1 synchronus
13
ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange n:= # nodes k:= # information TimeChannels [GW85]:Ω(k + log n)1 k
![ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange n:= # nodes k:= # information TimeChannels [GW85]:Ω(k + log n)1 k](http://images.slideplayer.com/47/11690858/slides/slide_13.jpg "ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange n:= # nodes k:= # information TimeChannels [GW85]:Ω(k + log n)1 k")
14
ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange n:= # nodes k:= # information k TimeChannels [GW85]:Ω(k + log n)1 [HPSW11]:O(k)n k
![ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange n:= # nodes k:= # information k TimeChannels [GW85]:Ω(k + log n)1 [HPSW11]:O(k)n k](http://images.slideplayer.com/47/11690858/slides/slide_14.jpg "ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange n:= # nodes k:= # information k TimeChannels [GW85]:Ω(k + log n)1 [HPSW11]:O(k)n k")
15
ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange n:= # nodes k:= # information k TimeChannels [GW85]:Ω(k + log n)1 [HPSW11]:O(k)n Optimal k
![ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange n:= # nodes k:= # information k TimeChannels [GW85]:Ω(k + log n)1 [HPSW11]:O(k)n Optimal k](http://images.slideplayer.com/47/11690858/slides/slide_15.jpg "ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange n:= # nodes k:= # information k TimeChannels [GW85]:Ω(k + log n)1 [HPSW11]:O(k)n Optimal k")
16
ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange n:= # nodes k:= # information k TimeChannels [GW85]:Ω(k + log n)1 [HPSW11]:O(k)n Optimal ???? k
![ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange n:= # nodes k:= # information k TimeChannels [GW85]:Ω(k + log n)1 [HPSW11]:O(k)n Optimal .](http://images.slideplayer.com/47/11690858/slides/slide_16.jpg "k.")
17
ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange n:= # nodes k:= # information Range of k[log n, n] Upper bound On channels 1 [HPSW11] - Channels needed for time O(k):
![ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange n:= # nodes k:= # information Range of k[log n, n] Upper bound On channels 1 [HPSW11] - Channels needed for time O(k):](http://images.slideplayer.com/47/11690858/slides/slide_17.jpg "ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange n:= # nodes k:= # information Range of k[log n, n] Upper bound On channels 1 [HPSW11] - Channels needed for time O(k):")
18
ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange n:= # nodes k:= # information Range of k[log n, n] Upper bound On channels 1 [HPSW11] - Channels needed for time O(k): Range of k[1, log n](log n, log n loglog n) [log n loglog n, n- log n) [n – log n, n] Upper bound On channels 1 This paper:
![ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange n:= # nodes k:= # information Range of k[log n, n] Upper bound On channels 1 [HPSW11] - Channels needed for time O(k): Range of k[1, log n](log n, log n loglog n) [log n loglog n, n- log n) [n – log n, n] Upper bound On channels 1 This paper:](http://images.slideplayer.com/47/11690858/slides/slide_18.jpg "ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange n:= # nodes k:= # information Range of k[log n, n] Upper bound On channels 1 [HPSW11] - Channels needed for time O(k): Range of k[1, log n](log n, log n loglog n) [log n loglog n, n- log n) [n – log n, n] Upper bound On channels 1 This paper:")
19
ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange n:= # nodes k:= # information Range of k[log n, n] Upper bound On channels 1 [HPSW11] - Channels needed for time O(k): Range of k[1, log n](log n, log n loglog n) [log n loglog n, n- log n) [n – log n, n] Upper bound On channels 1 This paper: randomized
![ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange n:= # nodes k:= # information Range of k[log n, n] Upper bound On channels 1 [HPSW11] - Channels needed for time O(k): Range of k[1, log n](log n, log n loglog n) [log n loglog n, n- log n) [n – log n, n] Upper bound On channels 1 This paper: randomized](http://images.slideplayer.com/47/11690858/slides/slide_19.jpg "ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange n:= # nodes k:= # information Range of k[log n, n] Upper bound On channels 1 [HPSW11] - Channels needed for time O(k): Range of k[1, log n](log n, log n loglog n) [log n loglog n, n- log n) [n – log n, n] Upper bound On channels 1 This paper: randomized")
20
ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange n:= # nodes k:= # information Range of k[log n, n] Upper bound On channels 1 [HPSW11] - Channels needed for time O(k): Range of k[1, log n](log n, log n loglog n) [log n loglog n, n- log n) [n – log n, n] Upper bound On channels 1 This paper: randomized deterministic
![ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange n:= # nodes k:= # information Range of k[log n, n] Upper bound On channels 1 [HPSW11] - Channels needed for time O(k): Range of k[1, log n](log n, log n loglog n) [log n loglog n, n- log n) [n – log n, n] Upper bound On channels 1 This paper: randomized deterministic](http://images.slideplayer.com/47/11690858/slides/slide_20.jpg "ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange n:= # nodes k:= # information Range of k[log n, n] Upper bound On channels 1 [HPSW11] - Channels needed for time O(k): Range of k[1, log n](log n, log n loglog n) [log n loglog n, n- log n) [n – log n, n] Upper bound On channels 1 This paper: randomized deterministic")
21
ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange n:= # nodes k:= # information Range of k[log n, n] Upper bound On channels 1 [HPSW11] - Channels needed for time O(k): Range of k[1, log n](log n, log n loglog n) [log n loglog n, n- log n) [n – log n, n] Upper bound On channels 1 This paper: randomized deterministic Optimal?
![ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange n:= # nodes k:= # information Range of k[log n, n] Upper bound On channels 1 [HPSW11] - Channels needed for time O(k): Range of k[1, log n](log n, log n loglog n) [log n loglog n, n- log n) [n – log n, n] Upper bound On channels 1 This paper: randomized deterministic Optimal](http://images.slideplayer.com/47/11690858/slides/slide_21.jpg "ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange n:= # nodes k:= # information Range of k[log n, n] Upper bound On channels 1 [HPSW11] - Channels needed for time O(k): Range of k[1, log n](log n, log n loglog n) [log n loglog n, n- log n) [n – log n, n] Upper bound On channels 1 This paper: randomized deterministic Optimal")
22
ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange n:= # nodes k:= # information Range of k[log n, n] Upper bound On channels 1 [HPSW11] - Channels needed for time O(k): Range of k[1, log n](log n, log n loglog n) [log n loglog n, n- log n) [n – log n, n] Upper bound On channels 1 Lower bound On channels 1 This paper: randomized deterministic k
![ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange n:= # nodes k:= # information Range of k[log n, n] Upper bound On channels 1 [HPSW11] - Channels needed for time O(k): Range of k[1, log n](log n, log n loglog n) [log n loglog n, n- log n) [n – log n, n] Upper bound On channels 1 Lower bound On channels 1 This paper: randomized deterministic k](http://images.slideplayer.com/47/11690858/slides/slide_22.jpg "ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange n:= # nodes k:= # information Range of k[log n, n] Upper bound On channels 1 [HPSW11] - Channels needed for time O(k): Range of k[1, log n](log n, log n loglog n) [log n loglog n, n- log n) [n – log n, n] Upper bound On channels 1 Lower bound On channels 1 This paper: randomized deterministic k")
23
ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange Main ingredient: Specially taylored graphs.
24
ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange Main ingredient: Specially taylored graphs. (Inspired by use of lossless expanders in [CK08])
25
ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange Main ingredient: Specially taylored graphs. (Inspired by use of lossless expanders in [CK08]) Topology: Still single hop. Graphs used to select channel.
26
ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange 7 6 5 4 3 2 1 Bipartite : node IDs new names
27
ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange 7 6 5 4 3 2 1 Bipartite : node IDs new names
28
ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange
29
ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange
30
ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange
31
ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange 7 6 5 4 3 2 1 i i have unique i-neighbor
32
ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange 7 6 5 4 3 2 1 i i have unique i-neighbor
33
ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange 7 6 5 4 3 2 1 1 1 1 2 1 2 2 2
34
ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange 7 6 5 4 3 2 1 1 1 1 2 1 2 2 2 X
35
ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange 7 6 5 4 3 2 1 1 1 1 1 X
36
ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange 7 6 5 4 3 2 1 1 1 1 1 X BAD
37
ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange 7 6 5 4 3 2 1 1 1 1 2 1 2 2 2 X
38
ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange 7 6 5 4 3 2 1 2 2 2 2 X
39
ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange 7 6 5 4 3 2 1 2 2 2 2 X GOOD
40
ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange 7 6 5 4 3 2 1 1 1 1 1 X
41
ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange 7 6 5 4 3 2 1 1 1 1 1 X
42
ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange 7 6 5 4 3 2 1 1 1 1 2 1 2 2 2
43
ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange What are these graphs good for?
44
ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange What are these graphs good for? Renaming
45
ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange What are these graphs good for? Renaming 7 6 5 4 3 2 1 1 1 1 2 1 2 2 2
46
ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange 7 6 5 4 3 2 1 1 1 1 2 1 2 2 2
47
ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange What is renaming good for?
48
ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange What is renaming good for? Assignment of reporters to channels!
49
ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange What is renaming good for? Assignment of reporters to channels! Example: k < log n
50
ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange What is renaming good for? Assignment of reporters to channels! Example: k < log n n Original names
51
ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange What is renaming good for? Assignment of reporters to channels! Example: k < log n n Original names New names of reporters
52
ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange n Original names New names of reporters
53
ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange n:= # nodes k:= # information n Original names New names of reporters
54
ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange n:= # nodes k:= # information Time: O( k ) n Original names New names of reporters
55
ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange n:= # nodes k:= # information n Original names New names of reporters
56
ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange n:= # nodes k:= # information n Original names New names of reporters
57
ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange n:= # nodes k:= # information n Original names New names of reporters
58
ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange n:= # nodes k:= # information n Original names New names of reporters
59
ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange n:= # nodes k:= # information
60
ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange n:= # nodes k:= # information Example: 3 channels
61
ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange n:= # nodes k:= # information Channel 3 Example: 3 channels Channel 1
62
ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange n:= # nodes k:= # information Channel 3 Example: 3 channels Channel 1 Send 2 times
63
ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange n:= # nodes k:= # information Channel 3 Example: 3 channels Channel 1 Send 2 times
64
ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange n:= # nodes k:= # information Channel 3 Example: 3 channels Channel 1 Send 2 times
65
ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange n:= # nodes k:= # information Channel 3 Example: 3 channels Channel 1 Send 2 times
66
ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange n:= # nodes k:= # information Unique Subset Channel 3 Example: 3 channels Channel 1 Send 2 times
67
ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange n:= # nodes k:= # information Unique Subset Channel 3 Example: 3 channels Channel 1 Send 2 times
68
ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange n:= # nodes k:= # information Unique Subset Channel 3 Example: 3 channels Channel 1 Send 2 times
69
ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange Unique Subset Channel 3 Example: 3 channels Channel 1 Send k times O( k ) n:= # nodes k:= # information
70
ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange O( k ) Range of k[1, log n](log n, log n loglog n) [log n loglog n, n- log n) [n – log n, n] Upper bound On channels 1 Lower bound On channels 1
 [log n loglog n, n- log n) [n – log n, n] Upper bound On channels 1 Lower bound On channels 1](http://images.slideplayer.com/47/11690858/slides/slide_70.jpg "ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange O( k ) Range of k[1, log n](log n, log n loglog n) [log n loglog n, n- log n) [n – log n, n] Upper bound On channels 1 Lower bound On channels 1")
71
ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange n Original names New names of reporters
72
ETH Zurich – Distributed Computing Group Stephan Holzer Deterministic Multi-Channel Information Exchange in Summary … Detect / Disseminate Information! 101 Mhz 117 Mhz 132 Mhz … 7 6 5 4 3 2 1 1 1 1 2 1 2 2 2 X Range of k[1, log n](log n, log n loglog n) [log n loglog n, n- log n) [n – log n, n] Upper bound On channels 1 Lower bound On channels 1
73
ETH Zurich – Distributed Computing Group Stephan HolzerETH Zurich – Distributed Computing – www.disco.ethz.ch Stephan Holzer - ETH Zürich Thomas Locher - ABB Switzerland Yvonne Anne Pignolet - ABB Switzerland Roger Wattenhofer - ETH Zürich Thank You! Questions & Comments? TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AAAA A A A
74
ETH Zurich – Distributed Computing Group Stephan HolzerETH Zurich – Distributed Computing – www.disco.ethz.ch Stephan Holzer - ETH Zürich Thomas Locher - ABB Switzerland Yvonne Anne Pignolet - ABB Switzerland Roger Wattenhofer - ETH Zürich Thank You! Questions & Comments? TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AAAA A A A
Similar presentations
