Pub Date : 2021-09-01DOI: 10.1109/services51467.2021.00031
Ting Hu, Yucong Duan
Traditional expression of emotion generally uses tone of voice or modality to express emotion content of a sender. There are limitations in expression space and personal differences in cognition, which can lead to misunderstanding. To solve these problems, we propose an emotion communication method based on Data, Information, Knowledge and Wisdom (DIKW). Firstly, the content expression of a sender transforms into Data, Information and Knowledge type resources by conceptualizing and abstracting for personalised services. In order to reduce unnecessary input costs, analysis of a sender purpose regulates the range of Data, Information, Knowledge and the transmission range of Data, Information, Knowledge. The order of priority for transferring them is in descending order of weight. Then, reshaping emotion content forms a topology that matches a receiver cognition ability to achieve a certain level of accuracy and efficiency transmission. Finally, using value-oriented assessment of emotion communications and blocking intrusions achieves a certain accuracy and efficiency and secure transmission.
{"title":"Modeling and Measuring for Emotion Communication based on DIKW","authors":"Ting Hu, Yucong Duan","doi":"10.1109/services51467.2021.00031","DOIUrl":"https://doi.org/10.1109/services51467.2021.00031","url":null,"abstract":"Traditional expression of emotion generally uses tone of voice or modality to express emotion content of a sender. There are limitations in expression space and personal differences in cognition, which can lead to misunderstanding. To solve these problems, we propose an emotion communication method based on Data, Information, Knowledge and Wisdom (DIKW). Firstly, the content expression of a sender transforms into Data, Information and Knowledge type resources by conceptualizing and abstracting for personalised services. In order to reduce unnecessary input costs, analysis of a sender purpose regulates the range of Data, Information, Knowledge and the transmission range of Data, Information, Knowledge. The order of priority for transferring them is in descending order of weight. Then, reshaping emotion content forms a topology that matches a receiver cognition ability to achieve a certain level of accuracy and efficiency transmission. Finally, using value-oriented assessment of emotion communications and blocking intrusions achieves a certain accuracy and efficiency and secure transmission.","PeriodicalId":210534,"journal":{"name":"2021 IEEE World Congress on Services (SERVICES)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125200402","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}
Pub Date : 2021-09-01DOI: 10.1109/services51467.2021.00018
A. Chakraborty, A. Mondal, Arijit Roy, S. Misra
Sensor-cloud architecture is a wireless sensor network (WSN)-based Service-Oriented Architecture (SOA), in which a Sensor-Cloud Service Provider (SCSP) obtains WSNs on rental basis from multiple sensor-owners and provides these resources to the users in the form of chargeable units of services, termed as Sensors-as-a-Service (Se-aaS). A fraction of the revenue earned by the SCSP from the users is distributed among the oligopolistic sensor-owners for the usage of their nodes. Due to the inter-dependency among the sensor-owners for Se-aaS provisioning, selfish sensor-owners behave dishonestly to gain higher profits, thereby degrading the overall QoS. Existing works on sensor-cloud fail to address this issue. Hence, in this work, we propose DETER, a dynamic trust enforcing pricing scheme, which enforces trust among the selfish sensor-owners while ensuring profits for the SCSP.
{"title":"Dynamic Trust Enforcing Pricing Scheme for Sensors-as-a-Service in Sensor-Cloud Infrastructure","authors":"A. Chakraborty, A. Mondal, Arijit Roy, S. Misra","doi":"10.1109/services51467.2021.00018","DOIUrl":"https://doi.org/10.1109/services51467.2021.00018","url":null,"abstract":"Sensor-cloud architecture is a wireless sensor network (WSN)-based Service-Oriented Architecture (SOA), in which a Sensor-Cloud Service Provider (SCSP) obtains WSNs on rental basis from multiple sensor-owners and provides these resources to the users in the form of chargeable units of services, termed as Sensors-as-a-Service (Se-aaS). A fraction of the revenue earned by the SCSP from the users is distributed among the oligopolistic sensor-owners for the usage of their nodes. Due to the inter-dependency among the sensor-owners for Se-aaS provisioning, selfish sensor-owners behave dishonestly to gain higher profits, thereby degrading the overall QoS. Existing works on sensor-cloud fail to address this issue. Hence, in this work, we propose DETER, a dynamic trust enforcing pricing scheme, which enforces trust among the selfish sensor-owners while ensuring profits for the SCSP.","PeriodicalId":210534,"journal":{"name":"2021 IEEE World Congress on Services (SERVICES)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133452178","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}
Pub Date : 2021-09-01DOI: 10.1109/services51467.2021.00011
{"title":"In Memoriam: Professor Mikio Aoyama","authors":"","doi":"10.1109/services51467.2021.00011","DOIUrl":"https://doi.org/10.1109/services51467.2021.00011","url":null,"abstract":"","PeriodicalId":210534,"journal":{"name":"2021 IEEE World Congress on Services (SERVICES)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117005661","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}
Pub Date : 2021-09-01DOI: 10.1109/services51467.2021.00007
{"title":"Message from Services Workshop Program Chairs","authors":"","doi":"10.1109/services51467.2021.00007","DOIUrl":"https://doi.org/10.1109/services51467.2021.00007","url":null,"abstract":"","PeriodicalId":210534,"journal":{"name":"2021 IEEE World Congress on Services (SERVICES)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129698482","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}
Pub Date : 2021-09-01DOI: 10.1109/services51467.2021.00060
{"title":"Plenary Panel 3 - Advances & Challenges in Software Service Engineering","authors":"","doi":"10.1109/services51467.2021.00060","DOIUrl":"https://doi.org/10.1109/services51467.2021.00060","url":null,"abstract":"","PeriodicalId":210534,"journal":{"name":"2021 IEEE World Congress on Services (SERVICES)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132640391","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}
Pub Date : 2021-09-01DOI: 10.1109/services51467.2021.00046
Bo Lv, Weilong Ding, Ji Liu
A Workflow management system (WfMS) is usually deployed in a Cloud environment in a distributed architecture, and the execution of the process task requires the workflow engine to parse the process definition in its cache. However, the current WfMS seldom considers the problem of the cache hit, which leads to repeated parse and decreases request response time and service quality of WfMS. A task execution dispatching method is proposed in this paper based on cache mechanism. The method enables each task’s requests to be dispatched to the best matching worker, and comprehensively utilizes the cache in the worker or the database. After experiments of practical scenes, compared with two traditional ones commonly used in business, our method is proved to improve the cache hit rate, reduces the response time, and improves system performance.
{"title":"Cache-based Executive Request Dispatching Method in The Distributed Workflow System","authors":"Bo Lv, Weilong Ding, Ji Liu","doi":"10.1109/services51467.2021.00046","DOIUrl":"https://doi.org/10.1109/services51467.2021.00046","url":null,"abstract":"A Workflow management system (WfMS) is usually deployed in a Cloud environment in a distributed architecture, and the execution of the process task requires the workflow engine to parse the process definition in its cache. However, the current WfMS seldom considers the problem of the cache hit, which leads to repeated parse and decreases request response time and service quality of WfMS. A task execution dispatching method is proposed in this paper based on cache mechanism. The method enables each task’s requests to be dispatched to the best matching worker, and comprehensively utilizes the cache in the worker or the database. After experiments of practical scenes, compared with two traditional ones commonly used in business, our method is proved to improve the cache hit rate, reduces the response time, and improves system performance.","PeriodicalId":210534,"journal":{"name":"2021 IEEE World Congress on Services (SERVICES)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133302847","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}
Pub Date : 2021-09-01DOI: 10.1109/services51467.2021.00035
Jinyu Tian, Jing Qin, Li-Ming Chen, Hui Fang, Zumin Wang
Network traffic prediction is essential for network management and resource scheduling within Web information systems. However, existing prediction methods have difficulty fitting mutation values in traffic time-series data and are still inadequate in terms of precision. Here we describe a method for prediction using multimodal web traffic data. The method creates multi-dimensional time series on request traffic, response traffic, and abnormal code traffic, and uses the rich information contained in the different sequences in the preceding time window to make inferences about the traffic scale in subsequent time windows. In addition, we propose an improved algorithm based on the Gated Recurrent Unit (GRU) to reduce the prediction error. The algorithm introduces the residual structure into a stacked multi-layer recurrent network structure and uses the Mogrifier structure to interact the information before it is fed to the gating unit. The experimental results show that the improved method leads to a further reduction in the error between the predicted and true values, providing high usability in the field of network traffic prediction.
{"title":"A Novel Method for Network Traffic Prediction Using Residual Mogrifier GRU","authors":"Jinyu Tian, Jing Qin, Li-Ming Chen, Hui Fang, Zumin Wang","doi":"10.1109/services51467.2021.00035","DOIUrl":"https://doi.org/10.1109/services51467.2021.00035","url":null,"abstract":"Network traffic prediction is essential for network management and resource scheduling within Web information systems. However, existing prediction methods have difficulty fitting mutation values in traffic time-series data and are still inadequate in terms of precision. Here we describe a method for prediction using multimodal web traffic data. The method creates multi-dimensional time series on request traffic, response traffic, and abnormal code traffic, and uses the rich information contained in the different sequences in the preceding time window to make inferences about the traffic scale in subsequent time windows. In addition, we propose an improved algorithm based on the Gated Recurrent Unit (GRU) to reduce the prediction error. The algorithm introduces the residual structure into a stacked multi-layer recurrent network structure and uses the Mogrifier structure to interact the information before it is fed to the gating unit. The experimental results show that the improved method leads to a further reduction in the error between the predicted and true values, providing high usability in the field of network traffic prediction.","PeriodicalId":210534,"journal":{"name":"2021 IEEE World Congress on Services (SERVICES)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134045704","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 describe PACOL (Panoramic-Collaboration), a decentralized and multi-layered architecture of runtime environment for service collaboration. We illustrate by a case study why it is designed as a decentralized control architecture, and why it is designed to support multi-tenants and service solution evolution and continuous optimization. Preliminary case analysis indicates that PACOL could be a feasible proposition to realise cross-domain, reliable and optimized service collaboration for service collaboration towards Internet of Services.
{"title":"A Decentralized Runtime Environment for Service Collaboration: the Architecture and a Case Study","authors":"Jing Gao, Guiling Wang, Zhongguo Yang, Zhuofeng Zhao","doi":"10.1109/services51467.2021.00044","DOIUrl":"https://doi.org/10.1109/services51467.2021.00044","url":null,"abstract":"In this paper, we describe PACOL (Panoramic-Collaboration), a decentralized and multi-layered architecture of runtime environment for service collaboration. We illustrate by a case study why it is designed as a decentralized control architecture, and why it is designed to support multi-tenants and service solution evolution and continuous optimization. Preliminary case analysis indicates that PACOL could be a feasible proposition to realise cross-domain, reliable and optimized service collaboration for service collaboration towards Internet of Services.","PeriodicalId":210534,"journal":{"name":"2021 IEEE World Congress on Services (SERVICES)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115689444","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}
Pub Date : 2021-09-01DOI: 10.1109/services51467.2021.00034
Q. Duan, Maryam Roshanaei
Federated Learning (FL) deployed in edge computing may achieve some advantages such as private data protection, communication cost reduction, and lower training latency compared to cloud-centric training approaches. The Anything-as-a-Service (XaaS) paradigm, as the main service provisioning model in edge computing, enables various flexible FL deployments. On the other hand, the distributed nature of FL together with the highly diverse computing and networking infrastructures in an edge environment introduce extra latency that may degrade FL performance. Therefore, delay performance evaluation on edge-based FL systems becomes an important research topic. However, XaaS-based FL deployment brings new challenges to performance analysis that cannot be well addressed by conventional analytical approaches. In this paper, we attempt to address such challenges by proposing a profile-based modeling and analysis method for evaluating delay performance of edge-based FL systems. The insights obtained from the modeling and analysis may offer useful guidelines to various aspects of FL design. Application of network calculus techniques makes the proposed method general and flexible, thus may be applied to FL systems deployed upon the heterogeneous edge infrastructures.
{"title":"Modeling and Performance Analysis on Federated Learning in Edge Computing","authors":"Q. Duan, Maryam Roshanaei","doi":"10.1109/services51467.2021.00034","DOIUrl":"https://doi.org/10.1109/services51467.2021.00034","url":null,"abstract":"Federated Learning (FL) deployed in edge computing may achieve some advantages such as private data protection, communication cost reduction, and lower training latency compared to cloud-centric training approaches. The Anything-as-a-Service (XaaS) paradigm, as the main service provisioning model in edge computing, enables various flexible FL deployments. On the other hand, the distributed nature of FL together with the highly diverse computing and networking infrastructures in an edge environment introduce extra latency that may degrade FL performance. Therefore, delay performance evaluation on edge-based FL systems becomes an important research topic. However, XaaS-based FL deployment brings new challenges to performance analysis that cannot be well addressed by conventional analytical approaches. In this paper, we attempt to address such challenges by proposing a profile-based modeling and analysis method for evaluating delay performance of edge-based FL systems. The insights obtained from the modeling and analysis may offer useful guidelines to various aspects of FL design. Application of network calculus techniques makes the proposed method general and flexible, thus may be applied to FL systems deployed upon the heterogeneous edge infrastructures.","PeriodicalId":210534,"journal":{"name":"2021 IEEE World Congress on Services (SERVICES)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115933838","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}
Pub Date : 2021-09-01DOI: 10.1109/services51467.2021.00013
M. Barati, Omer F. Rana
Accessing a cloud-hosted service may involve executing a number of sub-services which are unknown to the user. A user is only aware of the service they directly invoke, not the sub-services which may be hosted across other cloud providers (including advertising and data processing services). Each service in this chain may collect and process personal user data via read, write and transfer operations. The European General Data Protection Regulation (GDPR) enforces cloud providers to receive explicit consent from their users prior to executing any such operations. We present a Blockchain-based architecture that supports GDPR compliance verification (especially in the context of such a service chain) for enhancing the data privacy of cloud users. The architecture supports a factory of smart contracts, including user consent , GDPR compliance , container and verification , each of which is activated by an actor within a cloud environment. Figure 1 illustrates the interactions between the different components that make up our system – classified into three different phases:
{"title":"Checking GDPR Compliance for Cloud-based Services","authors":"M. Barati, Omer F. Rana","doi":"10.1109/services51467.2021.00013","DOIUrl":"https://doi.org/10.1109/services51467.2021.00013","url":null,"abstract":"Accessing a cloud-hosted service may involve executing a number of sub-services which are unknown to the user. A user is only aware of the service they directly invoke, not the sub-services which may be hosted across other cloud providers (including advertising and data processing services). Each service in this chain may collect and process personal user data via read, write and transfer operations. The European General Data Protection Regulation (GDPR) enforces cloud providers to receive explicit consent from their users prior to executing any such operations. We present a Blockchain-based architecture that supports GDPR compliance verification (especially in the context of such a service chain) for enhancing the data privacy of cloud users. The architecture supports a factory of smart contracts, including user consent , GDPR compliance , container and verification , each of which is activated by an actor within a cloud environment. Figure 1 illustrates the interactions between the different components that make up our system – classified into three different phases:","PeriodicalId":210534,"journal":{"name":"2021 IEEE World Congress on Services (SERVICES)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127433337","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
扫码关注我们
求助内容：
应助结果提醒方式：