Autonomous platooning technology is regarded as one of the promising technologies for the future and the research is conducted actively.The autonomous platooning task generally requires highly complex computations so ...Autonomous platooning technology is regarded as one of the promising technologies for the future and the research is conducted actively.The autonomous platooning task generally requires highly complex computations so it is difficult to process only with the vehicle’s processing units.To solve this problem,there are many studies on task offloading technique which transfers complex tasks to their neighboring vehicles or computation nodes.However,the existing task offloading techniques which mainly use learning-based algorithms are difficult to respond to the real-time changing road environment due to their complexity.They are also challenging to process computation tasks within 100 ms which is the time limit for driving safety.In this paper,we propose a novel offloading scheme that can support autonomous platooning tasks being processed within the limit and ensure driving safety.The proposed scheme can handle computation tasks by considering the communication bandwidth,delay,and amount of computation.We also conduct simulations in the highway environment to evaluate the existing scheme and the proposed scheme.The result shows that our proposed scheme improves the utilization of nearby computing nodes,and the offloading tasks can be processed within the time for driving safety.展开更多
Recently,research on a distributed storage system that efficiently manages a large amount of data has been actively conducted following data production and demand increase.Physical expansion limits exist for tradition...Recently,research on a distributed storage system that efficiently manages a large amount of data has been actively conducted following data production and demand increase.Physical expansion limits exist for traditional standalone storage systems,such as I/O and file system capacity.However,the existing distributed storage system does not consider where data is consumed and is more focused on data dissemination and optimizing the lookup cost of data location.And this leads to system performance degradation due to low locality occurring in a Wide Area Network(WAN)environment with high network latency.This problem hinders deploying distributed storage systems to multiple data centers over WAN.It lowers the scalability of distributed storage systems to accommodate data storage needs.This paper proposes a method for distributing data in a WAN environment considering network latency and data locality to solve this problem and increase overall system performance.The proposed distributed storage method monitors data utilization and locality to classify data temperature as hot,warm,and cold.With assigned data temperature,the proposed algorithm adaptively selects the appropriate data center and places data accordingly to overcome the excess latency from the WAN environment,leading to overall system performance degradation.This paper also conducts simulations to evaluate the proposed and existing distributed storage methods.The result shows that our proposed method reduced latency by 38%compared to the existing method.Therefore,the proposed method in this paper can be used in large-scale distributed storage systems over a WAN environment to improve latency and performance compared to existing methods,such as consistent hashing.展开更多
基金This work was supported in part by the Chung-Ang University Research Scholarship Grants in 2021,and in part by R&D Program for Forest Science Technology(Project No.“2021338B10-2223-CD02)provided by Korea Forest Service(Korea Forestry Promotion Institute).
文摘Autonomous platooning technology is regarded as one of the promising technologies for the future and the research is conducted actively.The autonomous platooning task generally requires highly complex computations so it is difficult to process only with the vehicle’s processing units.To solve this problem,there are many studies on task offloading technique which transfers complex tasks to their neighboring vehicles or computation nodes.However,the existing task offloading techniques which mainly use learning-based algorithms are difficult to respond to the real-time changing road environment due to their complexity.They are also challenging to process computation tasks within 100 ms which is the time limit for driving safety.In this paper,we propose a novel offloading scheme that can support autonomous platooning tasks being processed within the limit and ensure driving safety.The proposed scheme can handle computation tasks by considering the communication bandwidth,delay,and amount of computation.We also conduct simulations in the highway environment to evaluate the existing scheme and the proposed scheme.The result shows that our proposed scheme improves the utilization of nearby computing nodes,and the offloading tasks can be processed within the time for driving safety.
基金This research was supported by the Chung-Ang University Graduate Research Scholarship in 2021.This study was carried out with the support of‘R&D Program for Forest Science Technology(Project No.2021338C10-2223-CD02)’provided by Korea Forest Service(Korea Forestry Promotion Institute).
文摘Recently,research on a distributed storage system that efficiently manages a large amount of data has been actively conducted following data production and demand increase.Physical expansion limits exist for traditional standalone storage systems,such as I/O and file system capacity.However,the existing distributed storage system does not consider where data is consumed and is more focused on data dissemination and optimizing the lookup cost of data location.And this leads to system performance degradation due to low locality occurring in a Wide Area Network(WAN)environment with high network latency.This problem hinders deploying distributed storage systems to multiple data centers over WAN.It lowers the scalability of distributed storage systems to accommodate data storage needs.This paper proposes a method for distributing data in a WAN environment considering network latency and data locality to solve this problem and increase overall system performance.The proposed distributed storage method monitors data utilization and locality to classify data temperature as hot,warm,and cold.With assigned data temperature,the proposed algorithm adaptively selects the appropriate data center and places data accordingly to overcome the excess latency from the WAN environment,leading to overall system performance degradation.This paper also conducts simulations to evaluate the proposed and existing distributed storage methods.The result shows that our proposed method reduced latency by 38%compared to the existing method.Therefore,the proposed method in this paper can be used in large-scale distributed storage systems over a WAN environment to improve latency and performance compared to existing methods,such as consistent hashing.
