Gossiping for resource discovering: An analysis based on complex network theory

This paper analyzes the adoption of unstructured P2P overlay networks to build resource discovery services. We consider a simple distributed communication protocol, which is based on gossip and on the local knowledge each node has about resources hold by its neighbors. In particular, upon reception (or generation) of a novel query, a node relays the message to those neighbors that have resources whose profile matches the query. Moreover, the node gossips the query to other remaining neighbors, so that the query can be disseminated through the overlay. A mathematical analysis is provided to estimate the number of nodes receiving the query (and consequently, the portion of query hits), based on the network topology, resource availability and gossip probability. Results show that the use of unstructured networks, coupled with simple dissemination protocols, represent a viable approach to build P2P resource discovery systems.

[1]  Byung Kyu Choi,et al.  Using Gossip for Dynamic Resource Discovery , 2006, 2006 International Conference on Parallel Processing (ICPP'06).

[2]  Dimitrios Gunopulos,et al.  A local search mechanism for peer-to-peer networks , 2002, CIKM '02.

[3]  Christine Morin,et al.  RW-OGS: An optimized randomwalk protocol for resource discovery in large scale dynamic Grids , 2008, 2008 9th IEEE/ACM International Conference on Grid Computing.

[4]  Anders Lindgren,et al.  Probabilistic routing in intermittently connected networks , 2003, MOCO.

[5]  Daniel S. Katz,et al.  Proceedings of the 15th ACM Mardi Gras conference: From lightweight mash-ups to lambda grids: Understanding the spectrum of distributed computing requirements, applications, tools, infrastructures, interoperability, and the incremental adoption of key capabilities, Baton Rouge, Louisiana, USA, Janua , 2008, Mardi Gras Conference.

[6]  Moreno Marzolla,et al.  Adaptive event dissemination for peer-to-peer multiplayer online games , 2011, SimuTools.

[7]  Jadwiga Indulska,et al.  The Emergence of Order in Random Walk Resource Discovery Protocols , 2005, KES.

[8]  Fan Chung Graham,et al.  A Random Graph Model for Power Law Graphs , 2001, Exp. Math..

[9]  Raouf Boutaba,et al.  Resource and service discovery in large-scale multi-domain networks , 2007, IEEE Communications Surveys & Tutorials.

[10]  Nian-Feng Tzeng,et al.  Structured peer-to-peer resource discovery for computational grids , 2008, Mardi Gras Conference.

[11]  S. Havlin,et al.  Structural properties of scale‐free networks , 2005 .

[12]  Edward A. Bender,et al.  The Asymptotic Number of Labeled Graphs with Given Degree Sequences , 1978, J. Comb. Theory A.

[13]  A Min Tjoa,et al.  Resource Discovery Service while Minimizing Maintenance Overhead in Hierarchical DHT Systems , 2012, Int. J. Adapt. Resilient Auton. Syst..

[14]  Öznur Özkasap,et al.  Stepwise fair-share buffering for gossip-based peer-to-peer data dissemination , 2009, Comput. Networks.

[15]  Saikat Guha,et al.  Quasar: a probabilistic publish-subscribe system for social networks , 2008, IPTPS.

[16]  Stefano Ferretti,et al.  Modeling Faulty, Unstructured P2P Overlays , 2010, 2010 Proceedings of 19th International Conference on Computer Communications and Networks.

[17]  Rüdiger Schollmeier,et al.  First and Second Generation of Peer-to-Peer Systems , 2005, Peer-to-Peer Systems and Applications.

[18]  Janne Riihijärvi,et al.  A survey on resource discovery mechanisms, peer-to-peer and service discovery frameworks , 2008, Comput. Networks.

[19]  Stefano Ferretti,et al.  Publish-subscribe systems via gossip: a study based on complex networks , 2011, SIMPLEX '12.

[20]  Edith Cohen,et al.  Search and replication in unstructured peer-to-peer networks , 2002, ICS '02.

[21]  Francesc Giné,et al.  A Computing Resource Discovery Mechanism over a P2P Tree Topology , 2010, VECPAR.

[22]  Ian T. Foster,et al.  Mapping the Gnutella Network , 2002, IEEE Internet Comput..

[23]  Pierre Sens,et al.  DRing: A Layered Scheme for Range Queries over DHTs , 2011, 2011 IEEE 11th International Conference on Computer and Information Technology.

[24]  Gabriele D'Angelo,et al.  Simulation of scale-free networks , 2009, SIMUTools 2009.

[25]  Louise E. Moser,et al.  iTrust: Trustworthy Information Publication, Search and Retrieval , 2012, ICDCN.

[26]  Marco Roccetti,et al.  A multimedia broker to support accessible and mobile learning through learning objects adaptation , 2008, TOIT.

[27]  Peter Triantafillou,et al.  PastryStrings: A Comprehensive Content-Based Publish/Subscribe DHT Network , 2006, 26th IEEE International Conference on Distributed Computing Systems (ICDCS'06).

[28]  VahdatAmin,et al.  Design and implementation trade-offs for wide-area resource discovery , 2008 .

[29]  M. Newman.  Random Graphs as Models of Networks , 2002, cond-mat/0202208.

[30]  Herbert S. Wilf,et al.  Generating functionology , 1990 .

[31]  Min Cai,et al.  MAAN: A Multi-Attribute Addressable Network for Grid Information Services , 2003, Journal of Grid Computing.

[32]  Anne-Marie Kermarrec,et al.  The many faces of publish/subscribe , 2003, CSUR.

[33]  Chryssis Georgiou,et al.  Meeting the deadline: on the complexity of fault-tolerant continuous gossip , 2010, PODC '10.

[34]  David Gamarnik,et al.  Embracing the giant component , 2004, Random Struct. Algorithms.

[35]  Gabriele D'Angelo,et al.  Multiplayer Online Games over scale-free networks: a viable solution? , 2010, SimuTools.

[36]  Jussi Kangasharju,et al.  Bubblestorm: resilient, probabilistic, and exhaustive peer-to-peer search , 2007, SIGCOMM '07.

[37]  Paolo Costa,et al.  Introducing reliability in content-based publish-subscribe through epidemic algorithms , 2003, DEBS '03.

[38]  Laura Ricci,et al.  Service and Resource Discovery supports over P2P overlays , 2009, 2009 International Conference on Ultra Modern Telecommunications & Workshops.

[39]  Domenico Talia,et al.  A Peer-to-Peer Framework for Resource Discovery in Large-Scale Grids , 2006, CoreGRID Integration Workshop.

[40]  Bruce M. Maggs,et al.  Globally Distributed Content Delivery , 2002, IEEE Internet Comput..

[41]  Duc A. Tran,et al.  Hierarchical multidimensional search in peer-to-peer networks , 2008, Comput. Commun..

[42]  Scott Shenker,et al.  Epidemic algorithms for replicated database maintenance , 1988, OPSR.

[43]  Domenico Talia,et al.  Peer-to-Peer resource discovery in Grids: Models and systems , 2007, Future Gener. Comput. Syst..

[44]  Antonio F. Gómez-Skarmeta,et al.  LightPS: Lightweight Content-Based Publish/Subscribe for Peer-to-Peer Systems , 2008, 2008 International Conference on Complex, Intelligent and Software Intensive Systems.

[45]  Yong Meng Teo,et al.  DGRID: A DHT-Based Resource Indexing and Discovery Scheme for Computational Grids , 2007, ACSW.

[46]  Jim Dowling,et al.  Discovery of Stable Peers in a Self-organising Peer-to-Peer Gradient Topology , 2006, DAIS.

[47]  Rajesh Raman,et al.  Matchmaking: distributed resource management for high throughput computing , 1998, Proceedings. The Seventh International Symposium on High Performance Distributed Computing (Cat. No.98TB100244).

[48]  Kenneth P. Birman,et al.  Bimodal multicast , 1999, TOCS.

[49]  Ian T. Foster,et al.  Grid information services for distributed resource sharing , 2001, Proceedings 10th IEEE International Symposium on High Performance Distributed Computing.

[50]  Murat Yuksel,et al.  Limited Scale-Free Overlay Topologies for Unstructured Peer-to-Peer Networks , 2009, IEEE Transactions on Parallel and Distributed Systems.

[51]  Song Jiang,et al.  LightFlood: Minimizing Redundant Messages and Maximizing Scope of Peer-to-Peer Search , 2008, IEEE Transactions on Parallel and Distributed Systems.

[52]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[53]  Vlado Keselj,et al.  Self-organizing peer-to-peer networks for collaborative document tracking , 2009, CIKM-CNIKM.

[54]  Anne-Marie Kermarrec,et al.  Peer-to-Peer Membership Management for Gossip-Based Protocols , 2003, IEEE Trans. Computers.

[55]  P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .

[56]  Sujata Banerjee,et al.  NodeWiz: peer-to-peer resource discovery for grids , 2005, CCGrid 2005. IEEE International Symposium on Cluster Computing and the Grid, 2005..

[57]  A. Barabasi,et al.  Scale-free characteristics of random networks: the topology of the world-wide web , 2000 .

[58]  Suresh Jagannathan,et al.  Search with probabilistic guarantees in unstructured peer-to-peer networks , 2005, Fifth IEEE International Conference on Peer-to-Peer Computing (P2P'05).

[59]  Hans-Arno Jacobsen,et al.  Efficient event-based resource discovery , 2009, DEBS '09.