On randomized broadcasting in star graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3787 LNCS, Issue , 2005, Pages 307-318

  Elsässer, Robert ^a   Sauerwald, Thomas ^a  

^a UNIVERSITY OF PADERBORN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BROADCASTING; INFORMATION DISSEMINATION; NETWORK PROTOCOLS; PROBABILITY; ROBUSTNESS (CONTROL SYSTEMS); TELECOMMUNICATION NETWORKS;

BROADCASTING PROBLEM; BROADCASTING PROTOCOL; HYPERCUBIC GRAPHS;

GRAPH THEORY;

EID: 33744926707     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11604686_27     Document Type: Conference Paper

References (19)

1. S. Akers, D. Harel, and B. Krishnamurthy. The star graph: An attractive alternative to the n-cube. In Proc. of the International Conference on Parallel Processing, (ICPP), pages 393-400, 1987.
2. S. Akers and B. Krishnamurthy. A group-theoretic model for symmetric interconnection networks. In Proc. of the International Conference on Parallel Processing, (ICCP), pages 555-565, 1986.
3. C. Chen and J. Chen. Vertex-disjoint routings in Star graphs. In Proc. of the first IEEE Int'l Conf. Algorithms and Architectures in Parallel Processing, pages 460-464, 1995.
4. C. Chen and J. Chen. Nearly optimal one-to-many parallel routing in Star networks. IEEE Transactions on Parallel and Distributed Systems, 8:1196-1202, 1997.
5. H. Chen. Threshold of broadcast in random graphs. DIMACS Technical Report 97-12, 1997.
6. H. Chernoff. A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Ann. Math. Stat., 23:493-507, 1952.
7. K. Day and A. Tripathi. A comparative study of topological properties of hypercubes and star graphs. IEEE Transactions on Parallel and Distributed Systems, 5, 1994.
8. A. Demers, D. Greene, C. Hauser, W. Irish, J. Larson, S. Shenker, H. Sturgis, D. Swinehart, and D. Terry. Epidemic algorithms for replicated database maintenance. In Proc. of the 6th ACM Symposium on Principles of Distributed Computing, pages 1-12, 1987.
9. M. Dietzfelbinger, S. Madhavapeddy, and I. Sudborough. Three disjoint path paradigms in Star networks. In Proc. of the 3rd IEEE Symp. Parallel and Distributed Processing, pages 400-406, 1991.
10. U. Feige, D. Peleg, P. Raghavan, and E. Upfal. Randomized broadcast in networks. Random Structures and Algorithm, I(4):447-460, 1990.
11. P. Fragopoulou and S. Akl. Edge-disjoint spanning trees on the Star network with applications to fault tolerance. IEEE Trans. Computers, 45:174-185, 1996.
12. A. Frieze and M. Molloy. Broadcasting in random graphs. Discrete Applied Mathematics 54, pages 77-79, 1994.
13. T. Hagerup and C. Rüb. A guided tour of chernoff bounds. Information Processing Letters, 36(6):305-308, 1990.
14. L. Harper. Optimal assignment of numbers to vertices. J. Soc. Ind. Appl. Math., 12:131-135, 1964.
15. J. Jwo, S. Lakshmivarahan, and S. Dhall. Characterization of node disjoint (parallel) path in Star graphs. In Proc. of the 5th Intl. Parallel Processing Symp., pages 404-409, 1991.
16. R. Karp, C. Schindelhauer, S. Shenker, and B. Vöcking. Randomized rumor spreading. Proc. of FOCS'00, pages 565-574, 2000.
17. M. Nigam, S. Sahni, and N. Yeh. Embedding hamiltonians and hypercubes in Star interconnection graphs. In Proc. of the Intl. Conf. on Parallel Processing, volume III, pages 340-342, 1990.
18. S. Ranka, J.-C. Wang, and N. Yeh. Embedding meshes on the Star graph. Journal of Parallel and Distributed Computing, 19:131-135, 1993.
19. J. Sheu, C. Wu, and T. Chen. An optimal broadcasting algorithm without message redundancy in Star graphs. IEEE Trans. Computers, 45:174-185, 1996.