On the runtime and robustness of randomized broadcasting

Theoretical Computer Science

Volumn 410, Issue 36, 2009, Pages 3414-3427

  Elsasser R ^a   Sauerwald, T ^a  

^a UNIVERSITY OF PADERBORN   (Germany)

Author keywords

Distributed computing; Randomized algorithm

Indexed keywords

AGENT BASED; APPLIED MATHEMATICS; CARTESIAN PRODUCTS OF GRAPHS; COMPLETE GRAPHS; DISTRIBUTED COMPUTING; GENERAL GRAPH; GENERAL UPPER BOUND; LOWER AND UPPER BOUNDS; LOWER BOUNDS; MAXIMUM DEGREE; MINIMUM DEGREE; RANDOMIZED ALGORITHM; RANDOMIZED BROADCASTING; REGULAR GRAPHS; RUNTIME;

ALGORITHMS; BROADCASTING; COMPUTATION THEORY; CONTROL THEORY; FAULT TOLERANCE; QUALITY ASSURANCE;

GRAPH THEORY;

EID: 67650961157     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2008.04.017     Document Type: Article

References (20)

1. S.B. Akers, D. Harel, B. Krishnamurthy, The star graph: An attractive alternative to the n-cube, in: Proc. of ICPP'87, 1987, pp. 393-400
2. Bollobás B. Random Graphs (1985), Academic Press
3. M. Capocelli, L. Gargano, U. Vaccaro, Time bounds for broadcasting in bounded degree graphs, in: Proc. of WG'89, 1989, pp. 19-33
4. Chernoff H. A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Annals of Mathematics and Statistics 23 (1952) 493-507
5. A. Demers, D. Greene, C. Hauser, W. Irish, J. Larson, S. Shenker, H. Sturgis, D. Swinehart, D. Terry, Epidemic algorithms for replicated database maintenance, in: Proc. of PODC'87, 1987, pp. 1-12
6. Elsässer R., Lorenz U., and Sauerwald T. Agent-based randomized broadcasting in large networks. Discrete Applied Mathematics 155 2 (2007) 150-160
7. R. Elsässer, T. Sauerwald, On randomized broadcasting in star graphs, in: Proc. of WG'05, 2005, pp. 307-318
8. R. Elsässer, T. Sauerwald, Broadcasting vs. mixing and information dissemination on Cayley graphs, in: Proc. of STACS'07, 2007, pp. 163-174
9. Feige U., Peleg D., Raghavan P., and Upfal E. Randomized broadcast in networks. Random Structures and Algorithm 1 4 (1990) 447-460
10. Ga{ogonek}sieniec L., and Pelc A. Adaptive broadcasting with faulty nodes. Parallel Computing 22 (1996) 903-912
11. In: Gross J.L., and Yellen J. (Eds). Handbook of Graph Theory (2004), CRC Press
12. Hagerup T., and Rüb C. A guided tour of Chernoff bounds. Information Processing Letters 36 6 (1990) 305-308
13. Harper L.H. Optimal assignment of numbers to vertices. Journal of Society for Industrial and Applied Mathematics 12 (1964) 131-135
14. Hethcore H.W. Mathematics of infectious diseases. SIAM Review 42 (2000) 599-653
15. Hromkovic ̌ J., Klasing R., Pelc A., Ruz ̌ic ̌ka P., and Unger W. Dissemination of Information in Communication Networks (2005), Springer
16. R. Karp, C. Schindelhauer, S. Shenker, B. Vöcking, Randomized rumor spreading, in: Proc. of FOCS'00, 2000, pp. 565-574
17. Kermack W.O., and McKendrick A.G. Contributions to the mathematical theory of epidemics. Proceedings of the Royal Society of London (Series A) 138 (1927) 700-721
18. T. Leighton, B. Maggs, R. Sitamaran, On the fault tolerance of some popular bounded-degree networks, in: Proc. of FOCS'92, 1992, pp. 542-552
19. Mitzenmacher M., and Upfal E. Probability and Computing (2005), Cambdrige University Press
20. Pittel B. On spreading a rumor. SIAM Journal on Applied Mathematics 47 1 (1987) 213-223