2022 IEEE International Conference on Services Computing (SCC)最新文献

筛选
英文 中文
A Dynamic QoS Guarantee Mechanism in NFV-enabled Networks nfv网络中的动态QoS保证机制
2022 IEEE International Conference on Services Computing (SCC) Pub Date : 2022-07-01 DOI: 10.1109/SCC55611.2022.00047
Yi Yue, Wencong Yang, Xuebei Zhang, Rong Huang, Xiongyan Tang
{"title":"A Dynamic QoS Guarantee Mechanism in NFV-enabled Networks","authors":"Yi Yue, Wencong Yang, Xuebei Zhang, Rong Huang, Xiongyan Tang","doi":"10.1109/SCC55611.2022.00047","DOIUrl":"https://doi.org/10.1109/SCC55611.2022.00047","url":null,"abstract":"Network Function Virtualization (NFV) is an emerging technology that extracts network functions from dedicated devices and instantiates them in the form of Virtual Network Functions (VNFs). In this paper, we focus on the multi-traffic scheduling in VNF-based service orchestration. We propose a dynamic multi-service Quality of Service (QoS) Guarantee approach, which aims to reduce data coupling between multiple services and bandwidth preemption. Then we devise a service scheduling algorithm to allocate link resources for network services. The simulation results demonstrate that our method efficiently reduces network congestion and ensures high-priority services' trouble-free running.","PeriodicalId":327015,"journal":{"name":"2022 IEEE International Conference on Services Computing (SCC)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126079222","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}
引用次数: 0
Automatically Design Heuristics for Multi-Objective Location-Aware Service Brokering in Multi-Cloud 多云环境下多目标位置感知服务代理的自动启发式设计
2022 IEEE International Conference on Services Computing (SCC) Pub Date : 2022-07-01 DOI: 10.1109/SCC55611.2022.00039
Yuheng Chen, Tao Shi, Hui Ma, Gang Chen
{"title":"Automatically Design Heuristics for Multi-Objective Location-Aware Service Brokering in Multi-Cloud","authors":"Yuheng Chen, Tao Shi, Hui Ma, Gang Chen","doi":"10.1109/SCC55611.2022.00039","DOIUrl":"https://doi.org/10.1109/SCC55611.2022.00039","url":null,"abstract":"Multi-cloud provides cloud services at distributed locations. As the number of cloud services from multi-cloud providers growing, how to select proper cloud services to optimize multiple potentially conflicting objectives simultaneously has become a challenging task. Multi-objective location-aware service brokering (MOLSB) aims to provide a set of trade-off solutions to minimize cost and latency. To handle dynamic resource requirements, various heuristics have been proposed to efficiently find suitable cloud services. However, these heuristics cannot achieve consistently good performance on a wide range of problem instances. Additionally, instead of replying on a single heuristic, it is desirable to design a set of effective heuristics that can balance different objectives with varied trade-offs. Genetic Programming hyper-heuristics (GPHH) have been applied to automatically design heuristics for many multi-objective dynamic optimization problems, e.g., workflow scheduling. In this pa-per, we propose a new GPHH-based approach, named GPHH-MOLSB, to automatically generate a group of Pareto-optimal heuristics that can be used to satisfy varied QoS preferences. GPHH-MOLSB can significantly outperform several existing approaches based on evaluation on real-world datasets.","PeriodicalId":327015,"journal":{"name":"2022 IEEE International Conference on Services Computing (SCC)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125610277","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}
引用次数: 2
Message from the SCC Chairs SCC主席的讲话
2022 IEEE International Conference on Services Computing (SCC) Pub Date : 2022-07-01 DOI: 10.1109/scc55611.2022.00011
{"title":"Message from the SCC Chairs","authors":"","doi":"10.1109/scc55611.2022.00011","DOIUrl":"https://doi.org/10.1109/scc55611.2022.00011","url":null,"abstract":"","PeriodicalId":327015,"journal":{"name":"2022 IEEE International Conference on Services Computing (SCC)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132097636","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}
引用次数: 0
QoE-aware Data Caching Optimization in Edge Computing Environment 边缘计算环境下基于qos的数据缓存优化
2022 IEEE International Conference on Services Computing (SCC) Pub Date : 2022-07-01 DOI: 10.1109/SCC55611.2022.00022
Zhengguo Ni, Minhao Yuan, Hancheng Tang
{"title":"QoE-aware Data Caching Optimization in Edge Computing Environment","authors":"Zhengguo Ni, Minhao Yuan, Hancheng Tang","doi":"10.1109/SCC55611.2022.00022","DOIUrl":"https://doi.org/10.1109/SCC55611.2022.00022","url":null,"abstract":"Edge computing provides users with computing resources and storage capacity by deploying edge servers around users. Existing edge data caching researches mainly focused on minimizing users’ access latency and maximizing service providers’ revenue. In this paper, this QEDC problem is addressed from the service provider’s point of view. Firstly, this QoE-oriented Edge Data Caching(QEDC) problem is modeled as a combinatorial optimization problem. Users’ QoE achieves maximization while satisfying a constraint for service providers’ cache budget, and its NP-hardness is proved. Secondly, an edge data fusion method is introduced which is more suitable for real environment and the calculation method of data popularity. In addition, an approach named QEDC-IP is provided based on Integer Programming to tackle this QEDC problem. Finally, a large number of experiments are conducted by using a mixture of real-world datasets, and the results verify the performance of QEDC-IP approach by comparing it with five representative approaches in data caching.","PeriodicalId":327015,"journal":{"name":"2022 IEEE International Conference on Services Computing (SCC)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132651689","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}
引用次数: 0
Data Marketplaces with a Free Sampling Service 提供免费抽样服务的数据市场
2022 IEEE International Conference on Services Computing (SCC) Pub Date : 2022-07-01 DOI: 10.1109/SCC55611.2022.00055
R. G. Durán, O. Esparza, J. Hernández-Serrano, Fernando Román-García, Miquel Soriano, Achille Zappa, M. Serrano, Susanne Stahnke, B. Böhm, Edgar Fries, Vasiliki Koniakou, Bruno Michel, J. L. Muñoz
{"title":"Data Marketplaces with a Free Sampling Service","authors":"R. G. Durán, O. Esparza, J. Hernández-Serrano, Fernando Román-García, Miquel Soriano, Achille Zappa, M. Serrano, Susanne Stahnke, B. Böhm, Edgar Fries, Vasiliki Koniakou, Bruno Michel, J. L. Muñoz","doi":"10.1109/SCC55611.2022.00055","DOIUrl":"https://doi.org/10.1109/SCC55611.2022.00055","url":null,"abstract":"Data is currently perceived as one of the most valuable resources by the industry. In this context, data marketplaces have emerged for facilitating data trading in a coordinated manner. To facilitate open, fair, and transparent trades, it is necessary to ensure trust, both among the different participants and stakeholders, and trust in the sense of confidence to the ecosystem. Thanks to the emergent blockchain technologies, there are new decentralized data marketplaces that provide this confidence in a decentralized manner with new disruptive services such as automated conflict resolution, non repudiation and auditable accounting. In this paper, we present a decentralized data marketplace called i3-market that implements these services. We also describe a service called free data sampling that allows a consumer and a provider to securely agree on a portion of a dataset that can be checked by the consumer before committing the purchase. Finally, the paper discusses how to integrate the free sampling service in the i3-market ecosystem.","PeriodicalId":327015,"journal":{"name":"2022 IEEE International Conference on Services Computing (SCC)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132706729","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}
引用次数: 1
Blockchain Simulators: A Systematic Mapping Study 区块链模拟器:系统映射研究
2022 IEEE International Conference on Services Computing (SCC) Pub Date : 2022-07-01 DOI: 10.1109/SCC55611.2022.00049
Adel Albshri, Ali Alzubaidi, Bakri Awaji, E. Solaiman
{"title":"Blockchain Simulators: A Systematic Mapping Study","authors":"Adel Albshri, Ali Alzubaidi, Bakri Awaji, E. Solaiman","doi":"10.1109/SCC55611.2022.00049","DOIUrl":"https://doi.org/10.1109/SCC55611.2022.00049","url":null,"abstract":"Recently, distributed ledger technologies like blockchain have been proliferating and have attracted interest from the academic community, government, and industry. A wide range of blockchain solutions has been introduced, such as Bitcoin, Ethereum, and Hyperledger technologies in the literature. However, tools for evaluating these solutions and their applications are still lacking, limiting the exploration of their potentiality and associated challenges/limitations. That is, experimenting with real blockchain networks usually requires a solid budget; and thus, sophisticated blockchain simulators can facilitate designing and evaluating solutions before the actual implementation stage. The quality of such simulators depends on several factors such as usability, reliability, provided capabilities, and supported features. This paper aims to provide a systemic mapping review of blockchain simulators focusing on these quality factors. This paper also sheds light on the configuration parameters (inputs) and produced metrics (outputs) supported by each simulator. Furthermore, it investigates which metrics supported by each simulator are scientifically validated/evaluated. Moreover, code quality comparison is carried out to assess the source code of the covered simulators. The results reveal that no simulator fully covers the wide operational range of features and capabilities of existing blockchain technologies. However, several promising efforts exist in the domain of blockchain simulation with interesting and useful features. Finally, we discuss the subject of blockchain simulation and provide our insight into the matter.","PeriodicalId":327015,"journal":{"name":"2022 IEEE International Conference on Services Computing (SCC)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114598232","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}
引用次数: 7
Fast, Transparent, and High-Fidelity Memoization Cache-Keys for Computational Workflows 快速,透明,高保真记忆缓存键计算工作流
2022 IEEE International Conference on Services Computing (SCC) Pub Date : 2022-07-01 DOI: 10.1109/SCC55611.2022.00036
V. Vassiliadis, Michael Johnston, J. McDonagh
{"title":"Fast, Transparent, and High-Fidelity Memoization Cache-Keys for Computational Workflows","authors":"V. Vassiliadis, Michael Johnston, J. McDonagh","doi":"10.1109/SCC55611.2022.00036","DOIUrl":"https://doi.org/10.1109/SCC55611.2022.00036","url":null,"abstract":"Computational workflows are important methods for automating complex data-generation and analysis pipelines. Workflows are composed of sub-graphs that perform specific tasks. Certain sub-graphs may appear in multiple workflows. This implies that the same task, with the same input, may execute multiple times thereby wasting computational resources. Additionally, hybrid cloud environments spanning across on-premises and public cloud deployments are increasingly popular. Identical tasks may not only execute multiple times but also on multiple heterogeneous environments. Memoization, a technique to reduce the number of redundant task executions, can tackle this problem. There is a significant body of work for the memoization of workflows. However, prior studies have only been able to satisfy at most two of the three desired features of workflow memoization: transparency (leveraged automatically), performance, and fidelity (identify desired redundant tasks). This paper first introduces a taxonomy for understanding memoization. Next, we describe a novel algorithm that uses a walk in the workflow graph to transparently generate fast and high-fidelity memoization cache-keys, overcoming limitations in prior approaches. We evaluate our scheme using three industry motivated quantum chemistry workflows and two geo-distributed OpenShift clusters. Our experimental evaluation results show the implemented scheme is fast (O(ms)) and can remove nontrivial sources of false positives and negatives that other methods may generate. Finally, we illustrate the proposed workflow memoization scheme can reduce the duration of our benchmarks by up to 10.55x nearly matching the theoretical maximum speedup of memoization for these workloads (10.69x).","PeriodicalId":327015,"journal":{"name":"2022 IEEE International Conference on Services Computing (SCC)","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130752567","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}
引用次数: 4
An Enhanced Particle Swarm Approach for UAV Data Collection Service in Disaster Environment 灾害环境下无人机数据采集服务的增强粒子群方法
2022 IEEE International Conference on Services Computing (SCC) Pub Date : 2022-07-01 DOI: 10.1109/SCC55611.2022.00038
Ruixin Jin, Rongheng Lin, Zheyu He
{"title":"An Enhanced Particle Swarm Approach for UAV Data Collection Service in Disaster Environment","authors":"Ruixin Jin, Rongheng Lin, Zheyu He","doi":"10.1109/SCC55611.2022.00038","DOIUrl":"https://doi.org/10.1109/SCC55611.2022.00038","url":null,"abstract":"In the scenario of Unmanned Aerial Vehicle -Wireless Sensor Network(UAV-WSN) collaborative assisted communication, traditional research focuses on the acquisition rate and energy consumption optimization of UAVs, without considering the underlying wireless sensor network. In the air-ground collaborative disaster relief scenario proposed in this article, a UAV path planning framework based on binary particle swarm algorithm(BPSO) is proposed to solve the UAV trajectory planning problem in UAV-assisted wireless sensor networks. The framework proposed in this paper realizes path planning for the dynamic allocation of data transmission time and acquisition energy consumption between collection nodes and UAVs. The time of data transmission and the energy consumption of collection nodes for UAV are the constraints. Considering the data migration of the underlying network(WSN), aiming at maximizing the value of data utilization. The simulation experiments validated the good performance in terms of integrity and efficiency. Compared with the algorithm that does not consider the underlying network data migration, the algorithm proposed in this paper can maximize the energy utilization efficiency of the UAV. In this paper, the data migration of the underlying network is considered, and a node is completely collected, which ensures the integrity of the data, and the performance is 55.19% better than the algorithm without considering the integrity. At the same time, as for collection efficiency, the performance of the framework is 38.04% better than the greedy algorithm, 18.55% better than the OR-Tools path planning algorithm proposed by Google, and 48.07% better than the straight algorithm. It has important theoretical significance and application value.","PeriodicalId":327015,"journal":{"name":"2022 IEEE International Conference on Services Computing (SCC)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131531936","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}
引用次数: 0
Investigating the Linguistic Design Quality of Public, Partner, and Private REST APIs 调查公共、合作伙伴和私有REST api的语言设计质量
2022 IEEE International Conference on Services Computing (SCC) Pub Date : 2022-07-01 DOI: 10.1109/SCC55611.2022.00017
Francis Palma, Tobias Olsson, Anna Wingkvist, F. Ahlgren, Daniel Toll
{"title":"Investigating the Linguistic Design Quality of Public, Partner, and Private REST APIs","authors":"Francis Palma, Tobias Olsson, Anna Wingkvist, F. Ahlgren, Daniel Toll","doi":"10.1109/SCC55611.2022.00017","DOIUrl":"https://doi.org/10.1109/SCC55611.2022.00017","url":null,"abstract":"Application Programming Interfaces (APIs) define how Web services, middle-wares, frameworks, and libraries communicate with their clients. An API that conforms to REpresentational State Transfer (REST) design principles is known as REST API. At present, it is an industry-standard for interaction among Web services. There exist mainly three categories of APIs: public, partner, and private. Public APIs are designed for external consumers, whereas partner APIs are designed aiming at organizational partners. In contrast, private APIs are designed solely for internal use. The API quality matters regardless of their category and intended consumers. To assess the (linguistic) design of APIs, researchers defined linguistic patterns (i.e., best API design practices) and linguistic antipatterns (i.e., poor API design practices.) APIs that follow linguistic patterns are easy to understand, use, and maintain. In this study, we analyze and compare the design quality of public, partner, and private APIs. More specifically, we made a large survey by analyzing and performing the detection of nine linguistic patterns and their corresponding antipatterns on more than 2,500 end-points from 37 APIs. Our results suggest that (1) public, partner, and private APIs lack quality linguistic design, (2) among the three API categories, private APIs lack linguistic design the most, and (3) end-points are amorphous, contextless, and non-descriptive in partner APIs. End-points have contextless design and poor documentation regardless of the API categories.","PeriodicalId":327015,"journal":{"name":"2022 IEEE International Conference on Services Computing (SCC)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117214780","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}
引用次数: 1
Energy-efficient Edge-cloud Collaborative Intelligent Computing: A Two-timescale Approach 节能边缘云协同智能计算:双时间尺度方法
2022 IEEE International Conference on Services Computing (SCC) Pub Date : 2022-07-01 DOI: 10.1109/SCC55611.2022.00044
Tao Wang, Yuru Jiang, Kailan Zhao, Xiulei Liu
{"title":"Energy-efficient Edge-cloud Collaborative Intelligent Computing: A Two-timescale Approach","authors":"Tao Wang, Yuru Jiang, Kailan Zhao, Xiulei Liu","doi":"10.1109/SCC55611.2022.00044","DOIUrl":"https://doi.org/10.1109/SCC55611.2022.00044","url":null,"abstract":"The integration of edge and cloud computing is an emerging collaborative technology for Artificial intelligence (AI) task processing. This paper proposes a new two-timescale online control framework to jointly optimize energy consumption of an edge-cloud collaborative intelligent computing system and AI task response delay. The key idea is to apply dual-agent deep reinforcement learning approach, where Deep Deterministic Policy Gradient (DDPG) agents operate in a coarse-grained timescale to determine edge computation resource configuration, while Deep Q-Network (DQN) agents operate in a fine-grained timescale to conduct AI task offloading. The DDPG and DQN agents are bridged through the sharing reward function. The results show that the proposed approach is able to reduce the energy consumption by up to 46.5%, and decreases the task response latency by about a half, as compared to other alternatives. Our approach can save energy cost for a new generation of edge cloud service providers.","PeriodicalId":327015,"journal":{"name":"2022 IEEE International Conference on Services Computing (SCC)","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123962174","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}
引用次数: 0
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书