The advent of Service Oriented Architecture makes services the most flexible, platform-independent choice for exposing and integrating business functionality across a network. However, the lack of service discovery mechanisms, that go beyond simple keyword search to enable automated late-binding of service requesters to providers, remains a major problem. Realistic late-binding involves matchmaking of client requests with service descriptions, based on frequently changing fine-grained client requests, and dynamically changing service functionality. The intricacies of service functionality cannot be specified by generic static descriptions since the functionality offered by the service may depend on the client at hand, their specific request and the service's current capabilities. In this paper, we propose a semantic framework supporting dynamic data fetching from services during the discovery phase on service instance level entailing a communication overhead which we aim to minimize.
{"title":"Towards Optimized Data Fetching for Service Discovery","authors":"Maciej Zaremba, T. Vitvar, Matthew Moran","doi":"10.1109/ECOWS.2007.28","DOIUrl":"https://doi.org/10.1109/ECOWS.2007.28","url":null,"abstract":"The advent of Service Oriented Architecture makes services the most flexible, platform-independent choice for exposing and integrating business functionality across a network. However, the lack of service discovery mechanisms, that go beyond simple keyword search to enable automated late-binding of service requesters to providers, remains a major problem. Realistic late-binding involves matchmaking of client requests with service descriptions, based on frequently changing fine-grained client requests, and dynamically changing service functionality. The intricacies of service functionality cannot be specified by generic static descriptions since the functionality offered by the service may depend on the client at hand, their specific request and the service's current capabilities. In this paper, we propose a semantic framework supporting dynamic data fetching from services during the discovery phase on service instance level entailing a communication overhead which we aim to minimize.","PeriodicalId":436126,"journal":{"name":"Fifth European Conference on Web Services (ECOWS'07)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125506472","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The semantic annotation of Web services capabilities with ontological information aims at providing the necessary infrastructure for facilitating efficient and accurate service discovery. The main idea is to apply reasoning techniques over semantically enhanced Web service requests and advertisements in order to determine Web services that meet certain requirements. In this paper we present our work for introducing similarity measures inspired from the domain of Object-Oriented paradigm for ontology concept matching. Our work focuses on the utilization of such measures over an Object-Oriented schema that is created through mapping rules of OWL constructs and semantics into the Object-Oriented model. The goal of the approach is to combine the Object-Oriented representation of the information and the reasoning over OWL semantics in order to enhance the retrieval of semantically relevant, to some criteria, Web services.
{"title":"Object-Oriented Similarity Measures for Semantic Web Service Matchmaking","authors":"G. Meditskos, Nick Bassiliades","doi":"10.1109/ECOWS.2007.17","DOIUrl":"https://doi.org/10.1109/ECOWS.2007.17","url":null,"abstract":"The semantic annotation of Web services capabilities with ontological information aims at providing the necessary infrastructure for facilitating efficient and accurate service discovery. The main idea is to apply reasoning techniques over semantically enhanced Web service requests and advertisements in order to determine Web services that meet certain requirements. In this paper we present our work for introducing similarity measures inspired from the domain of Object-Oriented paradigm for ontology concept matching. Our work focuses on the utilization of such measures over an Object-Oriented schema that is created through mapping rules of OWL constructs and semantics into the Object-Oriented model. The goal of the approach is to combine the Object-Oriented representation of the information and the reasoning over OWL semantics in order to enhance the retrieval of semantically relevant, to some criteria, Web services.","PeriodicalId":436126,"journal":{"name":"Fifth European Conference on Web Services (ECOWS'07)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114528583","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Execution monitoring of complex web service process models is critical for effective management and control of web services based systems. During the composite process model execution or as part of the after-execution analysis complex event patterns (called composite events) consisting of various primitive events need to be detected. In this paper we introduce the concept of primitive semantic events that are used for monitoring of semantic web services, based on OWL-S. Next, we describe mechanisms for specification and detection of composite events. We present a language based on an event algebra combined with semantic event-filtering expressions using description logics atoms enriched with OWL datatypes and SWRL built-ins. Such a language can be used for specification of composite events allowing a detection of complex event patterns in the flow of primitive events. Furthermore, the semantic filtering allows detection of such events that would otherwise be impossible without the use of semantic descriptions. We also discuss detection mechanisms suitable for runtime execution and after-execution analysis.
{"title":"Specifying and Monitoring Composite Events for Semantic Web Services","authors":"R. Vaculín, K. Sycara","doi":"10.1109/ECOWS.2007.29","DOIUrl":"https://doi.org/10.1109/ECOWS.2007.29","url":null,"abstract":"Execution monitoring of complex web service process models is critical for effective management and control of web services based systems. During the composite process model execution or as part of the after-execution analysis complex event patterns (called composite events) consisting of various primitive events need to be detected. In this paper we introduce the concept of primitive semantic events that are used for monitoring of semantic web services, based on OWL-S. Next, we describe mechanisms for specification and detection of composite events. We present a language based on an event algebra combined with semantic event-filtering expressions using description logics atoms enriched with OWL datatypes and SWRL built-ins. Such a language can be used for specification of composite events allowing a detection of complex event patterns in the flow of primitive events. Furthermore, the semantic filtering allows detection of such events that would otherwise be impossible without the use of semantic descriptions. We also discuss detection mechanisms suitable for runtime execution and after-execution analysis.","PeriodicalId":436126,"journal":{"name":"Fifth European Conference on Web Services (ECOWS'07)","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125448847","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
With the rapid proliferation of Web services as the medium of choice to securely publish application services beyond the firewall, the importance of accurate, yet flexible matchmaking of similar services gains importance both for the human user and for dynamic composition engines. In this paper, we present a novel approach that utilizes the case based reasoning methodology for modelling dynamic Web service discovery and matchmaking, and investigate the use of case adaptation for service composition. Our framework considers Web services execution experiences in the decision making process and is highly adaptable to the service requester constraints. The framework also utilizes OWL semantic descriptions extensively for implementing both the components of the CBR engine and the matchmaking profile of the Web services.
{"title":"Semantic-Driven Matchmaking and Composition of Web Services Using Case-Based Reasoning","authors":"D. Thakker, T. Osman, D. Al-Dabass","doi":"10.1109/ECOWS.2007.22","DOIUrl":"https://doi.org/10.1109/ECOWS.2007.22","url":null,"abstract":"With the rapid proliferation of Web services as the medium of choice to securely publish application services beyond the firewall, the importance of accurate, yet flexible matchmaking of similar services gains importance both for the human user and for dynamic composition engines. In this paper, we present a novel approach that utilizes the case based reasoning methodology for modelling dynamic Web service discovery and matchmaking, and investigate the use of case adaptation for service composition. Our framework considers Web services execution experiences in the decision making process and is highly adaptable to the service requester constraints. The framework also utilizes OWL semantic descriptions extensively for implementing both the components of the CBR engine and the matchmaking profile of the Web services.","PeriodicalId":436126,"journal":{"name":"Fifth European Conference on Web Services (ECOWS'07)","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121937567","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
M. Mazzucco, I. Mitrani, J. Palmer, M. Fisher, P. McKee
An architecture of a hosting system is presented, where a number of servers are used to provide different types of web services to paying customers. There are charges for running jobs and penalties for failing to meet agreed QualityofService requirements. The objective is to maximize the total average revenue per unit time. Dynamic policies for making server allocation and job admission decisions are introduced and evaluated. The results of several experiments with a real implementation of the architecture are described.
{"title":"Web Service Hosting and Revenue Maximization","authors":"M. Mazzucco, I. Mitrani, J. Palmer, M. Fisher, P. McKee","doi":"10.1109/ECOWS.2007.8","DOIUrl":"https://doi.org/10.1109/ECOWS.2007.8","url":null,"abstract":"An architecture of a hosting system is presented, where a number of servers are used to provide different types of web services to paying customers. There are charges for running jobs and penalties for failing to meet agreed QualityofService requirements. The objective is to maximize the total average revenue per unit time. Dynamic policies for making server allocation and job admission decisions are introduced and evaluated. The results of several experiments with a real implementation of the architecture are described.","PeriodicalId":436126,"journal":{"name":"Fifth European Conference on Web Services (ECOWS'07)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133355010","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Workflow languages provide a natural way to express business processes, and therefore they are preferred over general-purpose programming languages to specify such processes. However, current workflow languages offer no support for separating crosscutting concerns which results in workflows that are hard to maintain and evolve. Recent research introduces aspect-oriented extensions to these languages, but many advanced features of aspect-oriented programming technology are still unavailable for workflow languages. In this paper we present the implementation of one such advanced feature: "stateful aspects". We introduce a high-level, logic-based pointcut language to express aspect activation depending on past and current state of the workflow execution. We propose a weaving strategy based on finite state automata in order to transparently weave history tracking code in the workflow. Our approach is implemented as an extension of the Padus AOP language for WS-BPEL.
{"title":"History-Based Aspect Weaving for WS-BPEL Using Padus","authors":"Mathieu Braem, Dimitri Gheysels","doi":"10.1109/ECOWS.2007.27","DOIUrl":"https://doi.org/10.1109/ECOWS.2007.27","url":null,"abstract":"Workflow languages provide a natural way to express business processes, and therefore they are preferred over general-purpose programming languages to specify such processes. However, current workflow languages offer no support for separating crosscutting concerns which results in workflows that are hard to maintain and evolve. Recent research introduces aspect-oriented extensions to these languages, but many advanced features of aspect-oriented programming technology are still unavailable for workflow languages. In this paper we present the implementation of one such advanced feature: \"stateful aspects\". We introduce a high-level, logic-based pointcut language to express aspect activation depending on past and current state of the workflow execution. We propose a weaving strategy based on finite state automata in order to transparently weave history tracking code in the workflow. Our approach is implemented as an extension of the Padus AOP language for WS-BPEL.","PeriodicalId":436126,"journal":{"name":"Fifth European Conference on Web Services (ECOWS'07)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126429070","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
José A. García, Roi Blanco, Antonio Blanco, J. París
This paper presents a study evaluation of the SOAP [13] protocol performance between two different implementations: Java (Axis2) [2] and Erlang. This comparison has been carried out using several testbeds with input and output data of different sizes. More concretely, we developed three different web services representing typical scenarios likely to be found in real environments. The evaluation is two-fold: we measured both the number of requests per second answered (throughput) by each server and the response to a common server workload, mixing stress and stand-by phases. The Erlang [3] functional programming language claims to be specifically designed and suited for distributed, reliable and soft real-time concurrent systems. Moreover, its built-in lightweight process management and easiness of replication within distributed environments stand out Erlang as an appealing choice for service oriented architectures (SOAs) [7]. On the other hand, we compared this new approximation with the well-known Apache Axis2 project, as it is widely employed on the Web Services field by the Java community. This work allows us to conclude that the Erlang server is better when the computational cost of the web service is low, whereas the Axis2 server is more efficient as the service workload increases.
{"title":"A Comparative Performance Evaluation of Different Implementations of the SOAP Protocol.","authors":"José A. García, Roi Blanco, Antonio Blanco, J. París","doi":"10.1109/ECOWS.2007.16","DOIUrl":"https://doi.org/10.1109/ECOWS.2007.16","url":null,"abstract":"This paper presents a study evaluation of the SOAP [13] protocol performance between two different implementations: Java (Axis2) [2] and Erlang. This comparison has been carried out using several testbeds with input and output data of different sizes. More concretely, we developed three different web services representing typical scenarios likely to be found in real environments. The evaluation is two-fold: we measured both the number of requests per second answered (throughput) by each server and the response to a common server workload, mixing stress and stand-by phases. The Erlang [3] functional programming language claims to be specifically designed and suited for distributed, reliable and soft real-time concurrent systems. Moreover, its built-in lightweight process management and easiness of replication within distributed environments stand out Erlang as an appealing choice for service oriented architectures (SOAs) [7]. On the other hand, we compared this new approximation with the well-known Apache Axis2 project, as it is widely employed on the Web Services field by the Java community. This work allows us to conclude that the Erlang server is better when the computational cost of the web service is low, whereas the Axis2 server is more efficient as the service workload increases.","PeriodicalId":436126,"journal":{"name":"Fifth European Conference on Web Services (ECOWS'07)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129535400","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The success of the Web Service (WS) paradigm has led to a proliferation of available WSs, which are advertised in WS registries. While sophisticated semantic WS discovery algorithms are operating on these registries to return matchmaking results with high precision and recall, many functionally-equivalent WSs are returned. The solution to the above problem comes in terms of semantic QoS-based description and discovery of WSs. We have already presented a rich and extensible ontology language for QoS-based WS description called OWL-Q. We have also proposed a semantic QoS metric matching algorithm. Based on this algorithm, we have extended a CSP-based approach for QoS-based WS discovery. In this paper, we firstly analyze the evolution of OWL-Q and its extension with SWRL rules, we propose a modification to the metric matching algorithm and we show the way the metric alignment process takes place. Then we propose two novel semantic QoS-based WS Discovery algorithms that return matches even for over-constrained QoS-based WS requests. The first one deals with unary constraints while the second one is more generic. Finally, implementa- tion aspects of our QoS-based WS discovery system are discussed.
{"title":"Semantic QoS-based Web Service Discovery Algorithms","authors":"K. Kritikos, D. Plexousakis","doi":"10.1109/ECOWS.2007.20","DOIUrl":"https://doi.org/10.1109/ECOWS.2007.20","url":null,"abstract":"The success of the Web Service (WS) paradigm has led to a proliferation of available WSs, which are advertised in WS registries. While sophisticated semantic WS discovery algorithms are operating on these registries to return matchmaking results with high precision and recall, many functionally-equivalent WSs are returned. The solution to the above problem comes in terms of semantic QoS-based description and discovery of WSs. We have already presented a rich and extensible ontology language for QoS-based WS description called OWL-Q. We have also proposed a semantic QoS metric matching algorithm. Based on this algorithm, we have extended a CSP-based approach for QoS-based WS discovery. In this paper, we firstly analyze the evolution of OWL-Q and its extension with SWRL rules, we propose a modification to the metric matching algorithm and we show the way the metric alignment process takes place. Then we propose two novel semantic QoS-based WS Discovery algorithms that return matches even for over-constrained QoS-based WS requests. The first one deals with unary constraints while the second one is more generic. Finally, implementa- tion aspects of our QoS-based WS discovery system are discussed.","PeriodicalId":436126,"journal":{"name":"Fifth European Conference on Web Services (ECOWS'07)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127230515","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Automated discovery and composition of Web services and the representation of service semantics required to automate these tasks are active research areas that play a large role in current work on service oriented architectures. In this paper, we investigate the feasibility of service composition powered by a consistency-based approach for candidate selection during composition. The modeling restraints imposed by the existing proposals for candidate selection often result in undesired implications in the form of unintuitive candidates during composition. We formulate a consistency-based candidate selection procedure, which uses specifications based on classical software engineering notations (UML and OCL), and use the selection procedure within a configuration based web service composition setting. The consistency-based matchmaking technique is robust in handling overspecified profiles, assumes a closed world by default and provides provisions to include 'nonexistence' semantics in addition to the standard formalisms. Finally, we formulate service composition as a constraint satisfaction problem (CSP) and provide a CSP based algorithm which uses the consistency-based semantic matchmaking scheme while enabling interactive operation.
{"title":"Service Composition with Consistency-Based Matchmaking: A CSP-Based Approach","authors":"R. Thiagarajan, M. Stumptner","doi":"10.1109/ECOWS.2007.26","DOIUrl":"https://doi.org/10.1109/ECOWS.2007.26","url":null,"abstract":"Automated discovery and composition of Web services and the representation of service semantics required to automate these tasks are active research areas that play a large role in current work on service oriented architectures. In this paper, we investigate the feasibility of service composition powered by a consistency-based approach for candidate selection during composition. The modeling restraints imposed by the existing proposals for candidate selection often result in undesired implications in the form of unintuitive candidates during composition. We formulate a consistency-based candidate selection procedure, which uses specifications based on classical software engineering notations (UML and OCL), and use the selection procedure within a configuration based web service composition setting. The consistency-based matchmaking technique is robust in handling overspecified profiles, assumes a closed world by default and provides provisions to include 'nonexistence' semantics in addition to the standard formalisms. Finally, we formulate service composition as a constraint satisfaction problem (CSP) and provide a CSP based algorithm which uses the consistency-based semantic matchmaking scheme while enabling interactive operation.","PeriodicalId":436126,"journal":{"name":"Fifth European Conference on Web Services (ECOWS'07)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133132580","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The current Web service technology brought a new potential to the Web of services. However, the success of Web services still depends on resolving three fundamental challenges, namely search, integration and mediation. In this paper we define an extended Web service stack enabling total or partial automation of web service provisioning process. With the goal of a maximal Web standards compliance, we describe various types of service semantics, use RDF Schema (RDFS) to define a pragmatic meaning for those descriptions, and use Semantic Annotations for WSDL and XML Schema (SAWSDL) to define a place for a semantic description in a Web service. We elaborate on the existing SAWSDL specifications and define precise rules for semantic annotations of Web services.
当前的Web服务技术为Web of services带来了新的潜力。然而，Web服务的成功仍然取决于解决三个基本挑战，即搜索、集成和中介。在本文中，我们定义了一个扩展的Web服务栈，可以实现Web服务提供过程的全部或部分自动化。为了最大限度地遵从Web标准，我们描述了各种类型的服务语义，使用RDF模式(RDFS)定义这些描述的实用意义，并使用WSDL和XML模式的语义注释(SAWSDL)定义语义描述在Web服务中的位置。我们详细介绍了现有的SAWSDL规范，并为Web服务的语义注释定义了精确的规则。
{"title":"WSMO-Lite: lightweight semantic descriptions for services on the web","authors":"T. Vitvar, J. Kopecký, Maciej Zaremba, D. Fensel","doi":"10.1109/ECOWS.2007.30","DOIUrl":"https://doi.org/10.1109/ECOWS.2007.30","url":null,"abstract":"The current Web service technology brought a new potential to the Web of services. However, the success of Web services still depends on resolving three fundamental challenges, namely search, integration and mediation. In this paper we define an extended Web service stack enabling total or partial automation of web service provisioning process. With the goal of a maximal Web standards compliance, we describe various types of service semantics, use RDF Schema (RDFS) to define a pragmatic meaning for those descriptions, and use Semantic Annotations for WSDL and XML Schema (SAWSDL) to define a place for a semantic description in a Web service. We elaborate on the existing SAWSDL specifications and define precise rules for semantic annotations of Web services.","PeriodicalId":436126,"journal":{"name":"Fifth European Conference on Web Services (ECOWS'07)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122358148","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：