Scalable service discovery in ubiquitous and pervasive computing architectures: A percolation-driven approach

The diffusion of ubiquitous and pervasive computing applications, providing advanced services anytime and everywhere across heterogeneous mobile networks, is fostering the development of new architectures and models, based on the emerging peer-to-peer paradigm, to allow the effective use of multiple replicated resources and services without the scalability and adaptiveness limitations characterizing traditional client-server organizations. In this scenario, effective service discovery facilities are needed to minimize the administrative overhead and increase the overall usability and perceived service quality. However, most of the currently available implementations lack efficiency due to the highly dynamic and hierarchically flat nature of the underlying wireless mobile networking environment, that make any traditional solution based on centralized schemes and statically defined roles practically unfeasible. Accordingly we proposed a novel service discovery approach based on a fully distributed and parallel search model, that does not require any centralized intelligence, fixed roles and stable communication infrastructure. It exploits, in a dynamic scale-free scenario characterized by competition for links and balanced node insertion and removal rates, a widely known random walk-based search paradigm benefitting from bond percolation in power law organizations to automatically limit the search space (by shielding low connectivity nodes from search traffic) and drastically reduce the total control overhead. We analyzed the effectiveness and performance of the proposed solution by using discrete event-driven simulation, whose results were satisfactory also in highly mobile ad-hoc environments. This indicates that the proposed ideas are promising and deserve further exploitation by practical application solutions designers.

[1]  D. Sornette,et al.  Stretched exponential distributions in nature and economy: “fat tails” with characteristic scales , 1998, cond-mat/9801293.

[2]  Domenico Cotroneo,et al.  A strategy for application-transparent integration of nomadic computing domains , 2005, Third IEEE Workshop on Software Technologies for Future Embedded and Ubiquitous Systems (SEUS'05).

[3]  Timothy W. Finin,et al.  Toward Distributed service discovery in pervasive computing environments , 2006, IEEE Transactions on Mobile Computing.

[4]  V. Roychowdhury,et al.  Scale-free and stable structures in complex ad hoc networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[5]  C. M. Sperberg-McQueen,et al.  Extensible Markup Language (XML) , 1997, World Wide Web J..

[6]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[7]  J. Hammersley,et al.  Percolation processes , 1957, Mathematical Proceedings of the Cambridge Philosophical Society.

[8]  Christos Gkantsidis,et al.  Random walks in peer-to-peer networks: Algorithms and evaluation , 2006, Perform. Evaluation.

[9]  David R. Karger,et al.  INS/Twine: A Scalable Peer-to-Peer Architecture for Intentional Resource Discovery , 2002, Pervasive.

[10]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[11]  Michalis Faloutsos,et al.  On power-law relationships of the Internet topology , 1999, SIGCOMM '99.

[12]  Michael Nidd,et al.  Service discovery in DEAPspace , 2001, IEEE Wirel. Commun..

[13]  Hari Balakrishnan,et al.  The design and implementation of an intentional naming system , 1999, SOSP.

[14]  Eric Pouyoul,et al.  Project JXTA: A Loosely-Consistent DHT Rendezvous Walker , 2002 .

[15]  Deborah L. McGuinness,et al.  OWL Web ontology language overview , 2004 .

[16]  David M. Raup,et al.  How Nature Works: The Science of Self-Organized Criticality , 1997 .

[17]  Leandros Tassiulas,et al.  Network layer support for service discovery in mobile ad hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[18]  S. Havlin,et al.  Scale-free networks are ultrasmall. , 2002, Physical review letters.

[19]  Lada A. Adamic,et al.  Search in Power-Law Networks , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[20]  Vwani P. Roychowdhury,et al.  Percolation search in power law networks: making unstructured peer-to-peer networks scalable , 2004 .

[21]  Eyal de Lara,et al.  A cross-layer approach to service discovery and selection in MANETs , 2005, IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005..

[22]  S. N. Dorogovtsev,et al.  Scaling properties of scale-free evolving networks: continuous approach. , 2000, Physical review. E, Statistical, nonlinear, and soft matter physics.

[23]  P. Oscar Boykin,et al.  Scalable percolation search on complex networks , 2006, Theor. Comput. Sci..