Context-based caching and routing for P2P web service discovery

Abstract

In modern heterogeneous environments, such as mobile, pervasive and ad-hoc networks, architectures based on web services offer an attractive solution for effective communication and inter-operation. In such dynamic and rapidly evolving environments, efficient web service discovery is an important task. Usually this task is based on the input/output parameters or other functional attributes, however this does not guarantee the validity or successful utilization of retrieved web services. Instead, non-functional attributes, such as device power features, computational resources and connectivity status, that characterize the context of both service providers and consumers play an important role to the quality and usability of discovery results. In this paper we introduce context-awareness in web service discovery, enabling the provision of the most appropriate services at the right location and time. We focus on contextbased caching and routing for improving web service discovery in a mobile peer-to-peer environment. We conducted a thorough experimental study, using our prototype implementation based on the JXTA framework, while simulations are employed for testing the scalability of the approach. We illustrate the advantages that this approach offers, both by evaluating the context-based cache performance and by comparing the efficiency of location-based routing to broadcast-based approaches.

A Collaborative QoS-Aware Service Evaluation Method Among Multi-Users for a Shared Service

“…Generally, service evaluation could be promoted from two perspectives, i.e., functionality matching and non-functional QoS matching (Jeong et al, 2009;Rao et al, 2006;Agarwai et al, 2009;Zeng et al, 2004). These matching processes are often recruited for qualified service selection in certain application context (Blake et al, 2007;Medjahed & Atif, 2007;Doulkeridis, Zafeiris, Norvag, Vazirgianns, & Giakoumakis, 2007). Generally, functionality could be distinguished easily on the Internet (Jeong et al, 2009).…”

Autonomous Pull-Push Community Construction Technology for High-Assurance

“…Therefore, most of decentralized based protocols like DEAPspa -SD, DSD [16] take overlay-less implemece, Konark, PDP, Allia, GSD, AODV-SD, M-ZRP, ODMRPntation to discover service by either pushing unsolicited advertisement or multicasting/broadcasting request of all services in entire network which result in inefficient utilization of memory and bandwidth. Likewise, existing distributed context-aware service discovery techniques enable physical and logical contexts based service discovery without specifying the search limit [27].…”

“…Therefore, it becomes difficult to estimate suitable size of searching-ring (or appropriate TTL) in presence of non-uniform distribution of nodes, and highly dynamic operational environment (like ADCS). Likewise, all existing SDPs [27] don't discuss how to specify search radius to facilitate context-aware service discovery in presence of multiple SPs.…”

Organizing and searching data in unstructured P2P networks

“…• P2P query processing -similarity search (range, k-NN queries) in metric spaces to be presented at VLDB'07 [43] -skyline queries, presented at ICDE'07 [139] -top-k queries, under submission [141] • P2P summary caching -XML schema caching, presented at P2P'06 [36] and under submission [40] -taxonomy caching, presented at ICPS'06 [104] -applications to context-based information for mobile P2P environments, presented at MDM'05 [45] and published in DAPD'07 [44].…”

“…We also explore how to support non-traditional queries (such as top-k [141] and skylines [139]) that involve ranking. Furthermore, by relaxing the restriction of completely unsupervised environment and assuming a semi-supervised context, a novel technique for P2P summary caching of hierarchical information is presented, exploiting either predefined taxonomies [104] or XML schema information [36,40], which is applied in mobile P2P context-aware environments to improve query routing [45,44]. Preface This is a doctoral thesis submitted to the Athens University of Economics and Business for the doctoral degree.…”