Pub Date : 2023-06-08DOI: 10.1109/TSUSC.2023.3283518
Mir Ashraf Uddin;Man Lin;Laurence T. Yang
This work aims at addressing carbon neutrality challenges through resource management with system software control. Reducing energy costs is vital for modern systems, especially those battery-powered devices that need to perform complex tasks. The technique of dynamic voltage or frequency scaling (DVFS) has been commonly adopted for reducing power consumption in cyber-physical systems to support the increasing computation demand under limited battery life. Dynamic slack becomes available when a task finishes earlier than its worst execution time. Dynamic slack management is an important factor for the DVFS mechanism. This paper proposes a dynamic slack-sharing (DSS) DVFS scheduling method that reduces CPU energy consumption by learning the slack-sharing rate. The DSS method automatically changes the slack sharing rate of a task on the fly in different situations through learning from experience to determine how much slack to use for the next task and how much to share. The method used for learning is Q-learning. Extensive experiments have been performed, and the results show that the DSS technique achieves more energy savings than the existing ones.
这项工作旨在通过系统软件控制进行资源管理,应对碳中和挑战。降低能源成本对现代系统至关重要,尤其是那些需要执行复杂任务的电池供电设备。动态电压或频率缩放(DVFS)技术已被普遍用于降低网络物理系统的功耗,以支持在电池寿命有限的情况下不断增长的计算需求。当任务比其最坏执行时间提前完成时,就会出现动态松弛。动态松弛管理是 DVFS 机制的一个重要因素。本文提出了一种动态空闲共享(DSS)DVFS 调度方法,通过学习空闲共享率来降低 CPU 能耗。DSS 方法通过学习经验,在不同情况下自动改变任务的松弛共享率,以确定下一个任务使用多少松弛以及共享多少松弛。学习的方法是 Q-learning。我们进行了广泛的实验,结果表明 DSS 技术比现有技术节省了更多能源。
{"title":"Dynamic Slack-Sharing Learning Technique With DVFS for Real-Time Systems","authors":"Mir Ashraf Uddin;Man Lin;Laurence T. Yang","doi":"10.1109/TSUSC.2023.3283518","DOIUrl":"10.1109/TSUSC.2023.3283518","url":null,"abstract":"This work aims at addressing carbon neutrality challenges through resource management with system software control. Reducing energy costs is vital for modern systems, especially those battery-powered devices that need to perform complex tasks. The technique of dynamic voltage or frequency scaling (DVFS) has been commonly adopted for reducing power consumption in cyber-physical systems to support the increasing computation demand under limited battery life. Dynamic slack becomes available when a task finishes earlier than its worst execution time. Dynamic slack management is an important factor for the DVFS mechanism. This paper proposes a dynamic slack-sharing (DSS) DVFS scheduling method that reduces CPU energy consumption by learning the slack-sharing rate. The DSS method automatically changes the slack sharing rate of a task on the fly in different situations through learning from experience to determine how much slack to use for the next task and how much to share. The method used for learning is Q-learning. Extensive experiments have been performed, and the results show that the DSS technique achieves more energy savings than the existing ones.","PeriodicalId":13268,"journal":{"name":"IEEE Transactions on Sustainable Computing","volume":"9 3","pages":"261-270"},"PeriodicalIF":3.9,"publicationDate":"2023-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83161277","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}
Network slicing is considered one of the key technologies in future telecommunication networks as it can split the physical network into a number of logical networks tailored to diverse purposes that allow users to access various services speedily. The fifth-generation (5G) mobile network can support a variety of applications by using network slicing. However, security (especially authentication) is a significant issue when users access the network slice-based services. Various authentication schemes are designed to secure access, and only a few offer cross-network slice authentication. The security analysis of existing cross-network authentication schemes shows they are vulnerable to several attacks such as device stolen, ephemeral secret leakage, violation of perfect forward secrecy, identity theft. Therefore, we propose an authentication mechanism that offers cross-network slice authentication and prevents all the aforementioned vulnerabilities. The security verification of the authentication mechanism is carried out informally and formally (ROR logic and Scyther tool) to ensure that it handles all the vulnerabilities. The comparison of empirical evaluation shows that the proposed scheme is least costly than its competitors. Java-based implementations of the proposed protocols imitate a real environment, showing that our proposed protocol maintains almost the same performance as state-of-the-art solutions while providing additional security features.
{"title":"An Enhanced Cross-Network-Slice Authentication Protocol for 5G","authors":"Awaneesh Kumar Yadav;Shalitha Wijethilaka;An Braeken;Manoj Misra;Madhusanka Liyanage","doi":"10.1109/TSUSC.2023.3283615","DOIUrl":"10.1109/TSUSC.2023.3283615","url":null,"abstract":"Network slicing is considered one of the key technologies in future telecommunication networks as it can split the physical network into a number of logical networks tailored to diverse purposes that allow users to access various services speedily. The fifth-generation (5G) mobile network can support a variety of applications by using network slicing. However, security (especially authentication) is a significant issue when users access the network slice-based services. Various authentication schemes are designed to secure access, and only a few offer cross-network slice authentication. The security analysis of existing cross-network authentication schemes shows they are vulnerable to several attacks such as device stolen, ephemeral secret leakage, violation of perfect forward secrecy, identity theft. Therefore, we propose an authentication mechanism that offers cross-network slice authentication and prevents all the aforementioned vulnerabilities. The security verification of the authentication mechanism is carried out informally and formally (ROR logic and Scyther tool) to ensure that it handles all the vulnerabilities. The comparison of empirical evaluation shows that the proposed scheme is least costly than its competitors. Java-based implementations of the proposed protocols imitate a real environment, showing that our proposed protocol maintains almost the same performance as state-of-the-art solutions while providing additional security features.","PeriodicalId":13268,"journal":{"name":"IEEE Transactions on Sustainable Computing","volume":"8 4","pages":"555-573"},"PeriodicalIF":3.9,"publicationDate":"2023-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80912702","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}
Blockchain is an important supporting technology for various sustainable systems. It relies on a number of distributed nodes running blockchain client software, which is responsible for some critical tasks, such as communicating with other nodes and generating new blocks. However, the quick evolution of blockchain technology brings crucial challenges to blockchain client design. After carefully examining existing blockchain client software, we have identified a critical weakness: Blockchain clients are weak in supporting live upgrades, resulting in a blockchain fork that incurs security concerns and risks. In this article, we propose Phoenix, a novel blockchain client design that is live upgradable. Phoenix uses blockchain service encapsulation to decouple blockchain services. Based on service encapsulation, we propose a live upgrade scheme that packs upgrade codes into blockchain transactions and uses a Just-In-Time engine to avoid service interruption. A parallel execution engine is developed to increase service efficiency. We evaluated Phoenix on a 51-node blockchain, and experimental results show that Phoenix outperforms existing solutions in overhead and upgrade latency.
{"title":"Phoenix: A Live Upgradable Blockchain Client","authors":"Chenmin Wang;Peng Li;Xuepeng Fan;Zaiyang Tang;Yulong Zeng;Kouichi Sakurai","doi":"10.1109/TSUSC.2023.3282586","DOIUrl":"10.1109/TSUSC.2023.3282586","url":null,"abstract":"Blockchain is an important supporting technology for various sustainable systems. It relies on a number of distributed nodes running blockchain client software, which is responsible for some critical tasks, such as communicating with other nodes and generating new blocks. However, the quick evolution of blockchain technology brings crucial challenges to blockchain client design. After carefully examining existing blockchain client software, we have identified a critical weakness: Blockchain clients are weak in supporting live upgrades, resulting in a blockchain fork that incurs security concerns and risks. In this article, we propose Phoenix, a novel blockchain client design that is live upgradable. Phoenix uses blockchain service encapsulation to decouple blockchain services. Based on service encapsulation, we propose a live upgrade scheme that packs upgrade codes into blockchain transactions and uses a Just-In-Time engine to avoid service interruption. A parallel execution engine is developed to increase service efficiency. We evaluated Phoenix on a 51-node blockchain, and experimental results show that Phoenix outperforms existing solutions in overhead and upgrade latency.","PeriodicalId":13268,"journal":{"name":"IEEE Transactions on Sustainable Computing","volume":"8 4","pages":"703-714"},"PeriodicalIF":3.9,"publicationDate":"2023-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74606354","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-06-05DOI: 10.1109/TSUSC.2023.3279382
Gao Jintao;Li Zhanhuai;Sun Jian
The improvement of robustness and efficiency for multi-way equijoin query is challenging, no-matter for centralized database systems or distributed database systems. Due to lots of unnecessary data existing during query processing, these two metrics will be seriously reduced. If we can thoroughly prune unnecessary data in advance, the robustness and efficiency will be highly improved. However, the pruning power of current strategies, such as predicate push-down and algebraic equivalence, is limited. We present deepDP, a powerful, generalized, and efficient strategy for data pruning. deepDP builds multiple independent pruning spaces by generating longest transitive closures and applies appropriate data pruning strategy for each pruning space. For thoroughly pruning unnecessary data, deepDP employs $alpha cdot beta$