{"title":"A Holistic Service Provision Strategy for Drone-as-a-Service in MEC-based UAV Delivery","authors":"Liju Chu, Xuejun Li, Jia Xu, A. Neiat, Xiao Liu","doi":"10.1109/ICWS53863.2021.00092","DOIUrl":"https://doi.org/10.1109/ICWS53863.2021.00092","url":null,"abstract":"With the rapid growth of Internet of Things (IoT), Mobile Edge Computing (MEC) is becoming the major platform for many smart systems such as smart logistics, smart healthcare, and smart transportation, given its lower latency and higher reliability compared with centralized cloud computing. There is a growing interest in Drone-as-a-Service in recent years which enables the MEC-based smart UAV delivery system. However, most existing works on Drone-as-a-Service focus on the static service composition or the dynamic service provisioning, rather than a holistic service provisioning strategy for the entire UAV delivery process. In this paper, we propose a holistic service provisioning strategy for Drone-as-a-Service in MEC-based UAV delivery to address such an issue. Specifically, a MEC-based UAV relay delivery system framework (RDS) is designed, which considers both the static stage for provisioning delivery services and the dynamic stage for provisioning computing services. Based on the service models for both static and dynamic stages, an energy-efficient service provision strategy (ESP-GA) for MEC-based UAV last-mile delivery is proposed, which aims to minimize the overall energy consumption under deadline constraints. Through the simulation experiments based on a prototype UAV delivery system, the experimental results have successfully demonstrated the superior performance of the proposed holistic strategy in comparison with several representative service provisioning strategies.","PeriodicalId":213320,"journal":{"name":"2021 IEEE International Conference on Web Services (ICWS)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126624724","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}
{"title":"Trust Management for Reliable Cross-Platform Cooperation Based on Blockchain","authors":"Chao Wang, Shizhan Chen, Shiping Chen, Xiao Xue, Hongyue Wu, Zhiyong Feng","doi":"10.1109/ICWS53863.2021.00084","DOIUrl":"https://doi.org/10.1109/ICWS53863.2021.00084","url":null,"abstract":"With the rise of crossover services, service providers usually cooperate with each other on different platforms to expand their service value. However, in cross-platform cooperation, insufficient understanding and malicious competition between different platforms would lead to inaccurate trust establishment and unreliable trust recommendations. In this paper, we propose a trust management framework of cross-platform based on blockchain to establish, store and recommend trust securely for cross-platform cooperation. Firstly, we take into account the contextual background information to enhance interaction and understanding between platforms to achieve accurate trust establishment. Secondly, the trust recommendation algorithm is written into the blockchain in the form of smart contracts, which can ensure the security of trust recommendation. Finally, experiments are used to demonstrate the superiority and reliability of the framework.","PeriodicalId":213320,"journal":{"name":"2021 IEEE International Conference on Web Services (ICWS)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126766157","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}
{"title":"Alleviating the Matthew Effect in O2O Service Matching Process","authors":"Yuying Yang, Xiao Xue, Fozhi Hou, Shizhan Chen, Zhiyong Feng, Lejun Zhang","doi":"10.1109/ICWS53863.2021.00034","DOIUrl":"https://doi.org/10.1109/ICWS53863.2021.00034","url":null,"abstract":"With the development of Online to Offline (O2O) model and the rapid growth of service types and numbers, service matching algorithms have become the key in connecting users and services. The traditional service matching algorithms lack consideration for the limited resources of O2O services, leading to the Matthew effect more seriously. In this context, how to alleviate the Matthew effect through the optimization of matching algorithms has become an urgent problem in this field. Based on this, this paper proposes an adaptive optimization algorithm of O2O service matching to achieve the balance of supply and demand by optimizing supply, thus alleviating the Matthew effect. In addition, a computational experiment system is constructed to verify the effect of different matching algorithms on alleviating the Matthew effect. The result shows that our proposed algorithm can provide new means and ideas for alleviating the Matthew effect.","PeriodicalId":213320,"journal":{"name":"2021 IEEE International Conference on Web Services (ICWS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121048170","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}
{"title":"Mixed Priority Queue Scheduling Based on Spectral Clustering in Spatial Crowdsourcing","authors":"Yue Ma, Ru-Fen Ni, Xiaofeng Gao, Guihai Chen","doi":"10.1109/ICWS53863.2021.00047","DOIUrl":"https://doi.org/10.1109/ICWS53863.2021.00047","url":null,"abstract":"With the ubiquity of GPS-enabled smart devices equipped with high-fidelity sensors and increased availability of the wireless network, spatial crowdsourcing has been recently proposed as a general framework to employ smart device carriers as workers to provide services and perform location-sensitive tasks. In this paper, we focus on the task assignment in spatial crowdsourcing, which aims to find the optimal strategy to assign each task to a proper worker such that the total number of completed tasks is maximized and the traveling time cost is minimized, while the workers can return to their initial locations before deadlines after performing the assigned tasks. Finding the optimal global assignment turns out to be intractable since it does not simply imply optimality for an individual worker, as a typical nearest-neighbor heuristic does not render a satisfactory result in general. In spatial crowdsourcing, we model the task assignment problem as a multiple objective joint optimization problem, which focuses on maximizing accomplished task rate and minimizing travel time cost rate simultaneously, and solves it with a mixed priority queue scheduling algorithm. We also introduce a spectral clustering algorithm in spatial crowdsourcing for the first time to divide the task network into different subdomains, considering the task clustering phenomena in real scenarios. Experiments on synthetic and real-world networks demonstrate the efficiency and effectiveness of our method in the task assignment of spatial crowdsourcing and provide insights into its application in practice.","PeriodicalId":213320,"journal":{"name":"2021 IEEE International Conference on Web Services (ICWS)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123767738","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}
{"title":"GHTRec: A Personalized Service to Recommend GitHub Trending Repositories for Developers","authors":"Yuqi Zhou, Jiawei Wu, Yanchun Sun","doi":"10.1109/ICWS53863.2021.00049","DOIUrl":"https://doi.org/10.1109/ICWS53863.2021.00049","url":null,"abstract":"GitHub is one of the largest hosting service platforms for software development, which contains more than 40 million users and 100 million software repositories. GitHub provides a trending page to help software developers discover potential repositories during a period of time. Also, GitHub introduces a feature named “topic” to label repositories. However, GitHub does not explicitly provide user preference information. It is difficult for software developers to find personalized GitHub trending repositories satisfying their preferences. In this paper, we propose a service named GHTRec to recommend personalized GitHub trending repositories for software developers. First, we use a deep-learning method to predict topics for GitHub repositories. Next, we leverage the historical repositories committed by software developers to make recommendation of GitHub trending repositories. Then we evaluate our topic prediction model and recommendation service, and results show that our GHTRec service could recommend trending repositories satisfying developers' topic preferences.","PeriodicalId":213320,"journal":{"name":"2021 IEEE International Conference on Web Services (ICWS)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128002764","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}
Xiaocui Li, Zhangbing Zhou, Zhuofeng Zhao, Sami Yangui, Wenbo Zhang
{"title":"Data & Computation-Intensive Service Re-Scheduling In Edge Networks","authors":"Xiaocui Li, Zhangbing Zhou, Zhuofeng Zhao, Sami Yangui, Wenbo Zhang","doi":"10.1109/ICWS53863.2021.00058","DOIUrl":"https://doi.org/10.1109/ICWS53863.2021.00058","url":null,"abstract":"The collaboration of Internet of Things (IoT) devices is promising nowadays to achieve complex requests in edge networks. In this setting, the functionalities of IoT devices are usually encapsulated as IoT services. A request can be fulfilled by the composition of data- or computation-intensive IoT services, which require to either consume a relatively large amount of sensory data or mandate a heavy computation capacity. Discovering functionally complementary IoT services, while satisfying their pre-specified spatial constraints, is a challenge, since certain IoT services may non-exist with respect to current IoT services deployment situation. To remedy this issue, we propose an energy-aware Data- and Computation-intensive service Migration and Scheduling mechanism (DCMS) to re-schedule certain services from their hosting devices to the ones within the geographical region prescribed by the request. Extensive experiments are conducted and evaluation results show that our DCMS is promising in reducing the energy consumption and average delay, in comparison with the state of the art's techniques.","PeriodicalId":213320,"journal":{"name":"2021 IEEE International Conference on Web Services (ICWS)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129081938","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}
{"title":"MinerRepu: A Reputation Model for Miners in Blockchain Networks","authors":"Akram Alofi, R. Bahsoon, R. Hendley","doi":"10.1109/ICWS53863.2021.00100","DOIUrl":"https://doi.org/10.1109/ICWS53863.2021.00100","url":null,"abstract":"Blockchain technology holds several promises for many application areas; however, it is not without its limitations. One of the most significant weaknesses of blockchain technology is its substantial energy consumption. Many researchers have proposed solutions to reduce the energy demands of this technology - such as the use of alternative consensus algorithms and the use of renewable energy. However, the use of alternative trust and reputation models to improve sustainability (by, for instance, selecting miners based on these trust or reputation values) has not been widely investigated. In this paper, we propose a reputation model that quantifies and compares the trustworthiness of miners based on their behaviours within a blockchain network. The model is evaluated analytically and compared to other trust and reputation models for miners. The evaluation shows that our model fulfils several desirable properties that should always be satisfied by reputation models, whereas other models do not always meet these requirements. In addition, we perform experimental evaluations to represent the performance of our model and its accuracy in detecting malicious miners. We also report the effectiveness of using the model in reducing the energy consumption of blockchain-based systems.","PeriodicalId":213320,"journal":{"name":"2021 IEEE International Conference on Web Services (ICWS)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116525845","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}
Yanmei Zhang, Chong Zhu, Xiaoyi Tang, Hengyue Jia, Xiuli Wang
{"title":"Alliance-Aware Service Composition with Efficient Matching Search","authors":"Yanmei Zhang, Chong Zhu, Xiaoyi Tang, Hengyue Jia, Xiuli Wang","doi":"10.1109/ICWS53863.2021.00060","DOIUrl":"https://doi.org/10.1109/ICWS53863.2021.00060","url":null,"abstract":"Service bundling within enterprises and service cooperation outside enterprises are quite common on cloud. The correlations between services called Alliance Relation (AR) have great impact on the system QoS of service composition. Existing research have not fully and systematically considered the types of AR. Meanwhile, many works suffer from the low searching efficiency of finding the optimal matching AR for composite services. In this paper, we propose a novel approach called Q-ARIGraph-NSGA3, where we establish a multi-granularity optimization model on quotient space and an efficient matching search method in which a partition mechanism is applied to accelerate the generation of the graph. We expand the alliance relation types in service composition with service granulation and AR granulation employed concurrently. Extensive experiments are conducted on a real-world web service dataset, which demonstrate that our approach outperforms the state-of-the-art approaches in terms of effectiveness and efficiency.","PeriodicalId":213320,"journal":{"name":"2021 IEEE International Conference on Web Services (ICWS)","volume":"619 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116202735","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}
Wei Du, Qiang He, Yuan-Xia Ji, Chenran Cai, Xiaoyong Zhao
{"title":"Optimal User Migration upon Server failures in Edge Computing Environment","authors":"Wei Du, Qiang He, Yuan-Xia Ji, Chenran Cai, Xiaoyong Zhao","doi":"10.1109/ICWS53863.2021.00045","DOIUrl":"https://doi.org/10.1109/ICWS53863.2021.00045","url":null,"abstract":"In the edge computing environment, edge servers are geographically distributed around end-users to provide highly accessible and efficient computing capacities and services. At runtime, edge servers are subject to failures for various reasons, e.g., hardware failures, system overloaded, cyber attacks. When an edge server fails, the end-users on the edge sever, i.e., edge users, must be migrated to nearby edge servers to ensure service delivery. An optimal migration strategy must maximize the number of migrated end-users while ensuring low latency for end-users. In the meantime, the service deployment cost, i.e., the cost of deploying services required by migrated end-users, must be considered. In this paper, we model the edge user migration (EUM) problem upon server failures as an Integer Programming problem, and introduce a novel, optimal approach for solving the EUM problem. We also propose a heuristic approach for finding sub-optimal solutions efficiently to large-scale scenarios. The results of experiments conducted on a real-world dataset demonstrate that our approaches significantly outperform two representative baseline approaches.","PeriodicalId":213320,"journal":{"name":"2021 IEEE International Conference on Web Services (ICWS)","volume":"2010 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121380352","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}
{"title":"Deserv: Decentralized Serverless Computing","authors":"S. Christie V, A. Chopra, Munindar P. Singh","doi":"10.1109/ICWS53863.2021.00020","DOIUrl":"https://doi.org/10.1109/ICWS53863.2021.00020","url":null,"abstract":"A decentralized application involves multiple autonomous principals, e.g., humans and organizations. Autonomy motivates (i) specifying a decentralized application via a protocol that captures the interactions between the principals, and (ii) a programming model that enables each principal to independently (from other principals) construct its own protocol-compliant agent. An agent encodes its principal's decision making and represents it in the application. We contribute Deserv, the first protocol-based programming model for decentralized applications that is suited to the cloud. Specifically, Deserv demonstrates how to leverage function-as-a-service (FaaS), a popular serverless programming model, to implement agents. A notable feature of Deserv is the use declarative protocols to specify interactions. Declarative protocols support implementing stateful agents in a manner that naturally exploits the concurrency and autoscaling benefits offered by serverless computing.","PeriodicalId":213320,"journal":{"name":"2021 IEEE International Conference on Web Services (ICWS)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127930720","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}