![Page 1: Improved Bounds for Minimum Fault-Tolerant Gossip Graphs](https://reader036.vdocument.in/reader036/viewer/2022062315/5681652e550346895dd7b3c7/html5/thumbnails/1.jpg)
Improved Bounds for Minimum Fault-Tolerant Gossip Graphs
Toru Hasunuma1 and Hiroshi Nagamochi2
1 Institute of Socio-Arts and Sciences, The University of Tokushima
2 Department of Applied Mathematics and Physics,Kyoto University
![Page 2: Improved Bounds for Minimum Fault-Tolerant Gossip Graphs](https://reader036.vdocument.in/reader036/viewer/2022062315/5681652e550346895dd7b3c7/html5/thumbnails/2.jpg)
Contents• Introduction– Fault-Tolerant Gossiping Problem– Results
• Construction of Fault-Tolerant Gossip Graphs• Fault-Tolerant Gossip Graphs Based on Hypercubes• Fault-Tolerant Gossip Graphs Based on Circulant
Graphs• A Lower Bound• Conclusion
![Page 3: Improved Bounds for Minimum Fault-Tolerant Gossip Graphs](https://reader036.vdocument.in/reader036/viewer/2022062315/5681652e550346895dd7b3c7/html5/thumbnails/3.jpg)
Gossiping Problem• There are n persons such that each person has a unique
message.• All the n persons want to know all the n messages by
telephone.• In each telephone call, the two persons exchange every
message which they have at the time of the call.
What is the minimum number of calls?
The minimum number of calls was determined to be for .• Tijdeman [1971]• Baker and Shostak [1972]
![Page 4: Improved Bounds for Minimum Fault-Tolerant Gossip Graphs](https://reader036.vdocument.in/reader036/viewer/2022062315/5681652e550346895dd7b3c7/html5/thumbnails/4.jpg)
Fault-Tolerant Gossiping Problem• There are n persons such that each person has a unique
message.• All the n persons want to know all the n message by telephone.• In each telephone call, the two persons exchange every
message which they have at the time of the call.• At most k telephone calls fail.
– The messages in a failed call are not exchanged.
What is the minimum number of calls?
• Let be the minimum number of calls for the fault-tolerant gossiping problem on persons with at most failed calls.
![Page 5: Improved Bounds for Minimum Fault-Tolerant Gossip Graphs](https://reader036.vdocument.in/reader036/viewer/2022062315/5681652e550346895dd7b3c7/html5/thumbnails/5.jpg)
-Fault-Tolerant Gossip Graphs• The -fault tolerant gossiping problem can be modeled by a
(multiple) graph with edge-ordering .
• Define a -fault-tolerant gossip graph as an ordered graph in which for any ordered pair of distinct vertices and , there are ascending paths from to .
• The size of a -fault-tolerant gossip graph is an upper bound on
1 2 4
3
5
6
7 8 9
17
1811
13
1510
1214
16
20
19
23
24
18 2221
2533
32
31
30
2928
27 26
35
34
36An example of a 2-fault-tolerant gossip graph
![Page 6: Improved Bounds for Minimum Fault-Tolerant Gossip Graphs](https://reader036.vdocument.in/reader036/viewer/2022062315/5681652e550346895dd7b3c7/html5/thumbnails/6.jpg)
Comparison of Upper Bound ResultsPrevious Results Our Results improv
ement
Berman and Hawrylycz [1986]
Haddad et al. [1987]
Haddad et al.[1987]When is a power of two
Hou and Shigeno [2009]
![Page 7: Improved Bounds for Minimum Fault-Tolerant Gossip Graphs](https://reader036.vdocument.in/reader036/viewer/2022062315/5681652e550346895dd7b3c7/html5/thumbnails/7.jpg)
Comparison of Lower Bound Results
Previous Results Our Result Improvement
Berman and Paul [1986]
Berman and Paul[2002]
Hou and Shigeno [2009]
![Page 8: Improved Bounds for Minimum Fault-Tolerant Gossip Graphs](https://reader036.vdocument.in/reader036/viewer/2022062315/5681652e550346895dd7b3c7/html5/thumbnails/8.jpg)
Construction of Fault-Tolerant Gossip Graphs
• The general method by Haddad et al.– Cumulate the edge set of a copy of an ordered
graph iteratively.
𝐺=𝐺0
𝐸 (𝐺1)𝐸 (𝐺2)𝐸 (𝐺3)
𝐸 (𝐺h− 1)⋮ ⋮
h ∙(𝐺 ,𝜌 )
𝜌 ′ (𝑒)=𝜌 (𝑒 )+ (h−1 )∨𝐸 (𝐺 )∨¿
𝜌 ′ (𝑒)=𝜌 (𝑒 )+2∨𝐸 (𝐺 )∨¿
𝜌′ (𝑒)=𝜌 (𝑒 )+¿𝐸 (𝐺 )∨¿
𝜌′ (𝑒)=𝜌 (𝑒 )
𝜌 ′ (𝑒)=𝜌 (𝑒 )+3∨𝐸 (𝐺 )∨¿
![Page 9: Improved Bounds for Minimum Fault-Tolerant Gossip Graphs](https://reader036.vdocument.in/reader036/viewer/2022062315/5681652e550346895dd7b3c7/html5/thumbnails/9.jpg)
Folded Number
• A path from to in an ordered graph is called -folded if it is a series of (maximal) ascending paths.
• The folded number of an -folded ascending path is defined to be .
1-2-5-6 3-4-7-9 8-10-13 11-12-14 15-16-17𝑢 𝑣
-folded ascending path
![Page 10: Improved Bounds for Minimum Fault-Tolerant Gossip Graphs](https://reader036.vdocument.in/reader036/viewer/2022062315/5681652e550346895dd7b3c7/html5/thumbnails/10.jpg)
Edge-Disjoint Ascending Paths in If there is an -folded ascending path from to , then there are edge-disjoint ascending paths from to in for any integer .
P = P0 P1
P5P4
P3
P2
P6
4
7-4 = 3
3 edge-disjoint ascending path from to in
𝑢 𝑣
![Page 11: Improved Bounds for Minimum Fault-Tolerant Gossip Graphs](https://reader036.vdocument.in/reader036/viewer/2022062315/5681652e550346895dd7b3c7/html5/thumbnails/11.jpg)
Lemma 1: If there are edge-disjoint -folded ascending paths from to , then there are edge-disjoint ascending paths from to in for any integer .
𝑃 𝑃 ′𝐸 (𝑃 )∩𝐸 (𝑃 ′ )=∅
![Page 12: Improved Bounds for Minimum Fault-Tolerant Gossip Graphs](https://reader036.vdocument.in/reader036/viewer/2022062315/5681652e550346895dd7b3c7/html5/thumbnails/12.jpg)
Lemma 1: If there are edge-disjoint -folded ascending paths from to , then there are edge-disjoint ascending paths from to in for any integer .
Corollary 1: Let be an ordered graph with vertices and edges. If for any ordered pair of vertices and , there are edge-disjoint paths from to in such that their folded numbers are at most , then is a -fault-tolerant gossip graph, thus
![Page 13: Improved Bounds for Minimum Fault-Tolerant Gossip Graphs](https://reader036.vdocument.in/reader036/viewer/2022062315/5681652e550346895dd7b3c7/html5/thumbnails/13.jpg)
𝑢 𝑣
𝐺=𝐺0
𝐺4
𝐺3
𝐺2
𝐺1
5 edge-disjoint ascending paths
1 ascending path
2 edge-disjoint ascending paths
4 edge-disjoint ascending paths
3 edge-disjoint ascending paths
𝐺5 5 edge-disjoint ascending paths
⋮ ⋮
5 edge-disjoint paths from u to v 𝑃𝑐
𝑃𝑏𝑃𝑎
𝑃𝑑
𝑃𝑒 Newly created edge-disjoint ascending paths
When k =7, i.e., we need 8 edge-disjoint ascending paths , Corollary 2 consider However, it is sufficient to consider .
![Page 14: Improved Bounds for Minimum Fault-Tolerant Gossip Graphs](https://reader036.vdocument.in/reader036/viewer/2022062315/5681652e550346895dd7b3c7/html5/thumbnails/14.jpg)
𝐺=𝐺0𝐹 0𝐹 1𝐹 2𝐹 3𝐹 4
𝑢 𝑣
𝐸 (𝐺 )
⋮ ⋮⋮ ⋮ ⋮
for any two edges and , if
add addaddadd add 5 edge-disjoint ascending paths𝐺4
add addaddadd add 4 edge-disjoint ascending paths𝐺3
add addaddadd add 3 edge-disjoint ascending paths𝐺2
add addaddadd add 2 edge-disjoint ascending paths𝐺1
add addaddadd add 1 ascending path𝐺0
𝑃𝑐𝑃𝑏𝑃𝑎
𝑃𝑑
𝑃𝑒
add add add add add 5 edge-disjoint ascending paths𝐺5
Newly created edge-disjoint ascending paths
5 edge-disjoint paths from u to v
![Page 15: Improved Bounds for Minimum Fault-Tolerant Gossip Graphs](https://reader036.vdocument.in/reader036/viewer/2022062315/5681652e550346895dd7b3c7/html5/thumbnails/15.jpg)
𝐹 0𝐹 1𝐹 2𝐹 3𝐹 4
𝑢 𝑣
𝐸 (𝐺 )
add addaddadd addadd addaddadd add
add addaddadd add
add addaddadd add
add addaddadd add
⋮ ⋮⋮ ⋮ ⋮add add add add add
8
The sum of the folded numbers of edge-disjoint paths = 10 When 7
It is sufficient to add the subsets k+q+1 times, where q is the sum of folded numbers of the edge-disjoint paths from u to v.
![Page 16: Improved Bounds for Minimum Fault-Tolerant Gossip Graphs](https://reader036.vdocument.in/reader036/viewer/2022062315/5681652e550346895dd7b3c7/html5/thumbnails/16.jpg)
Theorem 1: Let be an ordered graph with vertices. Suppose that
– can be decomposed into subsets such that for any two edges and , if ;
– for any two vertices and , there are edge-disjoint paths from to such that the sum of their folded numbers is , and the last edges of paths are in for .
Then, ,
where is an integer satisfying
![Page 17: Improved Bounds for Minimum Fault-Tolerant Gossip Graphs](https://reader036.vdocument.in/reader036/viewer/2022062315/5681652e550346895dd7b3c7/html5/thumbnails/17.jpg)
Fault-Tolerant Gossip Graphs Based on Hypercubes
: -dimensional hypercube
• • The edge-ordering is defined so that for any two edge and , if the dimension of is smaller than that of , then .
1
0
01
00
11
10
001
000
011
010
101
100
111
110
Q1: Q2: Q3:
The dimension of an edge is defined to be j.
1
2
1
43
7
86
5
1211109
42
31
![Page 18: Improved Bounds for Minimum Fault-Tolerant Gossip Graphs](https://reader036.vdocument.in/reader036/viewer/2022062315/5681652e550346895dd7b3c7/html5/thumbnails/18.jpg)
0001
0000
0011
0010
0101
0100
0111
0110
1001
1000
1011
1010
1101
1100
1111
1110
25 26 27
3229
28
3130
19
2422
2321
2018
17
9
10
11
13
14
15
16
12
8
57
64
3
2
1Haddad et al. showed that in for any ordered pair of vertices u and v, there are edge-disjoint paths from u to v such that their folded numbers are at most one.
We can easily check that the sum of their folded numbers is .
𝑄4 :
![Page 19: Improved Bounds for Minimum Fault-Tolerant Gossip Graphs](https://reader036.vdocument.in/reader036/viewer/2022062315/5681652e550346895dd7b3c7/html5/thumbnails/19.jpg)
Applying Theorem 1 to Hypercube
• Let be the set of edges with dimension , i.e., • There exists exactly one path whose last edge is in ,
i.e., for .• The sum of the folded numbers is .
• is an integer satisfying
Therefore,
![Page 20: Improved Bounds for Minimum Fault-Tolerant Gossip Graphs](https://reader036.vdocument.in/reader036/viewer/2022062315/5681652e550346895dd7b3c7/html5/thumbnails/20.jpg)
General Case• The -hypercube is defined as the graph obtained copies
of by selecting one vertex from each and identifying such vertices as a single vertex called the center vertex.
• By letting , .• Since , we consider edge-disjoint paths in .
𝑄4 ,𝑝 :
![Page 21: Improved Bounds for Minimum Fault-Tolerant Gossip Graphs](https://reader036.vdocument.in/reader036/viewer/2022062315/5681652e550346895dd7b3c7/html5/thumbnails/21.jpg)
Edge-Disjoint Paths in • Let such that and are in distinct copies of .• Construct edge-disjoint paths from to by
concatenating the edge-disjoint paths from to the center vertex in the copy of and the edge-disjoint paths from to in the copy of .
• Let (resp., ) be the path from to whose last edge (resp., the path from to whose first edge) has the dimension .
• Define𝑢 𝑣
![Page 22: Improved Bounds for Minimum Fault-Tolerant Gossip Graphs](https://reader036.vdocument.in/reader036/viewer/2022062315/5681652e550346895dd7b3c7/html5/thumbnails/22.jpg)
Applying Theorem 1 to
• Let be the set of edges with dimension , i.e., • There exists exactly one path whose last edge is in , i.e.,
for .• The sum of the folded numbers is at most .
• is an integer satisfying
Therefore,
![Page 23: Improved Bounds for Minimum Fault-Tolerant Gossip Graphs](https://reader036.vdocument.in/reader036/viewer/2022062315/5681652e550346895dd7b3c7/html5/thumbnails/23.jpg)
Fault-Tolerant Gossip Graphs Based on Circulant Graphs
• Let be an integer which is not a power of two.The -regular graph is defined as follows:
![Page 24: Improved Bounds for Minimum Fault-Tolerant Gossip Graphs](https://reader036.vdocument.in/reader036/viewer/2022062315/5681652e550346895dd7b3c7/html5/thumbnails/24.jpg)
Fault-Tolerant Gossip Graphs Based on Circulant Graphs
• The span of an edge where , is defined to be .• The edge-ordering is defined so that for any two edge and , if the span of is greater than that of , then .
The edges with span 0
The edges with span 1
The edges with span 2
The edges with span 3
![Page 25: Improved Bounds for Minimum Fault-Tolerant Gossip Graphs](https://reader036.vdocument.in/reader036/viewer/2022062315/5681652e550346895dd7b3c7/html5/thumbnails/25.jpg)
Edge-Disjoint Paths in
Case The set of edge-disjoint paths
and
, and
, and
, and
and
and 2
and
![Page 26: Improved Bounds for Minimum Fault-Tolerant Gossip Graphs](https://reader036.vdocument.in/reader036/viewer/2022062315/5681652e550346895dd7b3c7/html5/thumbnails/26.jpg)
Applying Theorem 1 to
• Let be the set of edges with span , i.e., • There are exactly two paths whose last edge is in , i.e., for .• The sum of the folded numbers is at most .
• is an integer satisfying
Therefore,
• When is even, we can slightly improve this bound since by adding at most edges in , we can construct k+1 edge-disjoint ascending paths.
![Page 27: Improved Bounds for Minimum Fault-Tolerant Gossip Graphs](https://reader036.vdocument.in/reader036/viewer/2022062315/5681652e550346895dd7b3c7/html5/thumbnails/27.jpg)
-Fault Tolerant Broadcast Graph• A -fault-tolerant broadcast graph is an ordered graph in which
there are edge-disjoint ascending paths from one vertex to any other vertex.
• Let be the minimum number of edges in a -fault-tolerant broadcast graph.
Theorem 2 (Berman and Hawrylycz)
![Page 28: Improved Bounds for Minimum Fault-Tolerant Gossip Graphs](https://reader036.vdocument.in/reader036/viewer/2022062315/5681652e550346895dd7b3c7/html5/thumbnails/28.jpg)
Broadcast Number• The -broadcast number of is the number of vertices to which
there is an ascending path from .• The broadcast number of is the minimum -broadcast number
over all vertices of .
Theorem 3 (Berman and Paul)The broadcast number of any ordered tree is at most .
𝑥
the -broadcast number is at most
![Page 29: Improved Bounds for Minimum Fault-Tolerant Gossip Graphs](https://reader036.vdocument.in/reader036/viewer/2022062315/5681652e550346895dd7b3c7/html5/thumbnails/29.jpg)
Defect Number• For an ordered graph let be the number of ascending
paths from to .• Define the defect number of with respect to as
• Suppose that is a k-fault-tolerant gossip graph with vertices, where
• Let be the spanning subgraph of having all the edges of order at most .
• By Berman and Hawrylycz’s Theorem, we can see that for any vertex in , there exists a vertex such that there is at most one ascending path from to , i.e., , thus, .
• Therefore, .
![Page 30: Improved Bounds for Minimum Fault-Tolerant Gossip Graphs](https://reader036.vdocument.in/reader036/viewer/2022062315/5681652e550346895dd7b3c7/html5/thumbnails/30.jpg)
• Let be a vertex whose broadcast number is equal to the broadcast number of .
• Let be the set of vertices to which there is an ascending path from in .
• By Berman and Paul’s Theorem, .
• Adding the edge with order to , at most one vertex newly receive the message originated from , thus,
• Therefore, .
𝐵𝑖(𝑥 )𝑖
![Page 31: Improved Bounds for Minimum Fault-Tolerant Gossip Graphs](https://reader036.vdocument.in/reader036/viewer/2022062315/5681652e550346895dd7b3c7/html5/thumbnails/31.jpg)
• .• • Let be the number of vertices with defect
number in .• Since any vertex with defect number is in , .• For any vertex in , if the defect number of w is
(resp., ), then there must exist at least (resp. ) edges with order > which are incident to in .
• Therefore, .• Substituting the upper bound on , we obtain
.
![Page 32: Improved Bounds for Minimum Fault-Tolerant Gossip Graphs](https://reader036.vdocument.in/reader036/viewer/2022062315/5681652e550346895dd7b3c7/html5/thumbnails/32.jpg)
Conclusion• We have refined a general method by Haddad et al. for constructing
fault-tolerant gossip graphs.
• Applying the result to edge-disjoint paths in (-)hypercubes, we have improved the upper bounds by Haddad et al on .
• We have presented edge-disjoint paths whose folded numbers are at most two in circulant graphs, from which we obtain an upper bound of on .
• We have shown a new lower bound on , which improves the previously known lower bounds when and .
• • Problem: