On randomized broadcasting in Star graphs

Discrete Applied Mathematics

Volumn 157, Issue 1, 2009, Pages 126-139

  Elsasser R ^a   Lorenz, U ^a   Sauerwald, T ^a  

^a UNIVERSITY OF PADERBORN   (Germany)

Author keywords

Edge expansion; Hypercubes; Randomized broadcasting; Star graphs

Indexed keywords

BROADCASTING; COMPUTER NETWORKS; CONTROL THEORY; DECODING; GRAPH THEORY; RANDOM PROCESSES;

BROADCASTING PROTOCOLS; COMMUNICATION NETWORKS; EDGE EXPANSION; GRAPH G; HIGH PROBABILITIES; HYPERCUBES; LOWER BOUNDS; NUMBER OF NODES; RANDOM STRUCTURES; RANDOMIZED BROADCASTING; REVERSE ORDERS; STAR GRAPHS;

INFORMATION DISSEMINATION;

EID: 56349150331     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2008.05.018     Document Type: Article

References (30)

1. S. Akers, D. Harel, B. Krishnamurthy, The Star graph: An attractive alternative to the n-cube, in: Proceedings of the International Conference on Parallel Processing, ICPP'87, 1987, pp. 393-400
2. Akers S., and Krishnamurthy B. A group-theoretic model for symmetric innterconnection networks. IEEE Transactions on Computers 38 4 (1989) 555-565
3. Bar-Yehuda R., Goldreich O., and Itai A. On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization. Journal of Computer and System Sciences 45 1 (1992) 104-126
4. Biggs N. Algebraic Graph Theory (1993), Cambridge University Press
5. Day K., and Tripathi A. A comparative study of topological properties of hypercubes and star graphs. IEEE Transactions on Parallel and Distributed Systems 5 1 (1994) 31-38
6. 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: Proceedings of the 6th ACM Symposium on Principles of Distributed Computing, PODC'87, 1987, pp. 1-12
7. M. Dietzfelbinger, S. Madhavapeddy, I. Sudborough, Three disjoint path paradigms in star networks, in: Proceedings of the 3rd IEEE Symposium on Parallel and Distributed Processing, 1991, pp. 400-406
8. R. Elsäesser, T. Sauerwald, On the runtime and robustness of randomized broadcasting, in: Proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC'06, 2006, pp. 349-358
9. Feige U., Peleg D., Raghavan P., and Upfal E. Randomized broadcast in networks. Random Structures and Algorithms 1 4 (1990) 447-460
10. Fragopoulou P., and Akl S. Edge-disjoint spanning trees on the star network with applications to fault tolerance. IEEE Transactions on Computers 45 2 (1996) 174-185
11. Hagerup T., and Rüb C. A guided tour of Chernoff bounds. Information Processing Letters 36 6 (1990) 305-308
12. Harper L. Optimal assignment of numbers to vertices. Journal of the Society for Industrial and Applied Mathematics 12 (1964) 131-135
13. Hethcore H. Mathematics of infectious diseases. SIAM Review 42 4 (2000) 599-653
14. J. Jwo, S. Lakshmivarahan, S. Dhall, Characterization of node disjoint (parallel) path in Star graphs, in: Proceedings of the 5th International Parallel Processing Symposium, IPPS'91, 1991, pp. 404-409
15. R. Karp, C. Schindelhauer, S. Shenker, B. Vöcking, Randomized rumor spreading, in: Proceedings of 41st IEEE Symposium on Foundations of Computer Science, FOCS'00, 2000, pp. 565-574
16. Kermack W., and McKendrick A. Contributions to the mathematical theory of epidemics. Proceedings of the Royal Society of London. Series A (1927) 700-721
17. Mei A., Bao F., Hamada Y., and Igarashi Y. Optimal time broadcasting in faulty star networks. IEICE Transactions on Fundamentals, Communications and Computer Sciences E82-A 5 (1999) 722-732
18. Leighton F.T. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes (1992), Morgan Kaufmann Publishers
19. Matoušek J., and Nešetřil J. Invitation to Discrete Mathematics (1998), Oxford University Press
20. Mendia V.E., and Sarkar D. Optimal broadcasting on the Star graph. IEEE Transactions on Parallel and Distributed Systems 3 4 (1992) 389-396
21. Mitzenmacher M., and Upfal E. Probability and Computing (2005), Cambdrige University Press
22. Newman M.E.J. The spread of epidemic disease on networks. Physical Review E 66 (2002) 016128
23. M. Nigam, S. Sahni, N. Yeh, Embedding hamiltonians and hypercubes in star interconnection graphs, in: Proceedings of the International Conference on Parallel Processing, ICPP'90, 3, 1990, pp. 340-343
24. Pittel B. On spreading rumor. SIAM Journal on Applied Mathematics 47 1 (1987) 213-223
25. Ranka S., Wang J.-C., and Yeh N. Embedding meshes on the Star graph. Journal of Parallel and Distributed Computing 19 2 (1993) 131-135
26. F. Shahrokhi, L.A. Székely, An algebraic approach to the uniform concurrent multicommoditiy flow problem: Theory and applications, Technical Report CRPDPC-91-4, Department of Computer Science, University of North Texas, 1991
27. Shahrokhi F., and Székely L.A. Constructing integral uniform flows in symmetric networks with application to the edge-forwarding index problem. Discrete Applied Mathematics 108 1-2 (2001) 175-191
28. Sheu J., Wu C., and Chen T. An optimal broadcasting algorithm without message redundancy in Star graphs. IEEE Transactions on Parallel and Distributed Systems 6 6 (1996) 653-658
29. Stacho L., and Vrto I. Bisection width of transposition graphs. Discrete Applied Mathematics 84 1-3 (1998) 221-235
30. C. Yeh, B. Parhami, On the VLSI area and bisection width of star graphs and hierarchical cubic networks, in: Proceedings of the 15th IEEE International Parallel and Distributed Processing Symposium, IPDPS'01, 2001, p. 72