Dynamic selection and composition of autonomous and loosely-coupled Web services is increasingly used to automate business processes. The typical long-running characteristic of business processes imposes new management challenges such as dynamic adaptation of running process instances. To address this, we developed a policy-based framework, named manageable and adaptable service compositions (MASC) , to declaratively specify policies that govern: (1) discovery and selection of services to be used, (2) monitoring to detect the need for adaptation, (3) reconfiguration and adaptation of the process to handle special cases (e.g., context-dependant behavior) and recover from typical faults in service-based processes. The identified constructs are executed by a lightweight service-oriented management middleware named MASC middleware. We implemented a MASC proof-of-concept prototype and evaluated it on stock trading case study scenarios. We conducted extensive studies to demonstrate the feasibility of the proposed techniques and illustrate the benefits of our approach in providing adaptive composite services using the policy-based approach. Our performance and scalability studies indicate that MASC middleware is scalable and the introduced overhead are acceptable.
{"title":"Dynamic Binding Framework for Adaptive Web Services","authors":"A. Erradi, P. Maheshwari","doi":"10.1109/ICIW.2008.121","DOIUrl":"https://doi.org/10.1109/ICIW.2008.121","url":null,"abstract":"Dynamic selection and composition of autonomous and loosely-coupled Web services is increasingly used to automate business processes. The typical long-running characteristic of business processes imposes new management challenges such as dynamic adaptation of running process instances. To address this, we developed a policy-based framework, named manageable and adaptable service compositions (MASC) , to declaratively specify policies that govern: (1) discovery and selection of services to be used, (2) monitoring to detect the need for adaptation, (3) reconfiguration and adaptation of the process to handle special cases (e.g., context-dependant behavior) and recover from typical faults in service-based processes. The identified constructs are executed by a lightweight service-oriented management middleware named MASC middleware. We implemented a MASC proof-of-concept prototype and evaluated it on stock trading case study scenarios. We conducted extensive studies to demonstrate the feasibility of the proposed techniques and illustrate the benefits of our approach in providing adaptive composite services using the policy-based approach. Our performance and scalability studies indicate that MASC middleware is scalable and the introduced overhead are acceptable.","PeriodicalId":270611,"journal":{"name":"International Conference on Internet and Web Applications and Services","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127774783","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}
It is widely recognized that peer-to-peer (P2P) networks offer opportunities as a legal and cost- efficient content distribution model. This resulted in an accumulation of literature concerning technical issues. Comparatively little attention has been paid to economic analysis of P2P systems as enabling technologies. This paper examines the value networks of P2P TV, by means of an actor-roles analysis of three cases: VeriSign, Joost and Vuze. This analysis allows us to grasp: how several actors position and distinguish themselves from competing companies, who creates value and what motivates actors to execute certain roles. The main findings reveal many significant differences between the compositions of the three value networks under examination. The results suggest that some P2P providers are not only involved in content distribution, but in B2C roles as well. Finally, we found that, in some cases, end users have become more actively involved in value chains.
{"title":"Value Networks of P2P TV: An Analysis of Actors and Their Roles","authors":"J. D. Boever","doi":"10.1109/ICIW.2008.30","DOIUrl":"https://doi.org/10.1109/ICIW.2008.30","url":null,"abstract":"It is widely recognized that peer-to-peer (P2P) networks offer opportunities as a legal and cost- efficient content distribution model. This resulted in an accumulation of literature concerning technical issues. Comparatively little attention has been paid to economic analysis of P2P systems as enabling technologies. This paper examines the value networks of P2P TV, by means of an actor-roles analysis of three cases: VeriSign, Joost and Vuze. This analysis allows us to grasp: how several actors position and distinguish themselves from competing companies, who creates value and what motivates actors to execute certain roles. The main findings reveal many significant differences between the compositions of the three value networks under examination. The results suggest that some P2P providers are not only involved in content distribution, but in B2C roles as well. Finally, we found that, in some cases, end users have become more actively involved in value chains.","PeriodicalId":270611,"journal":{"name":"International Conference on Internet and Web Applications and Services","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123803352","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 increasing development of real applications using Semantic Web Technologies, it is necessary to provide scalable and efficient ontology querying and reasoning systems. In this paper we present DBOWL, a persistent and scalable OWL reasoner. Ontologies are stored in a relational database, using a description logic reasoner to pre-compute the class and property hierarchies and to obtain all the ontology information (i.e. properties domain and range) which is also stored in the database. Furthermore, a simple but expressive query language has been implemented, which allows us to query and reason on these ontologies. In order to show the use of the tool, we present an example that generates a relational database to store the Univ-Bench ontology. Finally, in order to asses the performance of our tool, we use LUMB, a well known benchmark to compare repositories in the Semantic Web extending it with more complex queries, and we compare the results obtained with Minerva. The results show the efficiency and scalability of DBOWL and the power of the query language.
{"title":"DBOWL: Towards a Scalable and Persistent OWL Reasoner","authors":"María del Mar Roldán García, J. F. A. Montes","doi":"10.1109/ICIW.2008.122","DOIUrl":"https://doi.org/10.1109/ICIW.2008.122","url":null,"abstract":"With the increasing development of real applications using Semantic Web Technologies, it is necessary to provide scalable and efficient ontology querying and reasoning systems. In this paper we present DBOWL, a persistent and scalable OWL reasoner. Ontologies are stored in a relational database, using a description logic reasoner to pre-compute the class and property hierarchies and to obtain all the ontology information (i.e. properties domain and range) which is also stored in the database. Furthermore, a simple but expressive query language has been implemented, which allows us to query and reason on these ontologies. In order to show the use of the tool, we present an example that generates a relational database to store the Univ-Bench ontology. Finally, in order to asses the performance of our tool, we use LUMB, a well known benchmark to compare repositories in the Semantic Web extending it with more complex queries, and we compare the results obtained with Minerva. The results show the efficiency and scalability of DBOWL and the power of the query language.","PeriodicalId":270611,"journal":{"name":"International Conference on Internet and Web Applications and Services","volume":"4 10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130592634","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
扫码关注我们
求助内容：
应助结果提醒方式：