A semantic overlay for service discovery across Web Information Systems

Size: px
Start display at page:

Download "A semantic overlay for service discovery across Web Information Systems"

Transcription

1 A semantic overlay for service discovery across Web Information Systems Devis Bianchini, Valeria De Antonellis, Michele Melchiori and Denise Salvi Università di Brescia Dip. Elettronica per l Automazione Via Branze, Brescia - Italy bianchin deantone melchior salvi@ing.unibs.it Abstract. Nowadays many collaborative organizations require advanced semantic interoperability tools to enable cooperation and communication across distributed Web Information Systems (WIS). Adopting the service oriented technology, they have improved interoperability at the application level by using services for WIS functionalities provisioning. Furthermore, in order to support effective peer-to-peer collaboration, they require semantic interoperability techniques for service discovery and sharing. In this paper, we focus on semantic interoperability issues for distributed collaboration and provide techniques for building a service semantic overlay, across heterogeneous WIS. In particular, semantic links among peers that offer comparable services in a given domain are defined and maintained over the time. The service semantic overlay is ontologybased for formally organizing the shared services to enhance the capability of service interchange and interoperation among the collaborative systems. The approach and prototype have been proposed to demonstrate practical benefits in the framework of the ESTEEM (Emergent Semantics and cooperation in multi-knowledge EnvironMents) project. 1 Introduction Nowadays many collaborative organizations require advanced semantic interoperability tools to enable cooperation and communication across distributed Web Information Systems (WIS). Methods and tools devoted to the interconnection of the systems according to a peer-to-peer approach have enabled collaboration at the technological level. Adoption of service oriented technology has improved interoperability at the application level by using services for WIS functionalities provisioning. Furthermore, in order to support effective peer-to-peer collaboration, they require semantic interoperability techniques for service discovery and sharing. We focus on the application level and, specifically, provide techniques This work has been partially supported by the ESTEEM PRIN Project ( esteem/index.html) and TEKNE FIRB Project ( funded by the Italian Ministry of Education, University and Research.

2 for service analysis and organization in order to build a service semantic overlay, across heterogeneous Web Information Systems, by means of semantic links among peers offering comparable services (semantic neighbors). For service analysis and automated matchmaking, we have already proposed the fc(functional Comparison)-match approach characterized by a novel hybrid matchmaking and discovery environment [7]. In this paper, we propose a P2P-based Semantic Driven Service Discovery (P2P-SDSD) approach, where an ontological framework supports the service semantic overlay construction, devoted to the definition and maintenance of semantic links among services belonging to different peers. Semantic links between two service specifications are computed with respect to the service interfaces, described in terms of the entities exchanged with the service during its execution (input and output parameters) and the operations performed on these entities. Two services are similar with respect to their functionality if they perform the same or similar operations on the same or similar entities. Following this perspective, we have defined an ontology-based approach to establish semantic links between services belonging either to a single peer (intra-peer semantic links) or to different peers (inter-peer semantic links); in this way it is possible to identify possible synergic service centres over the network. Each peer maintains semantic links of interest (preferential semantic links, selected according to threshold based criteria) together with local service descriptions. When a peer receives a service request, semantic links are exploited to optimize local search within a single peer and distributed search of possible candidate services over the P2P network. Contributions of this work are: the development of techniques for semantic link definition and organization without heavily affecting the P2P network workload; their exploitation process, according to optimization policies, to support effective and efficient service discovery in the collaborative scenario. The approach descrided in this paper is part of the ESTEEM project [14], where peers of a P2P network are organized in semantic communities to improve contextaware and trust-based data and service discovery. The paper is organized as follows: Section 2 introduces the considered application scenario; Section 3 describes the ontology-based framework for service semantic overlay management; Section 4 illustrates the service discovery process based on the semantic overlay; Section 5 presents some experimental results; Section 6 discusses related work and points out some differences with our approach; finally, Section 7 presents concluding remarks and future work. 2 Application scenario Let s consider a community of peers in a given application domain which aim at providing and retrieving services. In our vision, each service has an abstract description (abstract service) in terms of service functionalities (operations) and input/output messages (parameters), based on the WSDL standard. For each abstract service, a set of concrete implementations are provided on the network. Two distinct peers could register the same abstract service, for which different

3 implementations could be provided, or they could advertise different abstract services that could partially overlap. When a peer is looking for a service, it formulates the service request by specifying the expected functional interface and sends the request to one of the peers of the community. According to this vision and to the service-oriented paradigm, each peer can play three different roles: (i) it can store abstract services and references to corresponding concrete implementations (broker); (ii) it can publish on a broker of the community the implementation of a service, described by its functional interface (provider); (iii) it can look for a service (requester). When a peer joins the collaborative community, it can act both as a broker/provider or a requester. When a peer P X joins the community site, it obtains the list of brokers IP currently available in the community and starts to contact them. When a broker P Y replies, P X can be connected to it. If P X is a provider, it publishes its services on broker P Y and waits for a request to serve. If P X is a requester, it sends a request to the broker P Y and waits for the answer. Finally, if P X is a broker in the community, it is connected to P Y, from which it receives a list of brokers known by P Y through a shuffling-based mechanism [16] carried out by technological level, that allows more effective information diffusion among brokers. In fact, according to this mechanism, two brokers periodically select and exchange a subset of brokers connected to them, randomly chosen. Brokers are in charge of establishing and maintaining semantic links towards other brokers on the basis of similarity between abstract services they store. Semantic links constitute a semantic overlay over the community of collaborative peers. In the rest of the paper, we will explain how the semantic overlay is built, maintained and exploited for service discovery purposes. 3 Ontology-based model for the service semantic overlay Broker service registry. Each broker in the network has its local: (i) UDDI Registry, where concrete service implementations are registered and associated to their abstract services through tmodels; (ii) a peer ontology, that provides a conceptualization of abstract service operations (e.g., flight reservation) and I/O parameters (e.g., electronic ticket) through concepts and semantic relationships between them; (iii) a standard service categorization, denoted with Service Category Taxonomy (SCT), extracted from available standard taxonomies (e.g., UNSPSC, NAiCS) to conceptualize service domain. Abstract services are associated to SCT categories in the UDDI Registry. Both the peer ontology and SCT are represented using OWL-DL formalism. The peer ontology and the SCT are augmented by a thesaurus containing terms that are related by terminological relationships (as synonymy or hypernymy) to the names of concepts and categories. The thesaurus is automatically built from the general, domain independent source of lexical information Word- Net [8]. By means of the thesaurus, peer matching capabilities based on the peer ontology and categories are extended. More details about the combined use of ontologies and thesaurus can be found in [7].

4 Fig.1. Service semantic overlay built on the P2P logical network. Broker service matchmaker. Each broker in the community is endowed with a matchmaker. In [7] we defined a hybrid matchmaking strategy, where a deductive matchmaking model is combined with a similarity-based model to compare services on the basis of their functional interface. The deductive matchmaking is used to qualify the kind of match MatchType (S 1,S 2 ) between two abstract services S 1 and S 2. According to this matchmaking model, it is possible to state if S 1 and S 2 provide the same functionalities (S 1 Exact S 2 ), if S 1 provide additional functionalities with respect to S 2 (S 1 Extends S 2 ) or viceversa, if there is a non empty intersection between functionalities provided by S 1 and S 2 (S 1 Intersects S 2 ) or if S 1 and S 2 have nothing in common (S 1 Mismatch S 2 ). In case of partial overlapping among service functionalities (Extends or Intersects) the similarity-based matchmaking model is used to quantify service similarity Sim(S 1, S 2 ) [0, 1] through coefficients properly defined to compare service interfaces. Otherwise, if S 1 Exact S 2 or S 1 Mismatch S 2, then Sim(S 1, S 2 ) = 1.0 or Sim(S 1, S 2 ) = 0.0, respectively. A detailed presentation of the hybrid matchmaking model with presentation of experimental results about the matchmaker is given in [7]. In this paper, we show how to exploit the information derived from the service matchmaking to improve a semantic-driven search of services among collaborative peers. Service semantic overlay. Matchmaking information (MatchType and Sim) are used to define semantic links among abstract services when advertised on brokers. A semantic link between two services S 1 and S 2 is established if they are similar (denoted with S 1 S 2 ), that is, whenmatchtype(s 1,S 2 ) is not Mismatch and Sim(S 1, S 2 ) δ, where δ is a similarity threshold. If S 1 and S 2 are published on the same broker P and S 1 S 2, then an intra-peer semantic link is established

5 between them, denoted with sl P (S 1, S 2 ). For example, in Figure 1 on broker P X, abstract services S1 X and S2 X are connected to S3 X. In particular, S3 X and S2 X have overlapping functionalities, while S1 X adds functionalities with respect to those of S3 X. Semantic links are labeled with the similarity degree. For example, similarity between S3 X and S2 X is If S 1 and S 2 are published on two different brokers P 1 and P 2 and S 1 S 2, an inter-peer semantic link is established between them. To establish inter-peer semantic links, the broker P X sends a probe service request for each service Si X it wants to make sharable to other brokers connected at the logical network overlay in the community. The probe service request contains the interface of Si X and the IP address of P X. The broker P Y that receives the probe service request, matches it against its own abstract services Sj Y by applying the matchmaking techniques based on its own peer ontology and SCT and obtains for each comparison the MatchType and the similarity value. P Y then replies to P X with the list of Sj Y such that Si X Sj Y, together with the MatchType and the similarity value. P X establishes an inter-peer semantic link isl PX P Y (Si X, Sj Y ) for each Sj Y ) and P Y is recognized as a semantic neighbor of P X. Inter-peer semantic links are stored in the Semantic Neighbors Knowledge of broker P X. For example, in Figure 1, service S3 X on broker P X adds functionalities with respect to service S2 Y on broker P Y and the similarity degree is 0.8. Probe service requests are sent according to a Time-To-Live (TTL) mechanism with a low TTL value to avoid network overload. In fact, brokers that cannot be reached from P X, due to the low TTL value, will be reached thanks to the shuffling-based mechanism. Experimentation is being performed to establish the best value of TTL. Logical network overlay evolution. In the considered collaborative scenario there is the need to guarantee the communication among peers and manage the dynamic aspects featuring the P2P network organization. The logical network overlay collects all the peer participating the system: each node represents a peer and each link is a logical connection between two peers. In order to guarantee connection between peers an Overlay Management Protocol (OMP) is used, which defines specific procedures to join, leave and modify the logical network overlay. In our approach a shuffling-based OMP is chosen in order to allow more effective information diffusion among peers [16]. This kind of OMP arranges the logical network overlay as a graph in which each peer is directly connected to a small portion of the entire peer population, that is their logical neighbors. The shuffling protocol is quite simple: each peer continuously changes the set of its logical neighbors by occasionally contacting a random neighbor, then they exchange some of their neighbors. The obtained result is inexpensive overlay membership management, in the sense that any joining or leaving of nodes is quickly and efficiently managed. Moreover, a peer eventually become aware of new peers that are made available on the network. Service semantic overlay evolution. The service semantic overlay has to be managed with respect to changes that occur to the participating brokers:

6 acquisition of the IP address of a new broker in the logical network overlay, disconnection of a semantic neighbor from the community, publication/cancellation of a service in the broker registry. When the IP of a new broker P Y is acquired due to the shuffling-based protocol at the logical network overlay, then probe service requests are sent to P Y and possibly inter-peer semantic links between P X and P Y are established based on the received answers. A broker P X recognizes that a semantic neighbor P X becomes unavailable if a given number of messages sent to P Y are not answered. In this case the inter-peer semantic links toward abstract services published on P Y are removed from P X. Finally, if a new service Si X is published on a broker P X, a probe service request is sent to semantic neighbors of P X and inter-peer semantic links are established on the basis of obtained answers. If a service is removed, the interpeer semantic links based on it are removed on the broker on which it has been published. 4 Service discovery based on the service semantic overlay A service request S R is formulated by specifying one or more service categories and the desired functional interface. It is sent to broker P X, to which the requester is connected, and it is matched against abstract services published on P X (local search). Afterwards, S R is sent to the other brokers that are semantic neighbors of P X, according to different forwarding policies (distributed search). Each broker, which receives the request, applies the same matching process. Each broker collects its local concrete implementations for the abstract services matching S R with those received from semantic neighbors and sends them back to the broker from which the request came, up to the requester. matchtype(s R,Si X) matchtype(si X,Sj X) Mismatch matchtype(s R,Sj X) R1) Si X Exact S R Si X <matchtype> Sj X Sj X <matchtype> S R R2a) Si X Extends S R Sj X Exact Extends Si X Sj X Extends S R R2b) Sj X Intersects Si X evaluate MatchType(Sj X,S R) R2c) Si X Extends Sj X evaluate MatchType(Sj X,S R) R3a) S R Extends Si X Sj X Exact Si X S R Extends Sj X R3b) Si X Extends Sj X S R Extends Sj X R3c) otherwise evaluate MatchType(Sj X,S R) R4a) Si X Intersects S R Sj X Exact Si X Sj X Intersects S R R4b) otherwise evaluate MatchType(Sj X,S R) Table 1. Exploitation of intra-peer semantic links during local search.

7 Local search. When the service request S R reaches the broker P X, the broker, according to the categories, searches for abstract services in its own registry to build a list MS(S R ) = { S1 X, Sim 1, mt 1,... Sn X, Sim n, mt n } of matching services such that S R Si X, where Sim i = Sim(S R, Si X ) and mt i =MatchType(S R, Si X ). Intra-peer semantic links on broker P X can be exploited to efficiently find all available services which match locally. In fact, if Si X is found such that S R Si X, then Si X is included into MS(S R ) and only abstract services Sj X related with intra-peer semantic links to Si X are considered as candidate services for the request S R, according to the rules presented in Table 1. After performing local search, broker P X forwards the request to its semantic neighbors. If no matching service has been found, P X selects randomly a set of brokers connected at the logical network overlay and forwards S R to them. Example 1. If S R S3 X such that S3 X Extends S R (Figure 1), then also S R S1 X (S1 X Extends S R ) according to rule R2a on Table 1. The kind of match between S R and S2 X must be evaluated (according to rule R2b), while S4 X is not considered for S R, since no intra-peer semantic links exist between S4 X and the other abstract services relevant for S R. Distributed search. Once matching abstract services have been found on peer P X, two forwarding policies based on inter-peer semantic links can be applied. Minimal policy. Search over the semantic overlay stops when matching services which fully satisfy the request have been found; this strategy is performed according to the following rules: for each Si X MS(S R ) such that Si X Exact Extends S R, it is not necessary to forward the request to semantic neighbors, since concrete implementations of Si X already satisfy completely the request; for each Si X MS(S R ) such that S R Intersects Extends Si X, the request is not completely satisfied by Si X and is forwarded to semantic neighbors, that could add further functionalities to those already provided by Si X ; however, broker P X does not consider semantic neighbors that provide services Sj Y such that Si X Extends Exact Sj Y, because this means that Sj Y does not provide additional functionalities with respect to those already provided by Si X ; if no semantic neighbors exist for any abstract service Si X MS(S R ), the request is forwarded to one of the brokers that are connected to P X in the logical network overlay (randomly chosen); Example 2. According to the first forwarding rule, since S3 X Extends S R on P X (Figure 1), the request is not forwarded to P Y ; moreover, according to rule R2a on Table 1, S1 X Extends S R, then S R is not forwarded towards P Z too. On the other hand, since S R Extends S1 X, the request is forwarded to P Z, where S2 Z Intersects S1 X could provide additional functionalities with respect to S1 X ; moreover, according to rule R3b on Table 1, S R Extends S3 X, but the request is not forwarded to P Y, where no further functionalities are provided with respect to those of S3 X.

8 Exhaustive policy. This policy follows the same rules, but it does not stop when matching services that fully satisfy the request are found; according to this policy, also for each Si X MS(S R ) such that Si X Exact Extends S R, the request S R is forwarded to semantic neighbors to find other services that could present, for example, better non functional features (not discussed in this paper). A broker which receives S R from a semantic neighbor applies one of the two forwarding policies; the search stops according to a Time To Live mechanism. Example 3. In Figure 1, since S R Extends S1 X (and S R Extends S3 X according to rule R3b on Table 1), the request is forwarded both to broker P Y and broker P Z. 5 Experimental evaluation In this section, we present a preliminary evaluation of performances of our approach. To this purpose, we performed a set of simulations based on Neuro- Grid [11], an extensible network overlay simulator in which we have implemented the P2P-SDSD service semantic overlay network and the minimal forwarding policy explained in Section 4. Simulation Parameter Description N Total number of brokers on the network NS Total number of available services Initial TTL Initial TTL associated to a request message Simulation Type P2P-SDSD or Gnutella γ Probability that two brokers has established semantic links ( (0,1)) ASP Average number of services per broker Fig. 2. Simulation Parameters The simulations we have run compares P2P-SDSD forwarding policy with the Gnutella one [9] both in terms of efficiency and scalability. The choice of a comparison with Gnutella is due to the fact that both P2P-SDSD and Gnutella define an overlay network built on top of an unstructured P2P network. Apart from the architectural similarities, we have considered Gnutella since its message forwarding strategy is well-known and it is frequently considered as a reference example. Some other P2P forwarding strategies have been also considered for a comparison with P2P-SDSD and we plan to perform additional experiments in future work. The experiments have been performed: (i) to demonstrate the better recall results of our distributed search with respect to Gnutella search; (ii) to confirm that the use of the P2P-SDSD request forwarding policy results in an improved scalability. In particular, P2P-SDSD and Gnutella service discovery have been compared on these parameters: Recall: with respect to a submitted request it is the ratio among the number of services retrieved by the distributed search policy and the number of

9 services retrieved if all offered services would be available on the node posing the request and the local search applied; the higher the recall, the more effective the distributed search by providing an answer similar to a local search. Generated Messages: it is the number of overall messages generated to answer a service request; this parameter depends on the TTL (Time To Live) value and on the peer s average number of connections to its neighbors; the lower the generated messages the better the scalability, since a lower number of messages per request reduces the possibility of network congestion. The different experimental settings for the simulation are obtained by setting some operative parameters shown in Figure 2. These parameters determine how the simulated logical overlay network is built and run. The simulator generates a random P2P network [11] of N peers and NS artificial services. Services are assigned to each peer according to the ASP parameter. The distribution of probability P() of the kind of match between a pair of services has been set as follows: P(Mismatch) = 50%, P(Intersect) = 35%, P(Extends) = 10%, P(Exact) = 5%. The γ value is the probability that a pair of peers has already exchanged probe queries and therefore have possibly established inter-peer semantic links. The Initial TTL determines the maximum number of times a message can be forwarded on the network and therefore the higher this value, the higher the number of peers involved in answering the request. In particular, the results discussed in the following have been obtained with these simulation parameter values: the Initial TTL has been varied between 1 and 12, N=100, γ = 0.60, NS=50 and ASPP= Recall (%) P2P SDSD Gnutella Initial TTL Fig.3. Recall vs. Initial TTL

10 Figure 3 compares P2P-SDSD and Gnutella approaches through the Recall curves by setting different values for the Initial TTL parameter. The figure shows how P2P-SDSD overperforms the Gnutella even with low TTL values. This can be explained by the fact that inter-peer semantic links allow to selectively reach the most of the peers that provide relevant services with a low number of request forwardings. As TTL gets higher also the Gnutella performs better since the request reaches the most of the peers in the network. The analysis of generated messages has been performed on a series of 13 simulations with Initial TTL value set to 5 and a network of 100 peers. In each simulation we ran, a request has been submitted and we have collected the results obtained with both P2P-SDSD and Gnutella on the same simulated network. In these simulations the average number of generated messages for P2P-SDSD is nearly 19.31, that is about 50% lower than the value of obtained by the Gnutella approach. 6 Related work In literature, P2P semantic-driven resource discovery has attracted much attention from Web services and Semantic Web area and relies on several efforts in related research fields, such as data integration and emergent semantics in P2P environments [1, 6, 10] to go beyond limitations of centralized service-oriented architectures. However, in P2P environments semantic heterogeneity and scalability issues must be addressed. Recent works involved structured [2, 13] and unstructured P2P architectures [12]. The first ones are less flexible and are mainly based on DHT (Distributed Hash Tables) structures, which require much efforts for maintenance. In [5] a P2P-based system to support efficient access to e-catalogs is provided, where scalability issues are solved by organizing information space in communities that are inter-related using peer relationships, defined as mappings between ontologies. Selection of relevant peers to which queries must be forwarded is based on a query rewriting algorithm. Our approach focuses on unstructured P2P architectures, featured by scalability issues, applied to the service discovery problem. Other approaches addressed the same problem. METEOR-S [15] uses a centralized registry ontology to classify peer registries. During the discovery process, registry ontology is browsed to find the proper registry to which the request must be submitted. ARTEMIS [3] defines a P2P network, where each peer has an ontology, based on medical information standards, to annotate services. Peers store the services they provide in a mediator super-peer. A peer sends a request to its reference mediator expressed in terms of its own ontologies; mediator uses ontology mappings to find matching services in its local registry and forwards the request to other mediators. WSPDS [4] describes a P2P network where peers have local DAML-S ontologies to provide service semantics and links with other peers based on an average similarity between services they provide. When a request is submitted to a peer, it searches for local matching results and forwards the request to all the linked peers, independently from the current request or the

11 local results of the query. In our approach a service semantic overlay is built by relating similar services through inter-peer semantic links in a community of collaborative peers. Like WSPDS, no common ontology is required and no super-peer is defined. However, in our approach, combined use of search results found locally and inter-peer semantic links allows for application of fine-grained request forwarding strategies. 7 Conclusions In this paper, we proposed a P2P service discovery approach to enable cooperation and communication across distributed Web Information Systems, where Web Services are used for WIS functionalities provisioning. Semantic interoperability is based on a service semantic overlay, over the logical network overlay, built by establishing semantic links among peers that offer comparable services. The semantic overlay is exploited to fasten service discovery and improve its efficacy without affecting network overload. Preliminary experiments have been performed to confirm the advantages derived from the exploitation of semantic overlay if compared with traditional Gnutella approach. Further experimentation will evaluate the impact of the proposed approach on open P2P networks, where additional issues must be considered during the construction of semantic overlay, and concrete applications in those kinds of networks will be investigated. References 1. K. Aberer, P. Cudre-Mauroux, and M. Hauswirth. The Chatty Web: Emergent Semantics Through Gossiping. In Proc. of the 12th International World Wide Web Conference, pages , Budapest, Hungary, K. Arabshian and H. Schulzrinne. An Ontology-based Hierarchical Peer-to-Peer Global Service Discovery System. Journal of Ubiquitous Computing and Intelligence (JUCI), The ARTEMIS Project: A Semantic Web Service-based P2P Infrastructure for the Interoperability of Medical Information Systems. projects/artemis/. 4. F. Banaei-Kashani, C. Chen, and C. Shahabi. WSPDS: Web Services Peer-to-Peer Discovery Service. In Proc. of the Int. Conference on Internet Computing (IC 04), pages , Las Vegas, Nevada, USA, B. Benatallah, M.S. Hacid, H.Y. Paik, C. Rey, and F. Toumani. Towards semanticdriven, flexible and scalable framework for peering and querying e-catalog communities. Information Systems, 31(4-5): , P. Bernstein, F. Giunchigiloa, A. Kementsietsidis, J. Mylopoulos, L. Serafini, and I. Zaihrayeu. Data Management for Peer-to-Peer Computing: A Vision. In Proc. of the 5th International Workshop on the Web and Databases (WebDB 02), Madison, Wisconsin, D. Bianchini, V. De Antonellis, and M. Melchiori. Flexible Semanticbased Service Matchmaking and Discovery. World Wide Web Journal ( /), C. Fellbaum. Wordnet: An Electronic Lexical Database. MIT Press, 1998.

12 9. The Gnutella Protocol Specification v A. Halevy, Z. Ives, D. Suciu, and I. Tatarinov. Schema Mediation in Peer Data Management Systems. In Proc. of the 19th International Conference on Data Engineering (ICDE 03), Bangalore, India, NeuroGrid Home Page M. Paolucci, K.P. Sycara, T. Nishimura, and N. Srinivasan. Using daml-s for p2p discovery. In Proceedings of the Int. Conference on Web Services (ICWS2003), C. Schmidt and M. Parashar. A peer-to-peer approach to web service discovery. World Wide Web Journal, 7(2): , The ESTEEM Team. Emergent Semantics and Cooperation in Multi-Knowledge Environments: the ESTEEM Architecture. In VLDB Int. Workshop on Semantic Data and Service Integration (SDSI07), pages 1 12, Vienna, Austria, K. Verma, K. Sivashanmugam, A. Sheth, A. Patil, S. Oundhakar, and J. Miller. METEOR-S WSDI: A Scalable Infrastructure of Registries for Semantic Publication and Discovery of Web Services. Journal of Information Technology and Management, Special Issue on Universal Global Integration, 6(1):17 39, S. Voulgaris, D. Gavidia, and M. van Steen. CYCLON: Inexpensive Membership Management for Unstructured P2P Overlays. Journal of Network and Systems Management, 13(2): , 2005.

Using Peer to Peer Dynamic Querying in Grid Information Services

Using Peer to Peer Dynamic Querying in Grid Information Services Using Peer to Peer Dynamic Querying in Grid Information Services Domenico Talia and Paolo Trunfio DEIS University of Calabria HPC 2008 July 2, 2008 Cetraro, Italy Using P2P for Large scale Grid Information

More information

WSPDS: Web Services Peer-to-peer Discovery Service

WSPDS: Web Services Peer-to-peer Discovery Service WSPDS: Web Services Peer-to-peer Discovery Service Farnoush Banaei-Kashani, Ching-Chien Chen, and Cyrus Shahabi Computer Science Department, University of Southern California, Los Angeles, California 90089

More information

INTEGRATION OF XML DATA IN PEER-TO-PEER E-COMMERCE APPLICATIONS

INTEGRATION OF XML DATA IN PEER-TO-PEER E-COMMERCE APPLICATIONS INTEGRATION OF XML DATA IN PEER-TO-PEER E-COMMERCE APPLICATIONS Tadeusz Pankowski 1,2 1 Institute of Control and Information Engineering Poznan University of Technology Pl. M.S.-Curie 5, 60-965 Poznan

More information

Automated Retrieval of Semantic Web Services: A Matching Based on Conceptual Indexation

Automated Retrieval of Semantic Web Services: A Matching Based on Conceptual Indexation The International Arab Journal of Information Technology, Vol. 10, No. 1, January 2013 61 Automated Retrieval of Semantic Web s: A Matching Based on Conceptual Indexation Hadjila Fethallah and Chikh Mohammed

More information

Semantics-enabled Web API Organization and Recommendation

Semantics-enabled Web API Organization and Recommendation Semantics-enabled Web API Organization and Recommendation Devis Bianchini, Valeria De Antonellis, Michele Melchiori Department of Information Engineering Università di Brescia - Italy 1 Fast Web app development:

More information

Digital resource discovery: semantic annotation and matchmaking techniques

Digital resource discovery: semantic annotation and matchmaking techniques Digital resource discovery: semantic annotation and matchmaking techniques Devis Bianchini 1 Silvana Castano 2 Fulvio D Antonio 3 Valeria De Antonellis 1 Mounira Harzallah 4 Michele Missikoff 3 Stefano

More information

Enhance UDDI and Design Peer-to-Peer Network for UDDI to Realize Decentralized Web Service Discovery

Enhance UDDI and Design Peer-to-Peer Network for UDDI to Realize Decentralized Web Service Discovery Enhance UDDI and Design Peer-to-Peer Network for UDDI to Realize Decentralized Web Service Discovery De-Ke Guo 1, Hong-Hui Chen 1, Xian-Gang Luo 2,Xue-Shan Luo 1, Wei-Ming Zhang 1 1 School of Information

More information

A Collaborative and Semantic Data Management Framework for Ubiquitous Computing Environment

A Collaborative and Semantic Data Management Framework for Ubiquitous Computing Environment A Collaborative and Semantic Data Management Framework for Ubiquitous Computing Environment Weisong Chen, Cho-Li Wang, and Francis C.M. Lau Department of Computer Science, The University of Hong Kong {wschen,

More information

Grid Data Integration based on Schema-mapping

Grid Data Integration based on Schema-mapping Grid Data Integration based on Schema-mapping Carmela Comito and Domenico Talia DEIS, University of Calabria, Via P. Bucci 41 c, 87036 Rende, Italy {ccomito, talia}@deis.unical.it http://www.deis.unical.it/

More information

Super-Consumer Based Reputation Management for Web Service Systems

Super-Consumer Based Reputation Management for Web Service Systems Super-Consumer Based Reputation Management for Web Service Systems Yao Wang, Julita Vassileva Department of Computer Science, University of Saskatchewan, Canada, e-mail:{yaw181, jiv}@cs.usask.ca Abstract

More information

Distributed Database for Environmental Data Integration

Distributed Database for Environmental Data Integration Distributed Database for Environmental Data Integration A. Amato', V. Di Lecce2, and V. Piuri 3 II Engineering Faculty of Politecnico di Bari - Italy 2 DIASS, Politecnico di Bari, Italy 3Dept Information

More information

Learning Domain Ontology for Web Services

Learning Domain Ontology for Web Services Bootstrapping Domain Ontology for Semantic Web Services from Source Web Sites Wensheng Wu 1, AnHai Doan 1, Clement Yu 2, and Weiyi Meng 3 1 University of Illinois, Urbana, USA 2 University of Illinois,

More information

Training Management System for Aircraft Engineering: indexing and retrieval of Corporate Learning Object

Training Management System for Aircraft Engineering: indexing and retrieval of Corporate Learning Object Training Management System for Aircraft Engineering: indexing and retrieval of Corporate Learning Object Anne Monceaux 1, Joanna Guss 1 1 EADS-CCR, Centreda 1, 4 Avenue Didier Daurat 31700 Blagnac France

More information

Varalakshmi.T #1, Arul Murugan.R #2 # Department of Information Technology, Bannari Amman Institute of Technology, Sathyamangalam

Varalakshmi.T #1, Arul Murugan.R #2 # Department of Information Technology, Bannari Amman Institute of Technology, Sathyamangalam A Survey on P2P File Sharing Systems Using Proximity-aware interest Clustering Varalakshmi.T #1, Arul Murugan.R #2 # Department of Information Technology, Bannari Amman Institute of Technology, Sathyamangalam

More information

International journal of Engineering Research-Online A Peer Reviewed International Journal Articles available online http://www.ijoer.

International journal of Engineering Research-Online A Peer Reviewed International Journal Articles available online http://www.ijoer. RESEARCH ARTICLE ISSN: 2321-7758 GLOBAL LOAD DISTRIBUTION USING SKIP GRAPH, BATON AND CHORD J.K.JEEVITHA, B.KARTHIKA* Information Technology,PSNA College of Engineering & Technology, Dindigul, India Article

More information

Concept-Based Discovery of Mobile Services

Concept-Based Discovery of Mobile Services Concept-Based Discovery of Mobile Services Chara Skouteli University of Cyprus CY-1678 Nicosia, Cyprus chara@ucy.ac.cy George Samaras University of Cyprus CY-1678 Nicosia, Cyprus cssamara@ucy.ac.cy Evaggelia

More information

XOP: Sharing XML Data Objects through Peer-to-Peer Networks

XOP: Sharing XML Data Objects through Peer-to-Peer Networks 22nd International Conference on Advanced Information Networking and Applications XOP: Sharing XML Data Objects through Peer-to-Peer Networks Itamar de Rezende, Frank Siqueira Department of Informatics

More information

GRIDB: A SCALABLE DISTRIBUTED DATABASE SHARING SYSTEM FOR GRID ENVIRONMENTS *

GRIDB: A SCALABLE DISTRIBUTED DATABASE SHARING SYSTEM FOR GRID ENVIRONMENTS * GRIDB: A SCALABLE DISTRIBUTED DATABASE SHARING SYSTEM FOR GRID ENVIRONMENTS * Maha Abdallah Lynda Temal LIP6, Paris 6 University 8, rue du Capitaine Scott 75015 Paris, France [abdallah, temal]@poleia.lip6.fr

More information

Cloud-dew architecture: realizing the potential of distributed database systems in unreliable networks

Cloud-dew architecture: realizing the potential of distributed database systems in unreliable networks Int'l Conf. Par. and Dist. Proc. Tech. and Appl. PDPTA'15 85 Cloud-dew architecture: realizing the potential of distributed database systems in unreliable networks Yingwei Wang 1 and Yi Pan 2 1 Department

More information

Application of ontologies for the integration of network monitoring platforms

Application of ontologies for the integration of network monitoring platforms Application of ontologies for the integration of network monitoring platforms Jorge E. López de Vergara, Javier Aracil, Jesús Martínez, Alfredo Salvador, José Alberto Hernández Networking Research Group,

More information

Supporting Change-Aware Semantic Web Services

Supporting Change-Aware Semantic Web Services Supporting Change-Aware Semantic Web Services Annika Hinze Department of Computer Science, University of Waikato, New Zealand a.hinze@cs.waikato.ac.nz Abstract. The Semantic Web is not only evolving into

More information

Schema Mappings and Agents Actions in P2P Data Integration System 1

Schema Mappings and Agents Actions in P2P Data Integration System 1 Journal of Universal Computer Science, vol. 14, no. 7 (2008), 1048-1060 submitted: 1/10/07, accepted: 21/1/08, appeared: 1/4/08 J.UCS Schema Mappings and Agents Actions in P2P Data Integration System 1

More information

Load Balancing in Structured Peer to Peer Systems

Load Balancing in Structured Peer to Peer Systems Load Balancing in Structured Peer to Peer Systems DR.K.P.KALIYAMURTHIE 1, D.PARAMESWARI 2 Professor and Head, Dept. of IT, Bharath University, Chennai-600 073 1 Asst. Prof. (SG), Dept. of Computer Applications,

More information

Towards P2P-based Computer Network Management *

Towards P2P-based Computer Network Management * Towards P2P-based Computer Network Management * Hui Xu, and Debao Xiao Department of Computer Science, Huazhong Normal University Wuhan, P.R. China, 430079 xuhui_1004@hotmail.com Abstract Nowadays, the

More information

Load Balancing in Structured Peer to Peer Systems

Load Balancing in Structured Peer to Peer Systems Load Balancing in Structured Peer to Peer Systems Dr.K.P.Kaliyamurthie 1, D.Parameswari 2 1.Professor and Head, Dept. of IT, Bharath University, Chennai-600 073. 2.Asst. Prof.(SG), Dept. of Computer Applications,

More information

An Overview of Search Strategies in Distributed Environments

An Overview of Search Strategies in Distributed Environments The Knowledge Engineering Review, Vol. 00:0, 1 24. c 2004, Cambridge University Press DOI: 10.1017/S000000000000000 Printed in the United Kingdom An Overview of Search Strategies in Distributed Environments

More information

RESEARCH ISSUES IN PEER-TO-PEER DATA MANAGEMENT

RESEARCH ISSUES IN PEER-TO-PEER DATA MANAGEMENT RESEARCH ISSUES IN PEER-TO-PEER DATA MANAGEMENT Bilkent University 1 OUTLINE P2P computing systems Representative P2P systems P2P data management Incentive mechanisms Concluding remarks Bilkent University

More information

Autoconfiguration and maintenance of the IP address in ad-hoc mobile networks

Autoconfiguration and maintenance of the IP address in ad-hoc mobile networks 1 Autoconfiguration and maintenance of the IP address in ad-hoc mobile networks M. Fazio, M. Villari, A. Puliafito Università di Messina, Dipartimento di Matematica Contrada Papardo, Salita Sperone, 98166

More information

Semantic-based Smart Homes: a Multi-Agent Approach

Semantic-based Smart Homes: a Multi-Agent Approach Semantic-based Smart Homes: a Multi-Agent Approach Giuseppe Loseto, Floriano Scioscia, Michele Ruta, Eugenio Di Sciascio Politecnico di Bari, BARI, Italy Outline Home and Building Automation (HBA): state

More information

EXPLOITING FOLKSONOMIES AND ONTOLOGIES IN AN E-BUSINESS APPLICATION

EXPLOITING FOLKSONOMIES AND ONTOLOGIES IN AN E-BUSINESS APPLICATION EXPLOITING FOLKSONOMIES AND ONTOLOGIES IN AN E-BUSINESS APPLICATION Anna Goy and Diego Magro Dipartimento di Informatica, Università di Torino C. Svizzera, 185, I-10149 Italy ABSTRACT This paper proposes

More information

Requirements for Context-dependent Mobile Access to Information Services

Requirements for Context-dependent Mobile Access to Information Services Requirements for Context-dependent Mobile Access to Information Services Augusto Celentano Università Ca Foscari di Venezia Fabio Schreiber, Letizia Tanca Politecnico di Milano MIS 2004, College Park,

More information

Semantic Search in Portals using Ontologies

Semantic Search in Portals using Ontologies Semantic Search in Portals using Ontologies Wallace Anacleto Pinheiro Ana Maria de C. Moura Military Institute of Engineering - IME/RJ Department of Computer Engineering - Rio de Janeiro - Brazil [awallace,anamoura]@de9.ime.eb.br

More information

Integration and Coordination in in both Mediator-Based and Peer-to-Peer Systems

Integration and Coordination in in both Mediator-Based and Peer-to-Peer Systems Dottorato di Ricerca in Ingegneria dell Informazione e sua applicazione nell Industria e nei Servizi Integration and Coordination in in both Mediator-Based and Peer-to-Peer Systems presenter: (pense@inform.unian.it)

More information

Towards Trusted Semantic Service Computing

Towards Trusted Semantic Service Computing Towards Trusted Semantic Service Computing Michel Deriaz University of Geneva, Switzerland Abstract. This paper describes a new prototype of a semantic Service Oriented Architecture (SOA) called Spec Services.

More information

A P2P SERVICE DISCOVERY STRATEGY BASED ON CONTENT

A P2P SERVICE DISCOVERY STRATEGY BASED ON CONTENT A P2P SERVICE DISCOVERY STRATEGY BASED ON CONTENT CATALOGUES Lican Huang Institute of Network & Distributed Computing, Zhejiang Sci-Tech University, No.5, St.2, Xiasha Higher Education Zone, Hangzhou,

More information

Incorporating Semantic Discovery into a Ubiquitous Computing Infrastructure

Incorporating Semantic Discovery into a Ubiquitous Computing Infrastructure Incorporating Semantic Discovery into a Ubiquitous Computing Infrastructure Robert E. McGrath, Anand Ranganathan, M. Dennis Mickunas, and Roy H. Campbell Department of Computer Science, University or Illinois

More information

Architecture-based QoS Prediction for Service-oriented Computing

Architecture-based QoS Prediction for Service-oriented Computing Architecture-based QoS Prediction for Service-oriented Computing Vincenzo Grassi, Raffaela Mirandola, Italy QoS Workshop, Roma, 9-0/6/2004 Service-oriented Computing emerging paradigm for designing, architecting

More information

Content Delivery Network (CDN) and P2P Model

Content Delivery Network (CDN) and P2P Model A multi-agent algorithm to improve content management in CDN networks Agostino Forestiero, forestiero@icar.cnr.it Carlo Mastroianni, mastroianni@icar.cnr.it ICAR-CNR Institute for High Performance Computing

More information

Service Oriented Architecture

Service Oriented Architecture Service Oriented Architecture Charlie Abela Department of Artificial Intelligence charlie.abela@um.edu.mt Last Lecture Web Ontology Language Problems? CSA 3210 Service Oriented Architecture 2 Lecture Outline

More information

A Semantic Marketplace of Peers Hosting Negotiating Intelligent Agents

A Semantic Marketplace of Peers Hosting Negotiating Intelligent Agents A Semantic Marketplace of Peers Hosting Negotiating Intelligent Agents Theodore Patkos and Dimitris Plexousakis Institute of Computer Science, FO.R.T.H. Vassilika Vouton, P.O. Box 1385, GR 71110 Heraklion,

More information

Data Management in P2P Systems: Challenges and Research Issues. Timos Sellis National Technical Univ. of Athens

Data Management in P2P Systems: Challenges and Research Issues. Timos Sellis National Technical Univ. of Athens Data Management in P2P Systems: Challenges and Research Issues Timos Sellis National Technical Univ. of Athens What is P2P? Client Server Architecture Peer-to-Peer Architecture Timos Sellis-NTUA Data Management

More information

Information Services for Smart Grids

Information Services for Smart Grids Smart Grid and Renewable Energy, 2009, 8 12 Published Online September 2009 (http://www.scirp.org/journal/sgre/). ABSTRACT Interconnected and integrated electrical power systems, by their very dynamic

More information

A QoS-Aware Web Service Selection Based on Clustering

A QoS-Aware Web Service Selection Based on Clustering International Journal of Scientific and Research Publications, Volume 4, Issue 2, February 2014 1 A QoS-Aware Web Service Selection Based on Clustering R.Karthiban PG scholar, Computer Science and Engineering,

More information

Using Ontologies to Enhance Data Management in Distributed Environments

Using Ontologies to Enhance Data Management in Distributed Environments Using Ontologies to Enhance Data Management in Distributed Environments Carlos Eduardo Pires 1, Damires Souza 2, Bernadette Lóscio 3, Rosalie Belian 4, Patricia Tedesco 3 and Ana Carolina Salgado 3 1 Federal

More information

A PROXIMITY-AWARE INTEREST-CLUSTERED P2P FILE SHARING SYSTEM

A PROXIMITY-AWARE INTEREST-CLUSTERED P2P FILE SHARING SYSTEM A PROXIMITY-AWARE INTEREST-CLUSTERED P2P FILE SHARING SYSTEM Dr.S. DHANALAKSHMI 1, R. ANUPRIYA 2 1 Prof & Head, 2 Research Scholar Computer Science and Applications, Vivekanandha College of Arts and Sciences

More information

Simulating a File-Sharing P2P Network

Simulating a File-Sharing P2P Network Simulating a File-Sharing P2P Network Mario T. Schlosser, Tyson E. Condie, and Sepandar D. Kamvar Department of Computer Science Stanford University, Stanford, CA 94305, USA Abstract. Assessing the performance

More information

Query Reformulation over Ontology-based Peers (Extended Abstract)

Query Reformulation over Ontology-based Peers (Extended Abstract) Query Reformulation over Ontology-based Peers (Extended Abstract) Diego Calvanese 1, Giuseppe De Giacomo 2, Domenico Lembo 2, Maurizio Lenzerini 2, and Riccardo Rosati 2 1 Faculty of Computer Science,

More information

Ontological Identification of Patterns for Choreographing Business Workflow

Ontological Identification of Patterns for Choreographing Business Workflow University of Aizu, Graduation Thesis. March, 2010 s1140042 1 Ontological Identification of Patterns for Choreographing Business Workflow Seiji Ota s1140042 Supervised by Incheon Paik Abstract Business

More information

Composite Process Oriented Service Discovery in Preserving Business and Timed Relation

Composite Process Oriented Service Discovery in Preserving Business and Timed Relation Composite Process Oriented Service Discovery in Preserving Business and Timed Relation Yu Dai, Lei Yang, Bin Zhang, and Kening Gao College of Information Science and Technology Northeastern University

More information

Some Research Challenges for Big Data Analytics of Intelligent Security

Some Research Challenges for Big Data Analytics of Intelligent Security Some Research Challenges for Big Data Analytics of Intelligent Security Yuh-Jong Hu hu at cs.nccu.edu.tw Emerging Network Technology (ENT) Lab. Department of Computer Science National Chengchi University,

More information

OWL based XML Data Integration

OWL based XML Data Integration OWL based XML Data Integration Manjula Shenoy K Manipal University CSE MIT Manipal, India K.C.Shet, PhD. N.I.T.K. CSE, Suratkal Karnataka, India U. Dinesh Acharya, PhD. ManipalUniversity CSE MIT, Manipal,

More information

Costs and Benefits of Reputation Management Systems

Costs and Benefits of Reputation Management Systems Costs and Benefits of Reputation Management Systems Roberto G. Cascella University of Trento Dipartimento di Ingegneria e Scienza dell Informazione Via Sommarive 14, I-381 Povo (TN), Italy cascella@disi.unitn.it

More information

Interacting the Edutella/JXTA Peer-to-Peer Network with Web Services

Interacting the Edutella/JXTA Peer-to-Peer Network with Web Services Interacting the Edutella/JXTA Peer-to-Peer Network with Web Services Changtao Qu Learning Lab Lower Saxony University of Hannover Expo Plaza 1, D-30539, Hannover, Germany qu @learninglab.de Wolfgang Nejdl

More information

SmartLink: a Web-based editor and search environment for Linked Services

SmartLink: a Web-based editor and search environment for Linked Services SmartLink: a Web-based editor and search environment for Linked Services Stefan Dietze, Hong Qing Yu, Carlos Pedrinaci, Dong Liu, John Domingue Knowledge Media Institute, The Open University, MK7 6AA,

More information

CLOUD BASED PEER TO PEER NETWORK FOR ENTERPRISE DATAWAREHOUSE SHARING

CLOUD BASED PEER TO PEER NETWORK FOR ENTERPRISE DATAWAREHOUSE SHARING CLOUD BASED PEER TO PEER NETWORK FOR ENTERPRISE DATAWAREHOUSE SHARING Basangouda V.K 1,Aruna M.G 2 1 PG Student, Dept of CSE, M.S Engineering College, Bangalore,basangoudavk@gmail.com 2 Associate Professor.,

More information

Dynamic Web Service Calls for Data Integration

Dynamic Web Service Calls for Data Integration JOURNAL OF SOFTWARE, VOL. 1, NO. 1, JULY 2006 1 Dynamic Web Service Calls for Data Integration Salima Benbernou and Mohand-Said Hacid LIRIS- Université Claude Bernard Lyon1, 69622 Villeurbanne, France

More information

WSPeer - An Interface to Web Service Hosting and Invocation

WSPeer - An Interface to Web Service Hosting and Invocation WSPeer - An Interface to Web Service Hosting and Invocation Andrew Harrison School of Computer Science, Cardiff University Email: a.b.harrison@cs.cf.ac.uk Dr Ian J. Taylor School of Computer Science, Cardiff

More information

A Hybrid Approach for Ontology Integration

A Hybrid Approach for Ontology Integration A Hybrid Approach for Ontology Integration Ahmed Alasoud Volker Haarslev Nematollaah Shiri Concordia University Concordia University Concordia University 1455 De Maisonneuve Blvd. West 1455 De Maisonneuve

More information

UNIVERSITY OF TRENTO A PEER-TO-PEER DATABASE MANAGEMENT SYSTEM. Albena Roshelova. June 2004. Technical Report # DIT-04-057

UNIVERSITY OF TRENTO A PEER-TO-PEER DATABASE MANAGEMENT SYSTEM. Albena Roshelova. June 2004. Technical Report # DIT-04-057 UNIVERSITY OF TRENTO DEPARTMENT OF INFORMATION AND COMMUNICATION TECHNOLOGY 38050 Povo Trento (Italy), Via Sommarive 14 http://www.dit.unitn.it A PEER-TO-PEER DATABASE MANAGEMENT SYSTEM Albena Roshelova

More information

LOAD BALANCING WITH PARTIAL KNOWLEDGE OF SYSTEM

LOAD BALANCING WITH PARTIAL KNOWLEDGE OF SYSTEM LOAD BALANCING WITH PARTIAL KNOWLEDGE OF SYSTEM IN PEER TO PEER NETWORKS R. Vijayalakshmi and S. Muthu Kumarasamy Dept. of Computer Science & Engineering, S.A. Engineering College Anna University, Chennai,

More information

ONTOLOGY-BASED APPROACH TO DEVELOPMENT OF ADJUSTABLE KNOWLEDGE INTERNET PORTAL FOR SUPPORT OF RESEARCH ACTIVITIY

ONTOLOGY-BASED APPROACH TO DEVELOPMENT OF ADJUSTABLE KNOWLEDGE INTERNET PORTAL FOR SUPPORT OF RESEARCH ACTIVITIY ONTOLOGY-BASED APPROACH TO DEVELOPMENT OF ADJUSTABLE KNOWLEDGE INTERNET PORTAL FOR SUPPORT OF RESEARCH ACTIVITIY Yu. A. Zagorulko, O. I. Borovikova, S. V. Bulgakov, E. A. Sidorova 1 A.P.Ershov s Institute

More information

An ARIS-based Transformation Approach to Semantic Web Service Development

An ARIS-based Transformation Approach to Semantic Web Service Development An ARIS-based Transformation Approach to Semantic Web Development Cheng-Leong Ang ϕ, Yuan Gu, Olga Sourina, and Robert Kheng Leng Gay Nanyang Technological University, Singapore eclang@ntu.edu.sg ϕ Abstract

More information

A Case Study of Question Answering in Automatic Tourism Service Packaging

A Case Study of Question Answering in Automatic Tourism Service Packaging BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 13, Special Issue Sofia 2013 Print ISSN: 1311-9702; Online ISSN: 1314-4081 DOI: 10.2478/cait-2013-0045 A Case Study of Question

More information

The Role of Ontologies in Data Integration

The Role of Ontologies in Data Integration The Role of Ontologies in Data Integration Isabel F. Cruz Huiyong Xiao ADVIS Lab Department of Computer Science University of Illinois at Chicago, USA {ifc hxiao}@cs.uic.edu Abstract In this paper, we

More information

A Method of Web Service Discovery based on Semantic Message Bipartite Matching for Remote Medical System

A Method of Web Service Discovery based on Semantic Message Bipartite Matching for Remote Medical System 1, 2 and 3 Neusoft Institute of Information, China, Dalian 1 zhangyang@neusoft.edu.cn, 2 liubingyue@neusoft.edu.cn, 3 wanghong@neusoft.edu.cn Received 13 January 2009; received in revised form 3 June 2009;

More information

Exploiting peer group concept for adaptive and highly available services

Exploiting peer group concept for adaptive and highly available services Exploiting peer group concept for adaptive and highly available services Muhammad Asif Jan Centre for European Nuclear Research (CERN) Switzerland Fahd Ali Zahid, Mohammad Moazam Fraz Foundation University,

More information

Analysis on Leveraging social networks for p2p content-based file sharing in disconnected manets

Analysis on Leveraging social networks for p2p content-based file sharing in disconnected manets Analysis on Leveraging social networks for p2p content-based file sharing in disconnected manets # K.Deepika 1, M.Tech Computer Science Engineering, Mail: medeepusony@gmail.com # K.Meena 2, Assistant Professor

More information

PROPOSAL AND EVALUATION OF A COOPERATIVE MECHANISM FOR HYBRID P2P FILE-SHARING NETWORKS

PROPOSAL AND EVALUATION OF A COOPERATIVE MECHANISM FOR HYBRID P2P FILE-SHARING NETWORKS PROPOSAL AND EVALUATION OF A COOPERATIVE MECHANISM FOR HYBRID P2P FILE-SHARING NETWORKS Hongye Fu, Naoki Wakamiya, Masayuki Murata Graduate School of Information Science and Technology Osaka University

More information

On the Standardization of Semantic Web Services-based Network Monitoring Operations

On the Standardization of Semantic Web Services-based Network Monitoring Operations On the Standardization of Semantic Web Services-based Network Monitoring Operations ChenglingZhao^, ZihengLiu^, YanfengWang^ The Department of Information Techonlogy, HuaZhong Normal University; Wuhan,

More information

CONTEMPORARY SEMANTIC WEB SERVICE FRAMEWORKS: AN OVERVIEW AND COMPARISONS

CONTEMPORARY SEMANTIC WEB SERVICE FRAMEWORKS: AN OVERVIEW AND COMPARISONS CONTEMPORARY SEMANTIC WEB SERVICE FRAMEWORKS: AN OVERVIEW AND COMPARISONS Keyvan Mohebbi 1, Suhaimi Ibrahim 2, Norbik Bashah Idris 3 1 Faculty of Computer Science and Information Systems, Universiti Teknologi

More information

Digital libraries of the future and the role of libraries

Digital libraries of the future and the role of libraries Digital libraries of the future and the role of libraries Donatella Castelli ISTI-CNR, Pisa, Italy Abstract Purpose: To introduce the digital libraries of the future, their enabling technologies and their

More information

SERENITY Pattern-based Software Development Life-Cycle

SERENITY Pattern-based Software Development Life-Cycle SERENITY Pattern-based Software Development Life-Cycle Francisco Sanchez-Cid, Antonio Maña Computer Science Department University of Malaga. Spain {cid, amg}@lcc.uma.es Abstract Most of current methodologies

More information

Optimised Realistic Test Input Generation

Optimised Realistic Test Input Generation Optimised Realistic Test Input Generation Mustafa Bozkurt and Mark Harman {m.bozkurt,m.harman}@cs.ucl.ac.uk CREST Centre, Department of Computer Science, University College London. Malet Place, London

More information

How To Model Web Service Quality Composition

How To Model Web Service Quality Composition Web Service Quality Composition Modelling Ganna Frankova DIT - University of Trento, Via Sommarive, 14, 38050 Povo-Trento, Italy email: ganna.frankova@dit.unitn.it Abstract. The critical issue of web services

More information

The Role and uses of Peer-to-Peer in file-sharing. Computer Communication & Distributed Systems EDA 390

The Role and uses of Peer-to-Peer in file-sharing. Computer Communication & Distributed Systems EDA 390 The Role and uses of Peer-to-Peer in file-sharing Computer Communication & Distributed Systems EDA 390 Jenny Bengtsson Prarthanaa Khokar jenben@dtek.chalmers.se prarthan@dtek.chalmers.se Gothenburg, May

More information

SWAP: ONTOLOGY-BASED KNOWLEDGE MANAGEMENT WITH PEER-TO-PEER TECHNOLOGY

SWAP: ONTOLOGY-BASED KNOWLEDGE MANAGEMENT WITH PEER-TO-PEER TECHNOLOGY SWAP: ONTOLOGY-BASED KNOWLEDGE MANAGEMENT WITH PEER-TO-PEER TECHNOLOGY M. EHRIG, C. TEMPICH AND S. STAAB Institute AIFB University of Karlsruhe 76128 Karlsruhe, Germany E-mail: {meh,cte,sst}@aifb.uni-karlsruhe.de

More information

Combining SAWSDL, OWL DL and UDDI for Semantically Enhanced Web Service Discovery

Combining SAWSDL, OWL DL and UDDI for Semantically Enhanced Web Service Discovery Combining SAWSDL, OWL DL and UDDI for Semantically Enhanced Web Service Discovery Dimitrios Kourtesis, Iraklis Paraskakis SEERC South East European Research Centre, Greece Research centre of the University

More information

A Workbench for Prototyping XML Data Exchange (extended abstract)

A Workbench for Prototyping XML Data Exchange (extended abstract) A Workbench for Prototyping XML Data Exchange (extended abstract) Renzo Orsini and Augusto Celentano Università Ca Foscari di Venezia, Dipartimento di Informatica via Torino 155, 30172 Mestre (VE), Italy

More information

Evaluating Semantic Web Service Tools using the SEALS platform

Evaluating Semantic Web Service Tools using the SEALS platform Evaluating Semantic Web Service Tools using the SEALS platform Liliana Cabral 1, Ioan Toma 2 1 Knowledge Media Institute, The Open University, Milton Keynes, UK 2 STI Innsbruck, University of Innsbruck,

More information

D1.1 Service Discovery system: Load balancing mechanisms

D1.1 Service Discovery system: Load balancing mechanisms D1.1 Service Discovery system: Load balancing mechanisms VERSION 1.0 DATE 2011 EDITORIAL MANAGER Eddy Caron AUTHORS STAFF Eddy Caron, Cédric Tedeschi Copyright ANR SPADES. 08-ANR-SEGI-025. Contents Introduction

More information

Model-driven Adapter Development for Web Services Interactions

Model-driven Adapter Development for Web Services Interactions Model-driven Adapter Development for Web Services Interactions Hamid Reza Motahari Nezhad 1;2 1 The School of Computer Science and Engineering, The University Of New South Wales Sydney, NSW 2052, Australia

More information

Mobile App Discovery through Conceptual Models

Mobile App Discovery through Conceptual Models Mobile App Discovery through Conceptual Models Jasmin Brakmic, BSc Supervisor: Prof. Dr. Dimitris Karagiannis Research Group Knowledge Engineering University of Vienna, 24.01.2013 Agenda 1. Motivation

More information

Balancing Gossip Exchanges in Networks with Firewalls

Balancing Gossip Exchanges in Networks with Firewalls Balancing Gossip Exchanges in Networks with Firewalls João Leitão INESC-ID/IST jleitao@gsd.inesc-id.pt Robbert van Renesse Cornell University rvr@cs.cornell.edu Luís Rodrigues INESC-ID/IST ler@ist.utl.pt

More information

INTERNATIONAL JOURNAL OF ENGINEERING SCIENCES & RESEARCH TECHNOLOGY

INTERNATIONAL JOURNAL OF ENGINEERING SCIENCES & RESEARCH TECHNOLOGY [Kavita, 2(4): April, 2013] ISSN: 2277-9655 IJESRT INTERNATIONAL JOURNAL OF ENGINEERING SCIENCES & RESEARCH TECHNOLOGY Histogram Based Live Streaming in Peer to Peer Dynamic Balancing & Clustering System

More information

Automatic Annotation Wrapper Generation and Mining Web Database Search Result

Automatic Annotation Wrapper Generation and Mining Web Database Search Result Automatic Annotation Wrapper Generation and Mining Web Database Search Result V.Yogam 1, K.Umamaheswari 2 1 PG student, ME Software Engineering, Anna University (BIT campus), Trichy, Tamil nadu, India

More information

An Ontology Based Method to Solve Query Identifier Heterogeneity in Post- Genomic Clinical Trials

An Ontology Based Method to Solve Query Identifier Heterogeneity in Post- Genomic Clinical Trials ehealth Beyond the Horizon Get IT There S.K. Andersen et al. (Eds.) IOS Press, 2008 2008 Organizing Committee of MIE 2008. All rights reserved. 3 An Ontology Based Method to Solve Query Identifier Heterogeneity

More information

AN EFFICIENT DISTRIBUTED CONTROL LAW FOR LOAD BALANCING IN CONTENT DELIVERY NETWORKS

AN EFFICIENT DISTRIBUTED CONTROL LAW FOR LOAD BALANCING IN CONTENT DELIVERY NETWORKS Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology IJCSMC, Vol. 3, Issue. 9, September 2014,

More information

Semantically Enhanced Web Personalization Approaches and Techniques

Semantically Enhanced Web Personalization Approaches and Techniques Semantically Enhanced Web Personalization Approaches and Techniques Dario Vuljani, Lidia Rovan, Mirta Baranovi Faculty of Electrical Engineering and Computing, University of Zagreb Unska 3, HR-10000 Zagreb,

More information

An Ants Algorithm to Improve Energy Efficient Based on Secure Autonomous Routing in WSN

An Ants Algorithm to Improve Energy Efficient Based on Secure Autonomous Routing in WSN An Ants Algorithm to Improve Energy Efficient Based on Secure Autonomous Routing in WSN *M.A.Preethy, PG SCHOLAR DEPT OF CSE #M.Meena,M.E AP/CSE King College Of Technology, Namakkal Abstract Due to the

More information

A Secure Mediator for Integrating Multiple Level Access Control Policies

A Secure Mediator for Integrating Multiple Level Access Control Policies A Secure Mediator for Integrating Multiple Level Access Control Policies Isabel F. Cruz Rigel Gjomemo Mirko Orsini ADVIS Lab Department of Computer Science University of Illinois at Chicago {ifc rgjomemo

More information

Collaboration on the Social Semantic Desktop. Groza, Tudor; Handschuh, Siegfried

Collaboration on the Social Semantic Desktop. Groza, Tudor; Handschuh, Siegfried Provided by the author(s) and NUI Galway in accordance with publisher policies. Please cite the published version when available. Title Collaboration on the Social Semantic Desktop Author(s) Groza, Tudor;

More information

Super-Agent Based Reputation Management with a Practical Reward Mechanism in Decentralized Systems

Super-Agent Based Reputation Management with a Practical Reward Mechanism in Decentralized Systems Super-Agent Based Reputation Management with a Practical Reward Mechanism in Decentralized Systems Yao Wang, Jie Zhang, and Julita Vassileva Department of Computer Science, University of Saskatchewan,

More information

Grid Data Integration Based on Schema Mapping

Grid Data Integration Based on Schema Mapping Grid Data Integration Based on Schema Mapping Carmela Comito and Domenico Talia DEIS, University of Calabria, Via P. Bucci 41 c, 87036 Rende, Italy {ccomito, talia}@deis.unical.it http://www.deis.unical.it/

More information

Efficient Intelligent Secure for Web Service Composition

Efficient Intelligent Secure for Web Service Composition Somayeh Karimi, Seyed Morteza Babamir Islamic Azad University, Meymeh Branch, Department of Computer, Meymeh, Iran University of Kashan, Department of Computer Engineering, Kashan, Iran S_karimi@iaumeymeh.ac.ir,

More information

Introduction to UDDI: Important Features and Functional Concepts

Introduction to UDDI: Important Features and Functional Concepts : October 2004 Organization for the Advancement of Structured Information Standards www.oasis-open.org TABLE OF CONTENTS OVERVIEW... 4 TYPICAL APPLICATIONS OF A UDDI REGISTRY... 4 A BRIEF HISTORY OF UDDI...

More information

PEER-TO-PEER (P2P) systems have emerged as an appealing

PEER-TO-PEER (P2P) systems have emerged as an appealing IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, VOL. 21, NO. 4, APRIL 2009 595 Histogram-Based Global Load Balancing in Structured Peer-to-Peer Systems Quang Hieu Vu, Member, IEEE, Beng Chin Ooi,

More information

Topic Communities in P2P Networks

Topic Communities in P2P Networks Topic Communities in P2P Networks Joint work with A. Löser (IBM), C. Tempich (AIFB) SNA@ESWC 2006 Budva, Montenegro, June 12, 2006 Two opposite challenges when considering Social Networks Analysis Nodes/Agents

More information

Locality Based Protocol for MultiWriter Replication systems

Locality Based Protocol for MultiWriter Replication systems Locality Based Protocol for MultiWriter Replication systems Lei Gao Department of Computer Science The University of Texas at Austin lgao@cs.utexas.edu One of the challenging problems in building replication

More information

A Semantic Approach for Access Control in Web Services

A Semantic Approach for Access Control in Web Services A Semantic Approach for Access Control in Web Services M. I. Yagüe, J. Mª Troya Computer Science Department, University of Málaga, Málaga, Spain {yague, troya}@lcc.uma.es Abstract One of the most important

More information

A Semantically Enriched Competency Management System to Support the Analysis of a Web-based Research Network

A Semantically Enriched Competency Management System to Support the Analysis of a Web-based Research Network A Semantically Enriched Competency Management System to Support the Analysis of a Web-based Research Network Paola Velardi University of Roma La Sapienza Italy velardi@di.uniroma1.it Alessandro Cucchiarelli

More information