Probabilistic flooding for efficient information dissemination in random graph topologies

Computer Networks

Volumn 54, Issue 10, 2010, Pages 1615-1629

  Oikonomou, Konstantinos ^a   Kogias, Dimitrios ^b   Stavrakakis, Ioannis ^b  

^a IONIAN UNIVERSITY   (Greece)

^b UNIVERSITY OF ATHENS   (Greece)

Author keywords

Information dissemination; Probabilistic flooding; Random graphs

Indexed keywords

ANALYTICAL RESULTS; ASYMPTOTIC EXPRESSIONS; ASYMPTOTIC VALUES; AVERAGE NUMBERS; COMPLETE NETWORKS; GLOBAL NETWORKS; MESSAGE OVERHEAD; PARAMETERIZED; PROBABILISTIC FLOODING; RANDOM GRAPH THEORY; RANDOM GRAPH TOPOLOGY; RANDOM GRAPHS; SIMULATION RESULT; UNSTRUCTURED PEER-TO-PEER;

ASYMPTOTIC ANALYSIS; DISTRIBUTED COMPUTER SYSTEMS; GRAPH THEORY; INFORMATION DISSEMINATION;

PEER TO PEER NETWORKS;

EID: 77955612784     PISSN: 13891286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comnet.2010.01.007     Document Type: Article

References (37)

1. A. Segall Distributed network protocols IEEE Trans. Inform. Theory IT-29 1983 Jan
2. E.K. Lua, J. Crowcroft, M. Pias, R. Sharma, S. Lim, A Survey and Comparison of Peer-to-Peer Overlay Network Schemes, IEEE Communications Survey and Tutorial, March 2004.
3. Napster. .
4. I. Stoica, R. Morris, D. Karger, M.F. Kaashoek, H. Balakrishnan, Chord: a scalable peer-to-peer lookup service for internet applications, in: Proceedings of ACM SIGCOMM '01, 2001.
5. AB.Y. Zhao, J. Kubiatowicz, A. Joseph, Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and Routing, Technical Report UCB/CSD-01-1141, UCB, 2001.
6. A. Rowstron, P. Druschel, Pastry: scalable, distributed object location and routing for large-scale peer-to-peer systems, in: IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), 2001, pp. 329-350.
7. R.F.C. Gnutella, 2002. .
8. C. Lv, P. Cao, E. Cohen, K. Li, S. Shenker, Search and Replication in Unstructured Peer-to-Peer Networks, ICS, 2002.
9. V. Kalogeraki, D. Gunopoulos, D. Zeinalipour-Yazti, A local search mechanism for peer-to-peer networks, in: CIKM (International Conference on Information and Knowledge Management), 2002.
10. C. Gkantsidis, M. Mihail, and A. Saberi Hybrid search schemes for unstructured peer-to-peer networks IEEE Infocom 2005 2005
11. N.B. Chang, M. Liu, Optimal controlled flooding search in a large wireless network, in: Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt'05), 2005, pp. 229-237.
12. D. Kempe, J. Kleinberg, A. Demers, Spatial gossip and resource location protocols, in: Proceedings of the 33rd ACM Symposium on Theory of Computing, 2001.
13. V.V. Dimakopoulos, and E. Pitoura On the performance of flooding-based resource discovery IEEE Trans. Parallel Distributed Syst. 17 11 2006 290 297 November
14. F. Banaei-Kashani, C. Shahabi, Criticality-based analysis and design of unstructured peer-to-peer network as "complex systems," in: Proceedings of the Third International Symposium on Cluster Computing and the Grid, 2003, pp. 51-358.
15. Yoav Sasson, David Cavin, André Schiper, Probabilistic Broadcast for Flooding in Wireless Mobile Ad Hoc Networks, Swiss Federal Institute of Technology (EPFL), Technical Report IC/2002/54.
16. D. Tsoumakos, N. Roussopoulos, Adaptive probabilistic search for peer-to-peer networks, in: Third IEEE International Conference on P2P Computing, 2003.
17. B. Wu, and A.D. Kshemkalyani Modeling message propagation in random graph networks Comput. Commun. Elsevier 31 17 2008 4138 4148
18. K. Oikonomou, I. Stavrakakis, Performance analysis of probabilistic flooding using random graphs, in: The First International IEEE WoWMoM Workshop on Autonomic and Opportunistic Communications (AOC 2007), Helsinki, Finland, 18 June, 2007.
19. A.O. Stauffer, and V.C. Barbosa Probabilistic heuristics for disseminating information in networks IEEE/ACM Trans. Networking 15 2 2007 425 435 April
20. S. Crisostomo, U. Schilcher, C. Bettstetter, J. Barros, Analysis of probabilistic flooding: how do we choose the right coin?, in: Proceedings of the IEEE International Conference on Communications, Dresden, Germany, June 2009.
21. P. Erds, A. Rényi, On Random Graphs, Publicationes Mathematicae Debrecen, vol. 6, pp. 290-297.
22. B. Bollobás Random Graphs second ed. 1999 Cambridge University Press
23. R. Albert, and A. Barabási Statistical mechanics of complex networks Rev. Mod. Phys. 2002
24. M.E.J. Newman The structure and function of complex networks SIAM Rev. 45 2003 167 256
25. P.V. Mienghem Performance Analysis of Communication Networks and Systems 2006 Cambridge University Press
26. A.R.S. Janson, and T. Luczak Random graphs Wiley Interscience Series in Discrete Mathematics and Optimization 2000
27. R. Gaetaa, and M. Sereno Random graphs as models of hierarchical peer-to-peer networks Perform. Evaluat. 64 9-12 2007 838 855 October
28. S. Tewari, L. Kleinrock, Analysis of search and replication in unstructured peer-to-peer networks, in: Proceedings of the 2005 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, Banff, Alberta, Canada, June 06-10, 2005.
29. D. Kogias, K. Oikonomou, I. Stavrakakis, Study of randomly replicated random walks for information dissemination over various network topologies, in: Sixth Annual Conference on Wireless On demand Network Systems and Services (WONS), Snowbird, Utah, USA, February 2-4, 2009.
30. B. Williams, D. Mehta, T. Camp, and W. Navidi Predictive models to rebroadcast in mobile ad hoc networks IEEE Trans. Mobile Comput. (TMC) 3 2004 295 303
31. B. Williams, T. Camp, Comparison of broadcasting techniques for mobile ad hoc networks, in: ACM Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC), 2002, pp. 194-205.
32. R. Karp, C. Schindelhauer, S. Shenker, B. Vocking, Randomized rumor spreading, in: Proceedings of the 41st Annual Symposium on Foundations of Computer Science, FOCS '00, 2000.
33. S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah Randomized gossip algorithms IEEE/ACM Trans. Networking 14 2006 2508 2530
34. A. Ganesh, L. Massoulie, D. Towsley, The effect of network topology on the spread of epidemicss, INFOCOM 2005, vol. 2, 13-17 March 2005, pp. 1455-1466.
35. Z.J. Haas, J.Y. Halpern, and L. Li Gossip-based ad hoc routing IEEE/ACM Trans. Networking 14 2006 479 491
36. F. Chung, and L. Lu The diameter of sparse random graphs Adv. Appl. Math. 26 4 2001 257 279
37. K.A. Berman, and J.L. Paul Algorithms: Sequential, Parallel, and Distributed 2005 Course Tecnology, Thomson Learning