A pragmatic approach to location-aware service organization and discovery

In this paper, we propose a pragmatic approach for location-aware service organization and discovery in structured peer-to-peer networks. To achieve local administration, the geographical space is divided into autonomous “local areas”. The local areas and service providers within each area are then organized in two separate tiers using Hilbert Space Filling Curve. Furthermore, the locality-preserving property of the Hilbert curve is exploited to ease the maintenance and to make location-based range searches feasible. Besides, we adapt the Small World Model in our novel Source Sampling method to make the resulting network model navigable. As shown in preliminary experiments, our framework performs better in terms of routing efficiency, when compared with early approaches. In addition, it reduces the workload of superpeers and mitigates the negative effect of the failure of the superpeers.

[1]  Anthony K. H. Tung,et al.  Similarity evaluation on tree-structured data , 2005, SIGMOD '05.

[2]  Ralph Bergmann,et al.  Representation and Structure-Based Similarity Assessment for Agile Workflows , 2007, LWA.

[3]  Henning Schulzrinne,et al.  GloServ: global service discovery architecture , 2004, The First Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services, 2004. MOBIQUITOUS 2004..

[4]  Michael B. Jones,et al.  SkipNet: A Scalable Overlay Network with Practical Locality Properties , 2003, USENIX Symposium on Internet Technologies and Systems.

[5]  Jon M. Kleinberg,et al.  Small-World Phenomena and the Dynamics of Information , 2001, NIPS.

[6]  Domenico Talia,et al.  ERGOT: Combining DHTs and SONs for Semantic-Based Service Discovery on the Grid , 2008 .

[7]  Devdatt P. Dubhashi,et al.  Adaptive Dynamics of Realistic Small-World Networks , 2008, ArXiv.

[8]  Cristopher Moore,et al.  How Do Networks Become Navigable , 2003 .

[9]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[10]  Edward Fredkin,et al.  Trie memory , 1960, Commun. ACM.

[11]  Ling Liu,et al.  Process Mining by Measuring Process Block Similarity , 2006, Business Process Management Workshops.

[12]  Wil M. P. van der Aalst,et al.  The Application of Petri Nets to Workflow Management , 1998, J. Circuits Syst. Comput..

[13]  Lican Huang A P2P Service Discovery Strategy Based on Content Catalogues , 2007, Data Sci. J..

[14]  Sharon L. Milgram,et al.  The Small World Problem , 1967 .

[15]  Pierre Fraigniaud,et al.  Networks Become Navigable as Nodes Move and Forget , 2008, ICALP.

[16]  Yanghua Xiao,et al.  Structure-based graph distance measures of high degree of precision , 2008, Pattern Recognit..

[17]  Ian Clarke,et al.  The evolution of navigable small-world networks , 2006, ArXiv.

[18]  Hermann de Meer,et al.  Performance Evaluation of Overlay-Based Range Queries in Mobile Systems , 2008, EuroNGI Workshop.

[19]  Erich J. Neuhold,et al.  Transforming BPEL into annotated deterministic finite state automata for service discovery , 2004 .

[20]  Karsten Wolf,et al.  Transforming BPEL to Petri Nets , 2005, Business Process Management.

[21]  Amit P. Sheth,et al.  METEOR-S WSDI: A Scalable P2P Infrastructure of Registries for Semantic Publication and Discovery of Web Services , 2005, Inf. Technol. Manag..

[22]  Ling Liu,et al.  Process Mining, Discovery, and Integration using Distance Measures , 2006, 2006 IEEE International Conference on Web Services (ICWS'06).

[23]  Andreas Wombacher Evaluation of Technical Measures for Workflow Similarity Based on a Pilot Study , 2006, OTM Conferences.

[24]  Horst Bunke,et al.  Similarity Measures for Structured Representations , 1993, EWCBR.

[25]  Vasant Honavar,et al.  A framework for semantic web services discovery , 2005, WIDM '05.

[26]  Vladimir I. Levenshtein,et al.  Binary codes capable of correcting deletions, insertions, and reversals , 1965 .

[27]  Manish Parashar,et al.  A Peer-to-Peer Approach to Web Service Discovery , 2004, World Wide Web.

[28]  José M. Vidal,et al.  Matchmaking of web services based on the DAML-S service model , 2003, AAMAS '03.

[29]  Tao Gu,et al.  A service-oriented middleware for building context-aware services , 2005, J. Netw. Comput. Appl..

[30]  Daniela Grigori,et al.  Service Retrieval Based on Behavioral Specifications and Quality Requirements , 2005, Business Process Management.

[31]  Farnoush Banaei Kashani,et al.  WSPDS: Web Services Peer-to-Peer Discovery Service , 2004, International Conference on Internet Computing.

[32]  Jon M. Kleinberg,et al.  The small-world phenomenon: an algorithmic perspective , 2000, STOC '00.

[33]  Yiming Hu,et al.  Semantic Search in Peer-to-Peer Systems , 2005, Handbook on Theoretical and Algorithmic Aspects of Sensor, Ad Hoc Wireless, and Peer-to-Peer Networks.

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

[35]  Mark Klein,et al.  Towards High-Precision Service Retrieval , 2002, SEMWEB.

[36]  Zhichen Xu,et al.  pSearch: information retrieval in structured overlays , 2003, CCRV.

[37]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM '01.

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

[39]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.