Agent-based information handling in large networks

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

Volumn 3153, Issue , 2004, Pages 586-598

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

^a UNIVERSITY OF PADERBORN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BROADCASTING; GAME THEORY; GRAPH THEORY; OBJECT ORIENTED PROGRAMMING; SOFTWARE AGENTS;

AGENT PROGRAMMING; BOUNDED DEGREE GRAPHS; BROADCAST PROTOCOLS; INFORMATION HANDLING; LARGE NETWORKS; OBJECT-ORIENTED PROGRAM; RANDOMIZED BROADCASTING; SOFTWARE ABSTRACTIONS;

MOBILE AGENTS;

EID: 35048820673     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-28629-5_45     Document Type: Article

References (21)

1. F. Ball. A threshold theorem for the reed-frost chain-binomial epidemic. Journal of Applied Probability 20, pages 153-157, 1983.
2. B. Bollobas. Random Graphs. Academic Press, 1985.
3. Hui Chen. Threshold of broadcast in random graphs. DIMACS Tech. Rep. 97-12, 1997.
4. 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.
5. F.R.K. Chung. Spectral Graph Theory, volume 92 of CBMS Regional conference, series in mathematics. American Mathematical Society, 1997.
6. D.M. Cvetkovic, M. Doob, and H. Sachs. Spectra of Graphs. Johann Ambrosius Earth, 3rd edition, 1995.
7. R. Elsässer, B. Monien, and R. Preis. Diffusion schemes for load balancing on heterogeneous networks. Theory of Computing Systems, 35:305-320, 2002.
8. U. Feige, D. Peleg, P. Raghavan, and E. Upfal. Randomized broadcast in networks. Random Structures and Algorithm, 1(4):447-460, 1990.
9. A.M. Frieze and M. Molloy. Broadcasting in random graphs. Discrete Applied Mathematics 54, pages 77-79, 1994.
10. T. Hagerup and C. Rub. A guided tour of chernoff bounds. Information Processing Letters, 36(6):305-308, 1990.
11. H.W. Hethcore. Mathematics of infectious diseases. SIAM Review 42, pages 599-653, 2000.
12. J. Hylton, K. Manheimer, F. L. Drake, B. Warsaw, R. Masse, and G. van Rossum. Knowbot programming: system support for mobile agents. In Proc. of IWOOOS'96, pages 8-13, 1996.
13. A. A. Kaizar, J. T. Mayes, and A. R. Mikler. Agent-based distance vector routing. Proc. Third Intl. Workshop MATA, pages 41-50, 2001.
14. R. Karp, C. Schindelhauer, S. Shenker, and B. Vöcking. Randomized rumor spreading. Proc. of FOCS'00, pages 565-574, 2000.
15. D. Kempe, J. Kleinberg, and A. Demers. Spatial gossip and resource location protocols. Proc. of STOC'01, pages 163-172, 2001.
16. D. Kotz and F. Mattern. Agent systems, mobile agents, and applications. Second International Symposium on Agent systems and Applications and Fourth International Symposium on Mobile Agents, ASA/MA, LNCS 1882, 2000.
17. Atsuyoshi Nakamura, Naoki Abe, Hiroshi Matoba, and Katsuhiro Ochiai. Automatic recording agent for digital video server. Proceedings of the eighth ACM international conference on Multimedia, Marina del Rey, USA, pages 57-66, 2000.
18. M. E. J. Newman. The spread of epidemic disease on networks. Phys. Rev. E 66, 016128, 2002.
19. B. Pittel. On spreading rumor. SIAM Journal on Applied Mathematics, 47(1):213-223, 1987.
20. T. Roughgarden and E. Tardos. How bad is selfish routing? Proc. of FOCS'00, pages 93-102, 2000.
21. A. Sinclair and M. Jerrum. Approximate counting, uniform generation and rapidly mixing markov chains. Inform, and Comput., 82:93-133, 1989.