With the proliferation of internet technologies, publish/subscribe systems have gained wide usage as a middleware. However for this model, catering large number of publishers and subscribers while retaining acceptable performance is still a challenge. Therefore, this paper presents two parallelization strategies to improve message delivery of such systems. Furthermore, we discuss other techniques which can be adopted to increase the performance of the middleware. Finally, we conclude with an empirical study, which establishes the comparative merit of those two parallelization strategies in contrast to serial implementations.
{"title":"Towards Improved Data Dissemination of Publish-Subscribe Systems","authors":"R. Jayasinghe, Dinesh Gamage, S. Perera","doi":"10.1109/ICWS.2010.69","DOIUrl":"https://doi.org/10.1109/ICWS.2010.69","url":null,"abstract":"With the proliferation of internet technologies, publish/subscribe systems have gained wide usage as a middleware. However for this model, catering large number of publishers and subscribers while retaining acceptable performance is still a challenge. Therefore, this paper presents two parallelization strategies to improve message delivery of such systems. Furthermore, we discuss other techniques which can be adopted to increase the performance of the middleware. Finally, we conclude with an empirical study, which establishes the comparative merit of those two parallelization strategies in contrast to serial implementations.","PeriodicalId":170573,"journal":{"name":"2010 IEEE International Conference on Web Services","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126538834","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}
Service compositions need to continuously self- adapt to cope with unexpected failures. In this context adaptation becomes a fundamental requirement that must be elicited along with the other functional and non functional requirements. Beside modelling, effective adaptation also demands means to trigger it at runtime as soon as the actual behavior of the composition deviates from stated requirements. This paper extends traditional goal models with adaptive goals to support continuous adaptation. Goals become live, runtime entities whose satisfaction level is dynamically updated. Furthermore, boundary infringement triggers adaptation capabilities. The paper also provides a methodology to trace goals onto the underlying composition, assess goals satisfaction at runtime, and activate adaptation consequently. All the key elements are demonstrated on the definition of the process to control an advanced washing machine.
{"title":"Adaptive Goals for Self-Adaptive Service Compositions","authors":"L. Baresi, L. Pasquale","doi":"10.1109/ICWS.2010.60","DOIUrl":"https://doi.org/10.1109/ICWS.2010.60","url":null,"abstract":"Service compositions need to continuously self- adapt to cope with unexpected failures. In this context adaptation becomes a fundamental requirement that must be elicited along with the other functional and non functional requirements. Beside modelling, effective adaptation also demands means to trigger it at runtime as soon as the actual behavior of the composition deviates from stated requirements. This paper extends traditional goal models with adaptive goals to support continuous adaptation. Goals become live, runtime entities whose satisfaction level is dynamically updated. Furthermore, boundary infringement triggers adaptation capabilities. The paper also provides a methodology to trace goals onto the underlying composition, assess goals satisfaction at runtime, and activate adaptation consequently. All the key elements are demonstrated on the definition of the process to control an advanced washing machine.","PeriodicalId":170573,"journal":{"name":"2010 IEEE International Conference on Web Services","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127082138","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}
A. Kattepur, S. Sen, B. Baudry, A. Benveniste, C. Jard
The ever-growing choice in diverse services is making service orchestration variability an essential aspect of a composite web service. Influence of this variation on the Quality of Service (QoS) of a composite service is critical and the focus of our work. In this paper, we present a methodology to first model orchestration variability using a feature diagram (FD). The FD specifies a product line of orchestrations represented as configurations of invoked/rejected atomic services. Second, due to the potentially large set of configurations we employ combinatorial testing techniques to automatically generate configurations covering all valid pair wise interactions between services. Third, we analyze QoS variation for each configuration using probabilistic models of QoS. Using a crisis management system case study we experimentally show that pair wise generation covers all QoS outliers and eliminates analysis of > 75% of all possible configurations. The QoS analysis of the pair wise configurations reveals unsafe/ineffective configurations, helps determine realistic Service Level Agreements (SLAs), and provides valuable feedback to help remodel an orchestration.
{"title":"Variability Modeling and QoS Analysis of Web Services Orchestrations","authors":"A. Kattepur, S. Sen, B. Baudry, A. Benveniste, C. Jard","doi":"10.1109/ICWS.2010.40","DOIUrl":"https://doi.org/10.1109/ICWS.2010.40","url":null,"abstract":"The ever-growing choice in diverse services is making service orchestration variability an essential aspect of a composite web service. Influence of this variation on the Quality of Service (QoS) of a composite service is critical and the focus of our work. In this paper, we present a methodology to first model orchestration variability using a feature diagram (FD). The FD specifies a product line of orchestrations represented as configurations of invoked/rejected atomic services. Second, due to the potentially large set of configurations we employ combinatorial testing techniques to automatically generate configurations covering all valid pair wise interactions between services. Third, we analyze QoS variation for each configuration using probabilistic models of QoS. Using a crisis management system case study we experimentally show that pair wise generation covers all QoS outliers and eliminates analysis of > 75% of all possible configurations. The QoS analysis of the pair wise configurations reveals unsafe/ineffective configurations, helps determine realistic Service Level Agreements (SLAs), and provides valuable feedback to help remodel an orchestration.","PeriodicalId":170573,"journal":{"name":"2010 IEEE International Conference on Web Services","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134232109","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}
Kreshnik Musaraj, Tetsuya Yoshida, F. Daniel, Mohand-Said Hacid, F. Casati, B. Benatallah
Business process management, service-oriented architectures and software back-engineering heavily rely on the fundamental processes of mining of processes and web service business protocols from log files. Model extraction and mining aim at the (re)discovery of the behavior of a running model implementation using solely its interaction and activity traces, and no a priori information on the target model. This paper presents an approach for correlating messages and extracting the business protocol of a web service in the realistic scenario in which correlation information is entirely absent from interaction and activity logs. Correlation is achieved through deterministic computations that result in an extremely efficient method whose extensive experiments have shown its solid reliability, robustness when dealing with complex structures, and very high performance and scalability. This approach and the underlying algorithms extend what is actually possible to achieve in the web service business protocol mining domain using incomplete and noisy data logs, and opens new horizons in back-engineering of web services. The theoretical and experimental results clearly show the leap forward achieved herein.
{"title":"Message Correlation and Web Service Protocol Mining from Inaccurate Logs","authors":"Kreshnik Musaraj, Tetsuya Yoshida, F. Daniel, Mohand-Said Hacid, F. Casati, B. Benatallah","doi":"10.1109/ICWS.2010.104","DOIUrl":"https://doi.org/10.1109/ICWS.2010.104","url":null,"abstract":"Business process management, service-oriented architectures and software back-engineering heavily rely on the fundamental processes of mining of processes and web service business protocols from log files. Model extraction and mining aim at the (re)discovery of the behavior of a running model implementation using solely its interaction and activity traces, and no a priori information on the target model. This paper presents an approach for correlating messages and extracting the business protocol of a web service in the realistic scenario in which correlation information is entirely absent from interaction and activity logs. Correlation is achieved through deterministic computations that result in an extremely efficient method whose extensive experiments have shown its solid reliability, robustness when dealing with complex structures, and very high performance and scalability. This approach and the underlying algorithms extend what is actually possible to achieve in the web service business protocol mining domain using incomplete and noisy data logs, and opens new horizons in back-engineering of web services. The theoretical and experimental results clearly show the leap forward achieved herein.","PeriodicalId":170573,"journal":{"name":"2010 IEEE International Conference on Web Services","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114492885","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}
T. Koskela, Sari Järvinen, Meirong Liu, M. Ylianttila
In this paper, the user experience in added value location-based mobile music service called the City Night Life (CNL) is evaluated and analyzed. The CNL service provides recommendations about entertainment premises in the proximity by matching their music styles with the user’s personal music preferences. Entertainment premises are shown on a map interface and are marked with colors according to their match. The paper presents the components of the CNL service, the music profile, matching algorithm and the map-based user interface in a web browser. The user evaluation with 53 test users assessed the feasibility and business potential of the CNL service. Data was collected with both quantitative questionnaires and short interviews. The results indicate that the CNL service will be most useful in relatively large, unfamiliar cities. Furthermore, the matching algorithm was perceived to perform quite well.
本文对基于位置的增值移动音乐服务“城市夜生活”(City Night Life, CNL)的用户体验进行了评价和分析。CNL服务根据用户的个人音乐喜好，为附近的娱乐场所提供音乐风格的推荐。娱乐场所显示在地图界面上，并根据其匹配情况用颜色标记。本文介绍了网络浏览器中CNL服务的组成、音乐配置文件、匹配算法和基于地图的用户界面。有53个测试用户参与的用户评估评估了CNL服务的可行性和业务潜力。采用定量问卷和简短访谈两种方法收集数据。结果表明，CNL服务将在相对较大、不熟悉的城市最有用。此外，匹配算法被认为表现得相当好。
{"title":"User Experience in Added Value Location-Based Mobile Music Service","authors":"T. Koskela, Sari Järvinen, Meirong Liu, M. Ylianttila","doi":"10.1109/ICWS.2010.30","DOIUrl":"https://doi.org/10.1109/ICWS.2010.30","url":null,"abstract":"In this paper, the user experience in added value location-based mobile music service called the City Night Life (CNL) is evaluated and analyzed. The CNL service provides recommendations about entertainment premises in the proximity by matching their music styles with the user’s personal music preferences. Entertainment premises are shown on a map interface and are marked with colors according to their match. The paper presents the components of the CNL service, the music profile, matching algorithm and the map-based user interface in a web browser. The user evaluation with 53 test users assessed the feasibility and business potential of the CNL service. Data was collected with both quantitative questionnaires and short interviews. The results indicate that the CNL service will be most useful in relatively large, unfamiliar cities. Furthermore, the matching algorithm was perceived to perform quite well.","PeriodicalId":170573,"journal":{"name":"2010 IEEE International Conference on Web Services","volume":"130 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116262699","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}
Chenting Zhao, Chun'e Ma, Jing Zhang, Jun Zhang, Li Yi, X. Mao
Web is becoming a programmable platform, with countless services blooming everyday in various forms like Feeds, REST APIs and Widgets, etc. Although the existing technologies, such as Mashups, have reduced the challenges to build new applications by composing these services, it's still far from enabling the non-technical users to solve their situational problems by correlating and consuming these services. In this paper, we present our HyperService technology, which empowers a much more flexible way to link and explore existing services for solving various situational problems. In HyperService, the service metadata, service linkages and user behaviors are indexed and managed; Based on the user’s input keywords and navigation context, a group of relevant services are dynamically searched, ranked and recommended for facilitating future navigations; the service navigation is smoothed by a web2.0 style exploratory user interface. A prototype system is also presented to demonstrate the effectiveness of our HyperService research work.
{"title":"HyperService: Linking and Exploring Services on the Web","authors":"Chenting Zhao, Chun'e Ma, Jing Zhang, Jun Zhang, Li Yi, X. Mao","doi":"10.1109/ICWS.2010.11","DOIUrl":"https://doi.org/10.1109/ICWS.2010.11","url":null,"abstract":"Web is becoming a programmable platform, with countless services blooming everyday in various forms like Feeds, REST APIs and Widgets, etc. Although the existing technologies, such as Mashups, have reduced the challenges to build new applications by composing these services, it's still far from enabling the non-technical users to solve their situational problems by correlating and consuming these services. In this paper, we present our HyperService technology, which empowers a much more flexible way to link and explore existing services for solving various situational problems. In HyperService, the service metadata, service linkages and user behaviors are indexed and managed; Based on the user’s input keywords and navigation context, a group of relevant services are dynamically searched, ranked and recommended for facilitating future navigations; the service navigation is smoothed by a web2.0 style exploratory user interface. A prototype system is also presented to demonstrate the effectiveness of our HyperService research work.","PeriodicalId":170573,"journal":{"name":"2010 IEEE International Conference on Web Services","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121283275","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}
In this paper, we provide an analysis of the impacts of some reputation parameters that an agent-based Web service holds while being active in the environment. To this end, we deploy a reputation model that ranks the Web services with respect to their popularity in the network of users. We model and analyze the arrival of requests and study their impacts on the overall reputation. The Web services may be encouraged to handle the peak loads by gathering to a group. Besides theoretical discussions, we also provide significant results, which elaborate more on the details of the system parameters. We extend the details of these results to empirical results and link the observations of the implemented environment to the results that we theoretically obtain.
{"title":"Analyzing the Relationships between some Parameters of Web Services Reputation","authors":"B. Khosravifar, J. Bentahar, Ahmad Moazin","doi":"10.1109/ICWS.2010.88","DOIUrl":"https://doi.org/10.1109/ICWS.2010.88","url":null,"abstract":"In this paper, we provide an analysis of the impacts of some reputation parameters that an agent-based Web service holds while being active in the environment. To this end, we deploy a reputation model that ranks the Web services with respect to their popularity in the network of users. We model and analyze the arrival of requests and study their impacts on the overall reputation. The Web services may be encouraged to handle the peak loads by gathering to a group. Besides theoretical discussions, we also provide significant results, which elaborate more on the details of the system parameters. We extend the details of these results to empirical results and link the observations of the implemented environment to the results that we theoretically obtain.","PeriodicalId":170573,"journal":{"name":"2010 IEEE International Conference on Web Services","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129144028","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}
Ensuring secure information flow is a critical task for service composition in multi-domain systems. Research in security-aware service composition provides some preliminary solutions to this problem, but there are still issues to be addressed. In this paper, we develop a service composition mechanism specifically focusing on the secure information flow control issues. We first introduce a general model for information flow control in service chains, considering the transformation factors of services and security classes of data resources in a service chain. Then, we develop general rules to guide service composition satisfying secure information flow requirements. Finally, to achieve efficient service composition, we develop a three-phase protocol to allow rapid filtering of candidate compositions that are unlikely to satisfy the information flow constraints and thorough evaluation of highly promising candidates. Our approach can achieve effective and efficient service composition considering secure information flow.
{"title":"Policy-Driven Service Composition with Information Flow Control","authors":"Wei She, I. Yen, B. Thuraisingham, E. Bertino","doi":"10.1109/ICWS.2010.37","DOIUrl":"https://doi.org/10.1109/ICWS.2010.37","url":null,"abstract":"Ensuring secure information flow is a critical task for service composition in multi-domain systems. Research in security-aware service composition provides some preliminary solutions to this problem, but there are still issues to be addressed. In this paper, we develop a service composition mechanism specifically focusing on the secure information flow control issues. We first introduce a general model for information flow control in service chains, considering the transformation factors of services and security classes of data resources in a service chain. Then, we develop general rules to guide service composition satisfying secure information flow requirements. Finally, to achieve efficient service composition, we develop a three-phase protocol to allow rapid filtering of candidate compositions that are unlikely to satisfy the information flow constraints and thorough evaluation of highly promising candidates. Our approach can achieve effective and efficient service composition considering secure information flow.","PeriodicalId":170573,"journal":{"name":"2010 IEEE International Conference on Web Services","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132449566","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}
B. Cheng, Yang Zhang, Xiaoxiao Hu, Shicheng Zhang, Junliang Chen
Recent advances in Web services have made it practical to provide communication Web services to enable communication through SOA and package communication capability as services. This paper provides an appropriate implementation to deliver the multimedia conferencing communication components as Web services in order to be used simply by Web service clients in converged applications.
{"title":"Design and Implementation for Communication Component Based Open Multimedia Conferencing Web Service over IP","authors":"B. Cheng, Yang Zhang, Xiaoxiao Hu, Shicheng Zhang, Junliang Chen","doi":"10.1109/ICWS.2010.106","DOIUrl":"https://doi.org/10.1109/ICWS.2010.106","url":null,"abstract":"Recent advances in Web services have made it practical to provide communication Web services to enable communication through SOA and package communication capability as services. This paper provides an appropriate implementation to deliver the multimedia conferencing communication components as Web services in order to be used simply by Web service clients in converged applications.","PeriodicalId":170573,"journal":{"name":"2010 IEEE International Conference on Web Services","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128867904","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}
Selecting the optimal service from a set of functionally equivalent services is non-trivial. Previous research has addressed this issue making use of Quality of Service (QoS) attributes of the candidate services. In doing this, researchers have however assumed that the customers' preference of the various QoS attributes varies linearly with the actual attribute values. In this work, we put forward a technique that overcomes this restriction and compares functionally equivalent services on the basis of the customers' perception of the QoS attributes rather than the actual attribute values. We utilize the `mid-level splitting' method to track the customer's preference vis-a-vis the actual attribute values. Further, we utilize the `Hypothetical Equivalents and In equivalents Method' to assign weights, reflecting the importance, to the attributes on the basis of the customer preference. The whole procedure is demonstrated using a simple running example.
{"title":"Service Selection Based on Customer Rating of Quality of Service Attributes","authors":"Abhishek Srivastava, P. Sorenson","doi":"10.1109/ICWS.2010.32","DOIUrl":"https://doi.org/10.1109/ICWS.2010.32","url":null,"abstract":"Selecting the optimal service from a set of functionally equivalent services is non-trivial. Previous research has addressed this issue making use of Quality of Service (QoS) attributes of the candidate services. In doing this, researchers have however assumed that the customers' preference of the various QoS attributes varies linearly with the actual attribute values. In this work, we put forward a technique that overcomes this restriction and compares functionally equivalent services on the basis of the customers' perception of the QoS attributes rather than the actual attribute values. We utilize the `mid-level splitting' method to track the customer's preference vis-a-vis the actual attribute values. Further, we utilize the `Hypothetical Equivalents and In equivalents Method' to assign weights, reflecting the importance, to the attributes on the basis of the customer preference. The whole procedure is demonstrated using a simple running example.","PeriodicalId":170573,"journal":{"name":"2010 IEEE International Conference on Web Services","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115188530","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
扫码关注我们
求助内容：
应助结果提醒方式：