Cooperative stalking of transient nomadic resources on overlay networks

Future Generation Computer Systems

Volumn 29, Issue 6, 2013, Pages 1473-1484

  Exarchakos, Georgios ^a   Antonopoulos, Nick ^b  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b UNIVERSITY OF DERBY   (United Kingdom)

Author keywords

Autonomous overlays; Discovery mechanism; Load balancing; Nomadic resources; Self adaptive topology

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS; DYNAMICS; OVERLAY NETWORKS; RESOURCE ALLOCATION; TOPOLOGY;

ADAPTIVE TOPOLOGIES; DISTRIBUTED RESOURCE DISCOVERY; DYNAMIC ENVIRONMENTS; EMERGENT COMPUTING; IMPLICIT KNOWLEDGE; NOMADIC RESOURCES; PEER-TO-PEER COMPUTING; STABLE PERFORMANCE;

COMPUTATIONAL COMPLEXITY;

EID: 84886776510     PISSN: 0167739X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.future.2012.12.008     Document Type: Article

References (33)

1. R. Buyya, C.S. Yeo, S. Venugopal, J. Broberg, I. Brandic, Cloud computing and emerging IT platforms: vision, hype, and reality for delivering computing as the 5th utility, Future Generation Computer Systems 25 (6) (2009) 599-616.
2. M. Armbrust, et al., A view of cloud computing, Communications of the ACM 53 (4) (2010) 50.
3. N. Suri, et al. Agile computing: bridging the gap between grid computing and ad-hoc peer-to-peer resource sharing, in: Cluster Computing and the Grid, 2003. Proceedings. CCGrid 2003. 3rd IEEE/ACM International Symposium on, 2003, pp. 618-625.
4. I. Carreras, I. Chlamtac, H. Woesner, H. Zhang, Nomadic sensor networks, in: Wireless Sensor Networks, 2005. Proceeedings of the Second European Workshop on, 2005, pp. 166-175.
5. T. Bedrax-weiss, C. Mcgann, S. Ramakrishnan, Formalizing resources for planning, in: Proceedings of the {ICAPS-03} Workshop on {PDDL}, 2003, pp. 7-14.
6. K. Vanthournout, G. Deconinck, R. Belmans, A taxonomy for resource discovery, Personal and Ubiquitous Computing 9 (2) (2005) 81-89.
7. C. Gkantsidis, J. Miller, P. Rodriguez, Anatomy of a p2p content distribution system with network coding, in: 5th Int. Work. on {P2P} System {(IPTPS)}, 2006.
8. X. Yang, G. de Veciana, Performance of peer-to-peer networks: service capacity and role of resource sharing policies, Performance Evaluation 63 (3) (2006) 175-194.
9. D. Tsoumakos, N. Roussopoulos, Analysis and comparison of {P2P} search methods, in: Proceedings of the 1st international conference on Scalable information systems, 2006, vol. 152, p. 25.
10. E. Meshkova, J. Riihijärvi, M. Petrova, P. Mähönen, A survey on resource discovery mechanisms, peer-to-peer and service discovery frameworks, Computer Networks 52 (11) (2008) 2097-2128.
11. H. Barjini, M. Othman, H. Ibrahim, N. Udzir, Shortcoming, problems and analytical comparison for flooding-based search techniques in unstructured P2P networks, Peer-to-Peer Networking and Applications 5 (1) (2012) 1-13.
12. Gnutella, Gnutella Protocol Specification. 2008.
13. V. Kalogeraki, D. Gunopulos, D. Zeinalipour-Yazti, A local search mechanism for peer-to-peer networks, 2002, pp. 300-307.
14. Q. Lv, P. Cao, E. Cohen, K. Li, S. Shenker, Search and replication in unstructured peer-to-peer networks, in: Proceedings of the 16th International Conference on Supercomputing, 2002, pp. 84-95.
15. B. Yang, H. Garcia-Molina, Improving search in peer-to-peer networks, in: Distributed Computing Systems, 2002. Proceedings. 22nd International Conference on, 2002, pp. 5-14.
16. I. Clarke, S.G. Miller, T.W. Hong, O. Sandberg, B. Wiley, Protecting free expression online with Freenet, Internet Computing, IEEE 6 (1) (2002) 40-49.
17. C. Gkantsidis, M. Mihail, A. Saberi, Hybrid search schemes for unstructured peer-to-peer networks, in: {INFOCOM} 2005. 24th Annual Joint Conference of the {IEEE} Computer and Communications Societies. Proceedings {IEEE}, 2005, vol. 3, pp. 1526-1537.
18. H. Barjini, M. Othman, H. Ibrahim, QuickFlood: an efficient search algorithm for unstructured peer-to-peer networks, in: S. Fong (Ed.), Networked Digital Technologies, vol. 136, Springer, Berlin, Heidelberg, 2011, pp. 82-92.
19. D. Tsoumakos, N. Roussopoulos, Adaptive probabilistic search for peer-to-peer networks, 2003, pp. 102-109.
20. H. Zhuge, X. Chen, X. Sun, Preferential walk: towards efficient and scalable search in unstructured peer-to-peer networks, in: Special Interest Tracks and Posters of the 14th International Conference on World Wide Web, 2005, pp. 882-883.
21. C. Santillán, L. Reyes, E. Conde, C. Martinez, M. Lam, C. Zezzatti, Performance analysis of the neighboring-ant search algorithm through design of experiment, in: E. Corchado, X. Wu, E. Oja, Á. Herrero, B. Baruque (Eds.), Hybrid Artificial Intelligence Systems, vol. 5572, Springer, Berlin/Heidelberg, 2009, pp. 662-669.
22. Lian-ying Zhou, Long-ji Sun, A P2P resource search model based on Ant Colony Optimization, in: Computer and Automation Engineering, ICCAE, 2010 The 2nd International Conference on, 2010, vol. 4, pp. 433-436.
23. Y. Deng, F. Wang, A. Ciura, Ant colony optimization inspired resource discovery in P2P Grid systems, The Journal of Supercomputing 49 (1) (2009) 4-21.
24. P. Dasgupta, E. Antonson, Heuristics for uninformed search algorithms in unstructured P2P networks inspired by self-organizing social insect models, in: M. Hinchey, A. Pagnoni, F. Rammig, H. Schmeck (Eds.), Biologically-Inspired Collaborative Computing, vol. 268, Springer, Boston, 2008, pp. 19-32.
25. X. Shi, J. Han, Y. Liu, L.M. Ni, Popularity adaptive search in hybrid P2P systems, Journal of Parallel and Distributed Computing 69 (2) (2009) 125-134.
26. M. Zaharia, S. Keshav, Gossip-based search selection in hybrid peer-to-peer networks, Concurrency and Computation: Practice and Experience 20 (2) (2008) 139-153.
27. L.A. Adamic, R.M. Lukose, A.R. Puniyani, B.A. Huberman, Search in power-law networks, Physical Review E 64 (4) (2001).
28. N. Sarshar, P.O. Boykin, V.P. Roychowdhury, Percolation search in power law networks: making unstructured peer-to-peer networks scalable, in: {Peer-to-Peer} Computing, 2004. Proceedings. Proceedings. Fourth International Conference on, 2004, pp. 2-9.
29. K.Y.K. Hui, J.C.S. Lui, D.K.Y. Yau, Small-world overlay {P2P} networks: construction, management and handling of dynamic flash crowds, Computer Networks 50 (15) (2006) 2727-2746.
30. B. Bollobas, O. Riordan, The diameter of a {scale-free} random graph, Combinatorica 24 (1) (2004) 5-34.
31. R. Albert, H. Jeong, A.-L. Barabasi, Error and attack tolerance of complex networks, Nature 406 (6794) (2000) 378-382.
32. D.S. Callaway, M.E.J. Newman, S.H. Strogatz, D.J. Watts, Network robustness and fragility: percolation on random graphs, Physical Review Letters 85 (25) (2000) 5468.
33. A. Iamnitchi, I. Foster, D.C. Nurmi, A peer-to-peer approach to resource location in grid environments, in: High Performance Distributed Computing, 2002. {HPDC-11} 2002. Proceedings. 11th {IEEE} International Symposium on, 2002, p. 419.