The increasing number of services available in the cloud market make them plausible and attractive for building Cloud Service Compositions (CSC). However, performance instability is common in the cloud environment due to changes in supply and demand of shared computational infrastructure and resources. Candidate compositions are vulnerable to such instability. We propose a novel approach to improve performance stability by leveraging on the principles of design diversity in service composition(s). The approach uses portfolio theory to construct a diversified composition of candidate services that share lowest possible correlation for their performances. We use an exemplar to illustrate the applicability of the approach. Controlled experiments are used to test the approach effectiveness in improving the performance stability of CSC. While the scalability of our approach is evaluated, we report on its sensitivity and effectiveness under multiple correlation settings.
{"title":"Stabilising Performance in Cloud Services Composition Using Portfolio Theory","authors":"Faisal Alrebeish, R. Bahsoon","doi":"10.1109/ICWS.2015.11","DOIUrl":"https://doi.org/10.1109/ICWS.2015.11","url":null,"abstract":"The increasing number of services available in the cloud market make them plausible and attractive for building Cloud Service Compositions (CSC). However, performance instability is common in the cloud environment due to changes in supply and demand of shared computational infrastructure and resources. Candidate compositions are vulnerable to such instability. We propose a novel approach to improve performance stability by leveraging on the principles of design diversity in service composition(s). The approach uses portfolio theory to construct a diversified composition of candidate services that share lowest possible correlation for their performances. We use an exemplar to illustrate the applicability of the approach. Controlled experiments are used to test the approach effectiveness in improving the performance stability of CSC. While the scalability of our approach is evaluated, we report on its sensitivity and effectiveness under multiple correlation settings.","PeriodicalId":250871,"journal":{"name":"2015 IEEE International Conference on Web Services","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132606411","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 popularity of smartphones and tablet computers in recent years makes mobile apps burst. Mobile apps have become the main consumers of the Internet-based services. Compared to traditional applications in the desktop computing era, mobile devices with their apps bring new opportunities and challenges to service computing community, in various aspects like service publication, discovery, interaction, composition, et al. In this paper, we propose a novel data-driven, content-based mobile apps composition approach, called MashDroid, by leveraging a novel In-App Search mechanism, i.e., Discovering relevant services for the data and content in apps. Rather than existing techniques that usually integrate fixed Web services, our approach relies on the dynamic service discovery and flexible data exchange between several apps. The unique feature of our approach is enabling the data communication channel between apps by the content index services provided by a leading Android appstore, Wandoujia, which now has over 1,000,000 apps and 200 million users. We employ the In-App Search mechanism to define a Restful-style app model and resource-oriented app description model. Based on the models, we design a framework for dynamically discovering relevant apps that could be composed with current app's contexts. We implement a prototype to demonstrate our approach.
{"title":"Mash Droid: An Approach to Mobile-Oriented Dynamic Services Discovery and Composition by In-App Search","authors":"Yun Ma, Xuanzhe Liu, Meihua Yu, Yunxin Liu, Q. Mei, Feng Feng","doi":"10.1109/ICWS.2015.102","DOIUrl":"https://doi.org/10.1109/ICWS.2015.102","url":null,"abstract":"The popularity of smartphones and tablet computers in recent years makes mobile apps burst. Mobile apps have become the main consumers of the Internet-based services. Compared to traditional applications in the desktop computing era, mobile devices with their apps bring new opportunities and challenges to service computing community, in various aspects like service publication, discovery, interaction, composition, et al. In this paper, we propose a novel data-driven, content-based mobile apps composition approach, called MashDroid, by leveraging a novel In-App Search mechanism, i.e., Discovering relevant services for the data and content in apps. Rather than existing techniques that usually integrate fixed Web services, our approach relies on the dynamic service discovery and flexible data exchange between several apps. The unique feature of our approach is enabling the data communication channel between apps by the content index services provided by a leading Android appstore, Wandoujia, which now has over 1,000,000 apps and 200 million users. We employ the In-App Search mechanism to define a Restful-style app model and resource-oriented app description model. Based on the models, we design a framework for dynamically discovering relevant apps that could be composed with current app's contexts. We implement a prototype to demonstrate our approach.","PeriodicalId":250871,"journal":{"name":"2015 IEEE International Conference on Web Services","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130490854","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}
This paper presents a hybrid approach for automatic composition of Web services that generates semantic input-output matching compositions minimizing the number of services and optimizing the global QoS. The proposed approach has four main steps: 1) generation of the composition graph for a request, 2) computation of the optimal QoS of the composition graph, 3) multi-step optimizations of the graph to identify equivalent and dominated services, and 4) hybrid local-global search to extract the optimal QoS with the minimum number of services. A validation with the datasets of the Web Service Challenge 2009-2010 is also provided.
{"title":"A Hybrid Local-Global Optimization Strategy for QoS-Aware Service Composition","authors":"P. Rodríguez-Mier, M. Mucientes, M. Lama","doi":"10.1109/ICWS.2015.104","DOIUrl":"https://doi.org/10.1109/ICWS.2015.104","url":null,"abstract":"This paper presents a hybrid approach for automatic composition of Web services that generates semantic input-output matching compositions minimizing the number of services and optimizing the global QoS. The proposed approach has four main steps: 1) generation of the composition graph for a request, 2) computation of the optimal QoS of the composition graph, 3) multi-step optimizations of the graph to identify equivalent and dominated services, and 4) hybrid local-global search to extract the optimal QoS with the minimum number of services. A validation with the datasets of the Web Service Challenge 2009-2010 is also provided.","PeriodicalId":250871,"journal":{"name":"2015 IEEE International Conference on Web Services","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126261032","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}
Web services (WS) are integrated software components that facilitate interoperable machine-to-machine interaction over a network. In the era of Web 2.0, companies worldwide are actively deploying Web services within their business environments. As a result, designing effective Web service recommendation mechanisms based on Quality of Service (QoS) is attracting more attention. However, traditional Neighborhood-based Collaborative Filtering (CF) models fail to capture the actual relationships between users or services due to data sparsity. On the other hand, Random Walk (RW) algorithm, which has been categorized as a sparsity-tolerant recommendation approach, suffers from poor performance in terms of recommendation accuracy. In this paper, we aim at designing a recommendation model that achieves high recommendation accuracy over the transitional RW based model. First, we propose an Integrated-Model QoS-based Graph (IMQG), in which users and services represent the nodes while weighted QoS magnitudes and User/Service similarity measurements serve as the edges. We use Jaccard coefficient in several variants to separately compute similarities of both Users and Services. Then, Top-k Random Walk algorithm is applied to generate final recommendation list to active users. Finally, to demonstrate the effectiveness of our model, comprehensive experiments are conducted on a real-world QoS dataset. Analysis of the results shows high improvement in recommendation accuracy with more tolerance to data sparsity.
Web服务(WS)是集成的软件组件，可促进网络上可互操作的机器对机器交互。在Web 2.0时代，世界各地的公司都在其业务环境中积极地部署Web服务。因此，基于服务质量(QoS)设计有效的Web服务推荐机制受到越来越多的关注。然而，传统的基于邻域的协同过滤(CF)模型由于数据的稀疏性而无法捕捉用户或服务之间的实际关系。另一方面，随机漫步(Random Walk, RW)算法被归类为稀疏容忍推荐方法，但在推荐精度方面表现不佳。在本文中，我们的目标是设计一个推荐模型，在过渡的基于RW的模型上实现更高的推荐精度。首先，我们提出了一个基于集成模型QoS的图(IMQG)，其中用户和服务代表节点，加权QoS大小和用户/服务相似性度量作为边缘。我们在几个变体中使用Jaccard系数分别计算用户和服务的相似度。然后，应用Top-k Random Walk算法生成最终的推荐列表给活跃用户。最后，为了证明我们的模型的有效性，在一个真实的QoS数据集上进行了全面的实验。分析结果表明，在对数据稀疏度有更大容忍度的情况下，推荐精度有了很大的提高。
{"title":"An Integrated-Model QoS-Based Graph for Web Service Recommendation","authors":"A. Abdullah, Xining Li","doi":"10.1109/ICWS.2015.62","DOIUrl":"https://doi.org/10.1109/ICWS.2015.62","url":null,"abstract":"Web services (WS) are integrated software components that facilitate interoperable machine-to-machine interaction over a network. In the era of Web 2.0, companies worldwide are actively deploying Web services within their business environments. As a result, designing effective Web service recommendation mechanisms based on Quality of Service (QoS) is attracting more attention. However, traditional Neighborhood-based Collaborative Filtering (CF) models fail to capture the actual relationships between users or services due to data sparsity. On the other hand, Random Walk (RW) algorithm, which has been categorized as a sparsity-tolerant recommendation approach, suffers from poor performance in terms of recommendation accuracy. In this paper, we aim at designing a recommendation model that achieves high recommendation accuracy over the transitional RW based model. First, we propose an Integrated-Model QoS-based Graph (IMQG), in which users and services represent the nodes while weighted QoS magnitudes and User/Service similarity measurements serve as the edges. We use Jaccard coefficient in several variants to separately compute similarities of both Users and Services. Then, Top-k Random Walk algorithm is applied to generate final recommendation list to active users. Finally, to demonstrate the effectiveness of our model, comprehensive experiments are conducted on a real-world QoS dataset. Analysis of the results shows high improvement in recommendation accuracy with more tolerance to data sparsity.","PeriodicalId":250871,"journal":{"name":"2015 IEEE International Conference on Web Services","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127311795","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 growing popularity of cloud computing has magnified the rise of software reuse by facilitating service provisioning over the Internet. At the same time, a new generation of mobile apps has emerged relying on backend services that expand the app functionally, while reducing the overhead on limited mobile resources. The Web service approach promises great flexibility in offering software functionality over the network, while maintaining interoperability between heterogeneous platforms. In addition, recent years have witnessed the rise of user-facing service developments that can be consumed on-the-go with a standard interface, such as Restful Web services. However, the discovery of such services does not match their growing popularity and remain challenging. Users cannot tolerate long latency in finding relevant services to their requests. In this paper, we propose a robust and efficient Web service discovery approach that uses statistical methods and indexing techniques to improve the precision and response time of the discovery process. Experimental results demonstrate that the proposed approach outperforms the state-of-the-art discovery mechanisms and significantly reduces the query response time by at least 77%, while maintaining comparable accuracy.
{"title":"goDiscovery: Web Service Discovery Made Efficient","authors":"Yehia Elshater, Khalid Elgazzar, Patrick Martin","doi":"10.1109/ICWS.2015.99","DOIUrl":"https://doi.org/10.1109/ICWS.2015.99","url":null,"abstract":"The growing popularity of cloud computing has magnified the rise of software reuse by facilitating service provisioning over the Internet. At the same time, a new generation of mobile apps has emerged relying on backend services that expand the app functionally, while reducing the overhead on limited mobile resources. The Web service approach promises great flexibility in offering software functionality over the network, while maintaining interoperability between heterogeneous platforms. In addition, recent years have witnessed the rise of user-facing service developments that can be consumed on-the-go with a standard interface, such as Restful Web services. However, the discovery of such services does not match their growing popularity and remain challenging. Users cannot tolerate long latency in finding relevant services to their requests. In this paper, we propose a robust and efficient Web service discovery approach that uses statistical methods and indexing techniques to improve the precision and response time of the discovery process. Experimental results demonstrate that the proposed approach outperforms the state-of-the-art discovery mechanisms and significantly reduces the query response time by at least 77%, while maintaining comparable accuracy.","PeriodicalId":250871,"journal":{"name":"2015 IEEE International Conference on Web Services","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134468997","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}
Yi Liu, Xuanzhe Liu, Yun Ma, Yunxin Liu, Zibin Zheng, Gang Huang, M. Blake
The burst of Web-based Restful services brings us a number of facilities in our life and work. We are used to take smartphones to access these Web services, like location-based services, weather search, mapping, social networking, et al. On smartphones, we have two options of service consumers, a.k.a, Native apps and Web apps. Despite the platform-independence, Web apps are claimed to provide the same features and comparable user experiences with native apps. However, one fact is that more and more people prefer native apps rather than Web apps. In this paper, we make an empirical study on characterizing the performance disparity of native apps and Web apps. Given the same functionalities provided by the same service providers, we explore the Restful Web services that are used by native apps and Web apps. With HTTP-level trace analysis, we demystify the workflows on how native apps and Web apps use Web services and summarize different service usage patterns from architectural style perspective. Then we characterize the performance differences between native apps and Web apps on realizing Restful Web services including GET, DELETE, PUT & POST, in terms of number of network connections, response time, and data drain, given the same functional features. Our observations reveal that Web apps do not always perform worse than native apps using Restful Web services under the same context. We further propose some implications to improve both native apps and Web apps on smartphones.
{"title":"Characterizing RESTful Web Services Usage on Smartphones: A Tale of Native Apps and Web Apps","authors":"Yi Liu, Xuanzhe Liu, Yun Ma, Yunxin Liu, Zibin Zheng, Gang Huang, M. Blake","doi":"10.1109/ICWS.2015.53","DOIUrl":"https://doi.org/10.1109/ICWS.2015.53","url":null,"abstract":"The burst of Web-based Restful services brings us a number of facilities in our life and work. We are used to take smartphones to access these Web services, like location-based services, weather search, mapping, social networking, et al. On smartphones, we have two options of service consumers, a.k.a, Native apps and Web apps. Despite the platform-independence, Web apps are claimed to provide the same features and comparable user experiences with native apps. However, one fact is that more and more people prefer native apps rather than Web apps. In this paper, we make an empirical study on characterizing the performance disparity of native apps and Web apps. Given the same functionalities provided by the same service providers, we explore the Restful Web services that are used by native apps and Web apps. With HTTP-level trace analysis, we demystify the workflows on how native apps and Web apps use Web services and summarize different service usage patterns from architectural style perspective. Then we characterize the performance differences between native apps and Web apps on realizing Restful Web services including GET, DELETE, PUT & POST, in terms of number of network connections, response time, and data drain, given the same functional features. Our observations reveal that Web apps do not always perform worse than native apps using Restful Web services under the same context. We further propose some implications to improve both native apps and Web apps on smartphones.","PeriodicalId":250871,"journal":{"name":"2015 IEEE International Conference on Web Services","volume":"8 18","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131436798","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}
Traditional Complex Event systems (CEP) did not consider the computation requirements of continuous dynamic behavior such as differential equations. In addition, the event composition rules were predefined before the CEP engine began working. The rule defining task is error-prone and cumbersome. In this paper, therefore, a hybrid complex event service is proposed, which deals with not only discrete events but also continuous behavior computation based on IoT (Internet of Things) resource models. In order to satisfy the real-time constraints of processing IoT events, a divide-and-conquer principle is adopted, where we give a combination theorem such that different events can be processed on different IoT resources and then these processed results can be combined to derive complex events. Based on the formal IoT resources and event knowledge, we define interest goals to direct event composition without enumerating event relation to define event composition rules. We finally present event composition algorithms and evaluation to show our idea.
{"title":"A Hybrid Complex Event Service Based on IoT Resource Models","authors":"Yang Zhang, Junliang Chen","doi":"10.1109/ICWS.2015.88","DOIUrl":"https://doi.org/10.1109/ICWS.2015.88","url":null,"abstract":"Traditional Complex Event systems (CEP) did not consider the computation requirements of continuous dynamic behavior such as differential equations. In addition, the event composition rules were predefined before the CEP engine began working. The rule defining task is error-prone and cumbersome. In this paper, therefore, a hybrid complex event service is proposed, which deals with not only discrete events but also continuous behavior computation based on IoT (Internet of Things) resource models. In order to satisfy the real-time constraints of processing IoT events, a divide-and-conquer principle is adopted, where we give a combination theorem such that different events can be processed on different IoT resources and then these processed results can be combined to derive complex events. Based on the formal IoT resources and event knowledge, we define interest goals to direct event composition without enumerating event relation to define event composition rules. We finally present event composition algorithms and evaluation to show our idea.","PeriodicalId":250871,"journal":{"name":"2015 IEEE International Conference on Web Services","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131875943","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}
Social services are more and more popular with the development of web and mobile internet. Behind social services, graph model is the key data structure representing the relationship among social entities. Partitioning social graphs according to graph connectivity is an important technique for the competency of social services including parallel computing, scalability, and analytics. This paper proposes a novel diffusion based approach for partitioning social graphs. A brand-new Random Walks model with Constant Source and Sink nodes (RWCSS) is devised to analogize a dynamic balanced diffusion procedure on graphs. The stationary state of RWCSS provides the closeness measurement between nodes which can serve as an effective global estimation for partitioning. Through incorporating the RWCSS model into the Bubble Framework, an efficient graph partitioning algorithm (Bubble-RWCSS) is implemented in a way gradually improving the partitioning quality with global consideration in each iteration. The evaluation on public well-known social graphs demonstrates the promising performance of the proposed method.
{"title":"A Diffusion Model with Constant Source and Sinks for Social Graph Partitioning","authors":"Xin Zhang, Zhihu Wang, Chunyang Ma, Ning Duan","doi":"10.1109/ICWS.2015.25","DOIUrl":"https://doi.org/10.1109/ICWS.2015.25","url":null,"abstract":"Social services are more and more popular with the development of web and mobile internet. Behind social services, graph model is the key data structure representing the relationship among social entities. Partitioning social graphs according to graph connectivity is an important technique for the competency of social services including parallel computing, scalability, and analytics. This paper proposes a novel diffusion based approach for partitioning social graphs. A brand-new Random Walks model with Constant Source and Sink nodes (RWCSS) is devised to analogize a dynamic balanced diffusion procedure on graphs. The stationary state of RWCSS provides the closeness measurement between nodes which can serve as an effective global estimation for partitioning. Through incorporating the RWCSS model into the Bubble Framework, an efficient graph partitioning algorithm (Bubble-RWCSS) is implemented in a way gradually improving the partitioning quality with global consideration in each iteration. The evaluation on public well-known social graphs demonstrates the promising performance of the proposed method.","PeriodicalId":250871,"journal":{"name":"2015 IEEE International Conference on Web Services","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131199162","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}
Web Service discovery a fundamental operation in SOA-based systems. In a landscape of Web Services that is growing in size and complexity, discovering a suitable atomic or composite Service for a given task requires a considerable amount of computation and communication resources, including semantic reasoning, the use of composition algorithms, and communication with multiple Service repositories. We study the approach of introducing a cache for Service discovery results to reduce the load on the backend discovery system. In this setting the bottleneck is the cache refresh frequency rather than the cache size, thus the caching algorithm needs to decide in which order to refresh the cached contents. We derive a theoretical upper bound on the number of cache hits possible to achieve for a given set of discovery queries, and we propose a number of heuristics for this caching problem, some of which turn out to have provable approximation guarantees. In an extensive experimental study we evaluate these methods. Our findings are that the best algorithms lead to a cache performance of more than 95 percent of the theoretical upper bound in all tested scenarios.
{"title":"A Study of Caching Strategies for Web Service Discovery","authors":"Tobias Jacobs, Salvatore Longo","doi":"10.1109/ICWS.2015.68","DOIUrl":"https://doi.org/10.1109/ICWS.2015.68","url":null,"abstract":"Web Service discovery a fundamental operation in SOA-based systems. In a landscape of Web Services that is growing in size and complexity, discovering a suitable atomic or composite Service for a given task requires a considerable amount of computation and communication resources, including semantic reasoning, the use of composition algorithms, and communication with multiple Service repositories. We study the approach of introducing a cache for Service discovery results to reduce the load on the backend discovery system. In this setting the bottleneck is the cache refresh frequency rather than the cache size, thus the caching algorithm needs to decide in which order to refresh the cached contents. We derive a theoretical upper bound on the number of cache hits possible to achieve for a given set of discovery queries, and we propose a number of heuristics for this caching problem, some of which turn out to have provable approximation guarantees. In an extensive experimental study we evaluate these methods. Our findings are that the best algorithms lead to a cache performance of more than 95 percent of the theoretical upper bound in all tested scenarios.","PeriodicalId":250871,"journal":{"name":"2015 IEEE International Conference on Web Services","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133179700","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 composition of multiple services that are deployed on smart devices generally incurs significant communication overheads, especially when an optimized composition is pursued. A parallel approach for service composition is proposed for obtaining the optimal solution with minimum executing time efficiently. In this approach, the request for a composite service is represented by a function graph which is decomposed into multiple path-structured sub graphs firstly. Then messages are sent among the service nodes to search for the corresponding sub-solutions. Finally, a Branch-and-Bound strategy is applied to generate the optimal solution over these sub-solutions. The experiments show our optimization strategies can reduce the time and communication cost considerably under different experimental settings.
{"title":"A Parallel Approach for Service Composition with Complex Structures in Pervasive Environments","authors":"Chenyang Liu, Jian Cao, Jie Wang","doi":"10.1109/ICWS.2015.79","DOIUrl":"https://doi.org/10.1109/ICWS.2015.79","url":null,"abstract":"The composition of multiple services that are deployed on smart devices generally incurs significant communication overheads, especially when an optimized composition is pursued. A parallel approach for service composition is proposed for obtaining the optimal solution with minimum executing time efficiently. In this approach, the request for a composite service is represented by a function graph which is decomposed into multiple path-structured sub graphs firstly. Then messages are sent among the service nodes to search for the corresponding sub-solutions. Finally, a Branch-and-Bound strategy is applied to generate the optimal solution over these sub-solutions. The experiments show our optimization strategies can reduce the time and communication cost considerably under different experimental settings.","PeriodicalId":250871,"journal":{"name":"2015 IEEE International Conference on Web Services","volume":"810 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116419843","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
扫码关注我们
求助内容：
应助结果提醒方式：