Pub Date : 2023-07-01DOI: 10.1109/CSCloud-EdgeCom58631.2023.00050
Yihan Kong, Qinyang Chen, Jing Li, Ting Xiong, Tao Xie
This paper introduces EVONChain, a nature-inspired evolvable blockchain that addresses scalability issues in large-scale blockchain applications. EVONChain decouples the functions of a full blockchain node into two consensus phases. A small number of high-performance cloud nodes in the inner network handle transaction validation, block packaging, and consistent replication using the “longest chain” rule. Meanwhile, a large number of low-performance user nodes connected by Mobile Edge Computing (MEC) providers in the outer network handle the Proof of Intelligent (PoI), a novel Proof of Work (PoW) mechanism that resists Application-Specific Integrated Circuit (ASIC) computing and enables “one-CPU-one-vote” principle. This architecture enables EVONChain to achieve perfect decentralization, high scalability and security. To evaluate EVONChain’s performance, we developed a simulator. Simulation results show that EVONChain can achieve a throughput of over 10,000 transactions per second (TPS) with an inner network bandwidth of 4Gbps, a block interval of 10 seconds, and an orphaned block rate of less than 7%. This indicates that EVONChain significantly improves performance scalability for high-frequency applications, reduces confirmation time to the minute level, while maintaining a comparable level of security to the Ethereum network.
{"title":"EVONChain: A Public Blockchain Architecture with Bi-tiered Network for Edge Computing","authors":"Yihan Kong, Qinyang Chen, Jing Li, Ting Xiong, Tao Xie","doi":"10.1109/CSCloud-EdgeCom58631.2023.00050","DOIUrl":"https://doi.org/10.1109/CSCloud-EdgeCom58631.2023.00050","url":null,"abstract":"This paper introduces EVONChain, a nature-inspired evolvable blockchain that addresses scalability issues in large-scale blockchain applications. EVONChain decouples the functions of a full blockchain node into two consensus phases. A small number of high-performance cloud nodes in the inner network handle transaction validation, block packaging, and consistent replication using the “longest chain” rule. Meanwhile, a large number of low-performance user nodes connected by Mobile Edge Computing (MEC) providers in the outer network handle the Proof of Intelligent (PoI), a novel Proof of Work (PoW) mechanism that resists Application-Specific Integrated Circuit (ASIC) computing and enables “one-CPU-one-vote” principle. This architecture enables EVONChain to achieve perfect decentralization, high scalability and security. To evaluate EVONChain’s performance, we developed a simulator. Simulation results show that EVONChain can achieve a throughput of over 10,000 transactions per second (TPS) with an inner network bandwidth of 4Gbps, a block interval of 10 seconds, and an orphaned block rate of less than 7%. This indicates that EVONChain significantly improves performance scalability for high-frequency applications, reduces confirmation time to the minute level, while maintaining a comparable level of security to the Ethereum network.","PeriodicalId":56007,"journal":{"name":"Journal of Cloud Computing-Advances Systems and Applications","volume":"81 1","pages":"247-253"},"PeriodicalIF":4.0,"publicationDate":"2023-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83609665","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-07-01DOI: 10.1109/CSCloud-EdgeCom58631.2023.00058
Baofeng Qi, Shaojiang Sun, Yihui Tong, J. Zhang, Zhehe Wang, Xianchao Wang
Addition is the most basic operation in arithmetic. And the binary number system is used to implement the adder in modern electronic computer. The inherent properties of binary make it difficult to implement carry-free addition. And the redundancy of Modified Signed Digit(MSD) number system has been applied to implementing carry-free addition by use of four logic transformations. This paper explores in depth the reason why the MSD number system can be used to implement carry-free addition and obtain 16 pairs of transformation which can be used to implement MSD addition. Moreover, we obtain all transformation combinations for three-step MSD addition by designing relevant algorithms. Meanwhile, we find the test data set with minimum number of trits for MSD addition. Finally, to improve computational efficiency, we explore the optimal transformation combinations for implementation of MSD adder. And we find that there are four optimal transformation combinations, i.e. (5, 3, 0), (5, 3, 1), (10,2,0), and (10, 2, 4) which all use the same number of basic operating units(BOUs).
{"title":"Algorithm-based Study on Transformation Combination for Carry-free Modified Signed Digit(MSD) Addition","authors":"Baofeng Qi, Shaojiang Sun, Yihui Tong, J. Zhang, Zhehe Wang, Xianchao Wang","doi":"10.1109/CSCloud-EdgeCom58631.2023.00058","DOIUrl":"https://doi.org/10.1109/CSCloud-EdgeCom58631.2023.00058","url":null,"abstract":"Addition is the most basic operation in arithmetic. And the binary number system is used to implement the adder in modern electronic computer. The inherent properties of binary make it difficult to implement carry-free addition. And the redundancy of Modified Signed Digit(MSD) number system has been applied to implementing carry-free addition by use of four logic transformations. This paper explores in depth the reason why the MSD number system can be used to implement carry-free addition and obtain 16 pairs of transformation which can be used to implement MSD addition. Moreover, we obtain all transformation combinations for three-step MSD addition by designing relevant algorithms. Meanwhile, we find the test data set with minimum number of trits for MSD addition. Finally, to improve computational efficiency, we explore the optimal transformation combinations for implementation of MSD adder. And we find that there are four optimal transformation combinations, i.e. (5, 3, 0), (5, 3, 1), (10,2,0), and (10, 2, 4) which all use the same number of basic operating units(BOUs).","PeriodicalId":56007,"journal":{"name":"Journal of Cloud Computing-Advances Systems and Applications","volume":"33 1","pages":"298-304"},"PeriodicalIF":4.0,"publicationDate":"2023-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90834923","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In the industrial environment, machines often need to reflect the anomaly detection results to the total control center in time, and the general industrial network can not achieve high real-time. In order to solve such challenges, a set of protocol standards developed by IEEE802.1 working group, namely Time-sensitive Networking (TSN), has been introduced into industrial networks. TSN can provide high real-time and reliability for data transmission, where the reliability is achieved by Frame duplication and Frame Elimination (FRER). In the realization process of FRER, it is necessary to determine the source node, destination node, and multiple disjoint paths to transmit redundant data. However, the transmission of these redundant traffic may result in the delay of other flows, and then affects the user experience. Therefore, it is very important to choose excellent redundant traffic paths to ensure reliability and reduce the impact on other flows. In the existing research, there are many dynamic scheduling and routing heuristics to determine the path, but they do not consider the influence of the location of the source node on the whole route scheduling. This paper proposes an improved dynamic scheduling and routing heuristic method, which takes the source node into account in the routing selection. In the flow test experiments of different magnitudes, it is found that the total delay of all flows is reduced by 1.4%-4.5% under the same magnitude of schedulability compared with Ant Colony Optimization.
在工业环境中，机器往往需要将异常检测结果及时反映到总控制中心，一般工业网络无法实现高实时性。为了解决这些挑战，IEEE802.1工作组开发的一套协议标准，即时间敏感网络(TSN)被引入到工业网络中。TSN可以为数据传输提供较高的实时性和可靠性，其中可靠性是通过帧重复和帧消除(Frame duplication and Frame Elimination, FRER)实现的。在frr的实现过程中，需要确定源节点、目的节点和多条不相交的路径来传输冗余数据。但是，这些冗余流量的传输可能会导致其他流量的传输延迟，从而影响用户体验。因此，选择优秀的冗余流量路径以保证可靠性和减少对其他流量的影响是非常重要的。在现有的研究中，有许多动态调度和路由启发式方法来确定路径，但它们没有考虑源节点位置对整个路由调度的影响。本文提出了一种改进的动态调度和路由启发式方法，该方法在路由选择中考虑了源节点。在不同量级的流测试实验中发现，在相同量级的可调度性下，与蚁群优化相比，所有流的总延迟减少了1.4% ~ 4.5%。
{"title":"A Heuristic-based Dynamic Scheduling and Routing Method for Industrial TSN Networks","authors":"Honglong Chen, Mindong Liu, Jing Huang, Zhiling Zheng, Weihong Huang, Yufeng Xiao","doi":"10.1109/CSCloud-EdgeCom58631.2023.00081","DOIUrl":"https://doi.org/10.1109/CSCloud-EdgeCom58631.2023.00081","url":null,"abstract":"In the industrial environment, machines often need to reflect the anomaly detection results to the total control center in time, and the general industrial network can not achieve high real-time. In order to solve such challenges, a set of protocol standards developed by IEEE802.1 working group, namely Time-sensitive Networking (TSN), has been introduced into industrial networks. TSN can provide high real-time and reliability for data transmission, where the reliability is achieved by Frame duplication and Frame Elimination (FRER). In the realization process of FRER, it is necessary to determine the source node, destination node, and multiple disjoint paths to transmit redundant data. However, the transmission of these redundant traffic may result in the delay of other flows, and then affects the user experience. Therefore, it is very important to choose excellent redundant traffic paths to ensure reliability and reduce the impact on other flows. In the existing research, there are many dynamic scheduling and routing heuristics to determine the path, but they do not consider the influence of the location of the source node on the whole route scheduling. This paper proposes an improved dynamic scheduling and routing heuristic method, which takes the source node into account in the routing selection. In the flow test experiments of different magnitudes, it is found that the total delay of all flows is reduced by 1.4%-4.5% under the same magnitude of schedulability compared with Ant Colony Optimization.","PeriodicalId":56007,"journal":{"name":"Journal of Cloud Computing-Advances Systems and Applications","volume":"12 1","pages":"440-445"},"PeriodicalIF":4.0,"publicationDate":"2023-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87290712","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-07-01DOI: 10.1109/CSCloud-EdgeCom58631.2023.00066
Vikram Pandey, Juan Li, Yan Bai
This paper proposes an innovative IoT service platform that leverages blockchain technology to enable secure and scalable IoT services. The platform is designed to be open to multiple IoT services and applications, and can be easily extended to provide secure registration, discovery, access, and payment services to both IoT providers and consumers. The proposed platform adopts an ontology-based approach for describing IoT services, which enables flexible and natural search for relevant services by both humans and machines. The use of semantic service descriptions also allows for effective access control to device data and secure transactions through the use of smart contracts. To increase scalability, we have utilized a peer-to-peer (P2P) based method to store and index service metadata, which enables efficient and scalable service discovery. Our experimental results have demonstrated the effectiveness of the proposed system in providing secure and scalable IoT services, while also enabling flexible and natural search for relevant services. Overall, the proposed IoT service platform has the potential to make IoT more accessible for daily use, while also providing enhanced security and scalability for IoT services.
{"title":"A Secure Semantics-enhanced Decentralized Open IoT Service Platform","authors":"Vikram Pandey, Juan Li, Yan Bai","doi":"10.1109/CSCloud-EdgeCom58631.2023.00066","DOIUrl":"https://doi.org/10.1109/CSCloud-EdgeCom58631.2023.00066","url":null,"abstract":"This paper proposes an innovative IoT service platform that leverages blockchain technology to enable secure and scalable IoT services. The platform is designed to be open to multiple IoT services and applications, and can be easily extended to provide secure registration, discovery, access, and payment services to both IoT providers and consumers. The proposed platform adopts an ontology-based approach for describing IoT services, which enables flexible and natural search for relevant services by both humans and machines. The use of semantic service descriptions also allows for effective access control to device data and secure transactions through the use of smart contracts. To increase scalability, we have utilized a peer-to-peer (P2P) based method to store and index service metadata, which enables efficient and scalable service discovery. Our experimental results have demonstrated the effectiveness of the proposed system in providing secure and scalable IoT services, while also enabling flexible and natural search for relevant services. Overall, the proposed IoT service platform has the potential to make IoT more accessible for daily use, while also providing enhanced security and scalability for IoT services.","PeriodicalId":56007,"journal":{"name":"Journal of Cloud Computing-Advances Systems and Applications","volume":"157 1","pages":"349-356"},"PeriodicalIF":4.0,"publicationDate":"2023-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77476020","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-07-01DOI: 10.1109/CSCloud-EdgeCom58631.2023.00042
Wenyu Tang, Mingdong Tang, Fenfang Xie
The widespread adoption of cloud computing has given rise to numerous cloud services with various functionalities, which are very useful in creating cloud applications. To ensure high reliability of cloud applications, it is crucial to invoke the right cloud services with optimal quality of service (QoS) in the runtime. Thus, predicting QoS of cloud services dynamically becomes a need. Previous methods do not take into a full consideration of the relationships between users, services, and time, thus their models’ expressive ability is limited. Based on the intricate relationships between users, services and time, this paper proposes a temporal-aware QoS prediction approach via exploiting tensor factorization and self-attention representation (TFSA) for cloud services. TFSA firsty utilizes tensor factorization to historical QoS data and leverages a self-attention mechanism to refine the personalized representations of users, services and time. Then, TFSA integrates the original and personalized representations for QoS predictions. Extensive experiments conducted on a real-world dataset show that the proposed approach significantly outperforms the other state-of-the-art methods with better prediction accuracy.
{"title":"Temporal-aware QoS Prediction based on Tensor Factorization and Self-Attention for Cloud Services","authors":"Wenyu Tang, Mingdong Tang, Fenfang Xie","doi":"10.1109/CSCloud-EdgeCom58631.2023.00042","DOIUrl":"https://doi.org/10.1109/CSCloud-EdgeCom58631.2023.00042","url":null,"abstract":"The widespread adoption of cloud computing has given rise to numerous cloud services with various functionalities, which are very useful in creating cloud applications. To ensure high reliability of cloud applications, it is crucial to invoke the right cloud services with optimal quality of service (QoS) in the runtime. Thus, predicting QoS of cloud services dynamically becomes a need. Previous methods do not take into a full consideration of the relationships between users, services, and time, thus their models’ expressive ability is limited. Based on the intricate relationships between users, services and time, this paper proposes a temporal-aware QoS prediction approach via exploiting tensor factorization and self-attention representation (TFSA) for cloud services. TFSA firsty utilizes tensor factorization to historical QoS data and leverages a self-attention mechanism to refine the personalized representations of users, services and time. Then, TFSA integrates the original and personalized representations for QoS predictions. Extensive experiments conducted on a real-world dataset show that the proposed approach significantly outperforms the other state-of-the-art methods with better prediction accuracy.","PeriodicalId":56007,"journal":{"name":"Journal of Cloud Computing-Advances Systems and Applications","volume":"8 1","pages":"197-202"},"PeriodicalIF":4.0,"publicationDate":"2023-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82316510","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Federated learning has received a lot of attention for its ability to solve the data silo problem, but it is also limited by the problem of data heterogeneity and privacy. Non-Independent Identical Distribution (Non-I.I.D) data leads to performance degradation of federation models, and privacy problem have been studied as a hot topic in the field of federated learning. However, current research rarely considers non-I.I.D data and privacy simultaneously. In this paper, we propose a federated learning scheme based on Bregman and differential privacy (FLBDP). Our approach adopts Bregman distance for personalized model training, which aims to control the difference between local model and global model in a limited range, the FLBDP can reduce the model difference to improve the model performance by Bregman optimization. In addition, we use a Gaussian mechanism to perturb the personalized model and update the local model by the perturbed personalized model, which enables the model parameters to satisfy differential privacy in the uplink channel to enhance user privacy protection.
{"title":"Federated Learning Privacy-preserving Method Based on Bregman Optimization","authors":"Gengming Zhu, Jiyong Zhang, Shaobo Zhang, Yijie Yin","doi":"10.1109/CSCloud-EdgeCom58631.2023.00023","DOIUrl":"https://doi.org/10.1109/CSCloud-EdgeCom58631.2023.00023","url":null,"abstract":"Federated learning has received a lot of attention for its ability to solve the data silo problem, but it is also limited by the problem of data heterogeneity and privacy. Non-Independent Identical Distribution (Non-I.I.D) data leads to performance degradation of federation models, and privacy problem have been studied as a hot topic in the field of federated learning. However, current research rarely considers non-I.I.D data and privacy simultaneously. In this paper, we propose a federated learning scheme based on Bregman and differential privacy (FLBDP). Our approach adopts Bregman distance for personalized model training, which aims to control the difference between local model and global model in a limited range, the FLBDP can reduce the model difference to improve the model performance by Bregman optimization. In addition, we use a Gaussian mechanism to perturb the personalized model and update the local model by the perturbed personalized model, which enables the model parameters to satisfy differential privacy in the uplink channel to enhance user privacy protection.","PeriodicalId":56007,"journal":{"name":"Journal of Cloud Computing-Advances Systems and Applications","volume":"43 1","pages":"85-90"},"PeriodicalIF":4.0,"publicationDate":"2023-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85825198","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-07-01DOI: 10.1109/CSCloud-EdgeCom58631.2023.00026
Feng Li, Yaqin Liu, W. Liang, Songyou Xie, Yang Yang, Yuhui Li
The transaction throughput and confirmation time of the current mainstream blockchain cryptocurrency platform are far lower than those of traditional centralized trading platforms, which is difficult to meet the growing needs of users. Therefore, this paper proposes an efficient multi-hop off-chain Virtual Channel (VC) payment scheme to improve the confirmation speed of transactions by performing high-frequency and small transactions off-chain. The proposed scheme constructs a virtual channel scheme with dynamic selection [1], [2] through Hash Time-Lock Contract (HTLC) and constant collateral, and closes the virtual channel through on-chain settlement to ensure the balance security and atomicity of transactions. The proposed VC scheme is suitable for multi-hop Payment Channel (PC) networks, after the VC construction is completed, the transaction initiator and receiver directly conduct transactions through the virtual channel, ensuring the privacy of the transaction. Experimental analysis shows that the proposed scheme can resist a variety of malicious attacks and realize a rapid and safe transaction process.
{"title":"An Efficient Virtual Channel Scheme Based on Multi-hop Payment Channel","authors":"Feng Li, Yaqin Liu, W. Liang, Songyou Xie, Yang Yang, Yuhui Li","doi":"10.1109/CSCloud-EdgeCom58631.2023.00026","DOIUrl":"https://doi.org/10.1109/CSCloud-EdgeCom58631.2023.00026","url":null,"abstract":"The transaction throughput and confirmation time of the current mainstream blockchain cryptocurrency platform are far lower than those of traditional centralized trading platforms, which is difficult to meet the growing needs of users. Therefore, this paper proposes an efficient multi-hop off-chain Virtual Channel (VC) payment scheme to improve the confirmation speed of transactions by performing high-frequency and small transactions off-chain. The proposed scheme constructs a virtual channel scheme with dynamic selection [1], [2] through Hash Time-Lock Contract (HTLC) and constant collateral, and closes the virtual channel through on-chain settlement to ensure the balance security and atomicity of transactions. The proposed VC scheme is suitable for multi-hop Payment Channel (PC) networks, after the VC construction is completed, the transaction initiator and receiver directly conduct transactions through the virtual channel, ensuring the privacy of the transaction. Experimental analysis shows that the proposed scheme can resist a variety of malicious attacks and realize a rapid and safe transaction process.","PeriodicalId":56007,"journal":{"name":"Journal of Cloud Computing-Advances Systems and Applications","volume":"227 1","pages":"102-107"},"PeriodicalIF":4.0,"publicationDate":"2023-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76097313","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Urban computing is an emerging computing paradigm for processing urban data to serve urban applications, which is an important manner to realize smart cities. To be specific, cloud computing and edge computing are usually leveraged to support urban computing. As a distributed and extended solution for cloud computing, edge computing is capable of providing better data services for IoT devices. However, edge computing resources are widely distributed and edge devices are highly mobile. To guarantee the QoS (Quality of Service), it is challenging to decide where to distribute the computing resources according to edge devices, especially around a specific urban area. Therefore, it is essential to simulate and verify the solution through evaluation tools before practical deployment in urban scenarios. But urban computing is a relatively new paradigm, there are few evaluation tools for direct usage. To provide hints for useful tools, we perform a survey study on existing evaluation tools for edge computing, which can be somehow applied to urban computing. In this paper, we first classify and define the evaluation tools into three categories: simulators, emulators, and testbeds. Then we perform a comprehensive study on the above three categories. Finally, we conclude the research challenges for urban computing based on current evaluation tools.
{"title":"Simulation for urban computing scenarios: An overview and research challenges","authors":"Lin Wu, Guogui Yang, Jintao Yan, Shuguang Ran, Bao-kang Zhao, Huan Zhou","doi":"10.1109/CSCloud-EdgeCom58631.2023.00012","DOIUrl":"https://doi.org/10.1109/CSCloud-EdgeCom58631.2023.00012","url":null,"abstract":"Urban computing is an emerging computing paradigm for processing urban data to serve urban applications, which is an important manner to realize smart cities. To be specific, cloud computing and edge computing are usually leveraged to support urban computing. As a distributed and extended solution for cloud computing, edge computing is capable of providing better data services for IoT devices. However, edge computing resources are widely distributed and edge devices are highly mobile. To guarantee the QoS (Quality of Service), it is challenging to decide where to distribute the computing resources according to edge devices, especially around a specific urban area. Therefore, it is essential to simulate and verify the solution through evaluation tools before practical deployment in urban scenarios. But urban computing is a relatively new paradigm, there are few evaluation tools for direct usage. To provide hints for useful tools, we perform a survey study on existing evaluation tools for edge computing, which can be somehow applied to urban computing. In this paper, we first classify and define the evaluation tools into three categories: simulators, emulators, and testbeds. Then we perform a comprehensive study on the above three categories. Finally, we conclude the research challenges for urban computing based on current evaluation tools.","PeriodicalId":56007,"journal":{"name":"Journal of Cloud Computing-Advances Systems and Applications","volume":"8 1","pages":"12-17"},"PeriodicalIF":4.0,"publicationDate":"2023-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89242832","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-07-01DOI: 10.1109/cscloud-edgecom58631.2023.00075
Mo Wang, Yi Zheng, Chongze Lin, Yan Cui, Yuxin Wu, Shuping Wang
In the context of increasingly improved transportation infrastructure and increasing difficulty in vehicle management, vehicle networking technology has emerged in the public eye. Through rapid development in recent years, the Internet of Vehicles has formed a relatively stable system structure. Subsequently, the risk of attacks on the Internet of Vehicles continues to increase, and the weak password authentication and weak encryption of traditional Internet of Vehicles are no longer able to meet the current privacy protection requirements in the field of Internet of Vehicles. In order to solve the problem of information security in the Internet of Vehicles, privacy protection technology for the Internet of Vehicles was studied in the article. Firstly, the existing security risks of the Internet of Vehicles were introduced, followed by a specific analysis of privacy protection technologies such as Identity-Based Cryptograph, key management technology, and multi-dimensional authentication technology. Then, based on the development trend of existing technologies, the future development direction was predicted, and finally, the current privacy protection technologies for the Internet of Vehicles were summarized.
{"title":"Privacy Protection Technology for Internet of Vehicles","authors":"Mo Wang, Yi Zheng, Chongze Lin, Yan Cui, Yuxin Wu, Shuping Wang","doi":"10.1109/cscloud-edgecom58631.2023.00075","DOIUrl":"https://doi.org/10.1109/cscloud-edgecom58631.2023.00075","url":null,"abstract":"In the context of increasingly improved transportation infrastructure and increasing difficulty in vehicle management, vehicle networking technology has emerged in the public eye. Through rapid development in recent years, the Internet of Vehicles has formed a relatively stable system structure. Subsequently, the risk of attacks on the Internet of Vehicles continues to increase, and the weak password authentication and weak encryption of traditional Internet of Vehicles are no longer able to meet the current privacy protection requirements in the field of Internet of Vehicles. In order to solve the problem of information security in the Internet of Vehicles, privacy protection technology for the Internet of Vehicles was studied in the article. Firstly, the existing security risks of the Internet of Vehicles were introduced, followed by a specific analysis of privacy protection technologies such as Identity-Based Cryptograph, key management technology, and multi-dimensional authentication technology. Then, based on the development trend of existing technologies, the future development direction was predicted, and finally, the current privacy protection technologies for the Internet of Vehicles were summarized.","PeriodicalId":56007,"journal":{"name":"Journal of Cloud Computing-Advances Systems and Applications","volume":"14 1","pages":"405-410"},"PeriodicalIF":4.0,"publicationDate":"2023-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73935373","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-07-01DOI: 10.1109/cscloud-edgecom58631.2023.00070
Jing Liao, Xiande Su, Cheng Peng
Entity relationship extraction aims to extract important triplet information from massive unstructured data, which is the basis of downstream tasks such as building a knowledge map. The graph perspective is used to analyze the entity and relationship extraction and build adjacency list oriented model to solve the problem of large space consumption of the adjacency matrix, but it uses complex operations to extract entities and relationships sequentially. Therefore, we propose a simple completely adjacency list oriented relationship extraction model. This model firstly introduce a realtion label-aware module to supplement sentence information and a feature separation module to alleviate the error accumulation problem caused by sequential extraction, and then sequentially extracts subjects, objects, and relations. Extensive experiments on two common datasets have shown that our model maintains high accuracy of 92.8while also significantly improving inference speed down from 35.7ms to 22.9ms.
{"title":"A Simple Completely Adjacency List Oriented Relational Extraction Model","authors":"Jing Liao, Xiande Su, Cheng Peng","doi":"10.1109/cscloud-edgecom58631.2023.00070","DOIUrl":"https://doi.org/10.1109/cscloud-edgecom58631.2023.00070","url":null,"abstract":"Entity relationship extraction aims to extract important triplet information from massive unstructured data, which is the basis of downstream tasks such as building a knowledge map. The graph perspective is used to analyze the entity and relationship extraction and build adjacency list oriented model to solve the problem of large space consumption of the adjacency matrix, but it uses complex operations to extract entities and relationships sequentially. Therefore, we propose a simple completely adjacency list oriented relationship extraction model. This model firstly introduce a realtion label-aware module to supplement sentence information and a feature separation module to alleviate the error accumulation problem caused by sequential extraction, and then sequentially extracts subjects, objects, and relations. Extensive experiments on two common datasets have shown that our model maintains high accuracy of 92.8while also significantly improving inference speed down from 35.7ms to 22.9ms.","PeriodicalId":56007,"journal":{"name":"Journal of Cloud Computing-Advances Systems and Applications","volume":"43 1","pages":"375-380"},"PeriodicalIF":4.0,"publicationDate":"2023-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80221391","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：