A new routing algorithm of peer-to-peer file sharing system with routing indices was proposed, in which a node forwards a query to neighbors that are more likely to have answers based on its statistics. The proposed a...A new routing algorithm of peer-to-peer file sharing system with routing indices was proposed, in which a node forwards a query to neighbors that are more likely to have answers based on its statistics. The proposed algorithm was tested by creating a P2P simulator and varying the input parameters, and was compared to the search algorithms using flooding （FLD） and random walk （RW）. The result shows that with the proposed design, the queries are muted effectively, the network flows are reduced remarkably, and the peer-to-peer file sharing system gains a good expansibility.展开更多
Metadata prefetching and data placement play a critical role in enhancing access performance for file systems operating over wide-area networks.However,developing effective strategies for metadata prefetching in envir...Metadata prefetching and data placement play a critical role in enhancing access performance for file systems operating over wide-area networks.However,developing effective strategies for metadata prefetching in environments with concurrent workloads and for data placement across distributed networks remains a significant challenge.This study introduces novel and efficient methodologies for metadata prefetching and data placement,leveraging fine-grained control of prefetching strategies and variable-sized data fragment writing to optimize the I/O bandwidth of distributed file systems.The proposed metadata prefetching technique employs dynamic workload analysis to identify dominant workload patterns and adaptively refines prefetching policies,thereby boosting metadata access efficiency under concurrent scenarios.Meanwhile,the data placement strategy improves write performance by storing data fragments locally within the nearest data center and transmitting only the fragment location metadata to the remote data center hosting the original file.Experimental evaluations using real-world system traces demonstrate that the proposed approaches reduce metadata access times by up to 33.5%and application data access times by 17.19%compared to state-of-the-art techniques.展开更多
针对目前网络数据量急剧增加所带来的传输性能压力、文件系统开发因内核紧密耦合而导致的困难,以及传统网络文件系统难以适配新型存储介质的问题,提出一种基于扩展用户态文件系统(Extended Filesystem in Userspace,ExtFUSE)的网络文件...针对目前网络数据量急剧增加所带来的传输性能压力、文件系统开发因内核紧密耦合而导致的困难,以及传统网络文件系统难以适配新型存储介质的问题,提出一种基于扩展用户态文件系统(Extended Filesystem in Userspace,ExtFUSE)的网络文件系统(Network File System,NFS)。该系统通过扩展伯克利数据包过滤器实现整体的网络元数据提取、缓存以及预处理功能,以减少数据进出内核空间时因用户-内核模式切换、上下文切换及内存拷贝所致的时间开销,并提升数据访问时的缓存命中率。将该系统部署于MinIO服务器,并将其与用户空间文件系统(Filesystem in Userspace,FUSE)、基于FUSE的Gluster存储架构(Gluster Storage Architecture with Filesystem in Userspace,Gluster-FUSE)之间的性能数据进行对比分析,以此评估所提系统的性能。实验结果表明,所提系统在元数据操作时间上较FUSE平均降低17.3%,较Gluster-FUSE降低12.1%;扩展数据获取操作耗时显著降低,缓存命中率达到92.19%,较FUSE提升4.5%,较Gluster-FUSE提升1.4%,验证了系统在提升网络数据传输效率和稳定性方面的有效性。展开更多
The development of intelligent algorithms for controlling autonomous mobile robots in real-time activities has increased dramatically in recent years.However,conventional intelligent algorithms currently fail to accur...The development of intelligent algorithms for controlling autonomous mobile robots in real-time activities has increased dramatically in recent years.However,conventional intelligent algorithms currently fail to accurately predict unexpected obstacles involved in tour paths and thereby suffer from inefficient tour trajectories.The present study addresses these issues by proposing a potential field integrated pruned adaptive resonance theory(PPART)neural network for effectively managing the touring process of autonomous mobile robots in real-time.The proposed system is implemented using the AlphaBot platform,and the performance of the system is evaluated according to the obstacle prediction accuracy,path detection accuracy,time-lapse,tour length,and the overall accuracy of the system.The proposed system provide a very high obstacle prediction accuracy of 99.61%.Accordingly,the proposed tour planning design effectively predicts unexpected obstacles in the environment and thereby increases the overall efficiency of tour navigation.展开更多
文摘A new routing algorithm of peer-to-peer file sharing system with routing indices was proposed, in which a node forwards a query to neighbors that are more likely to have answers based on its statistics. The proposed algorithm was tested by creating a P2P simulator and varying the input parameters, and was compared to the search algorithms using flooding （FLD） and random walk （RW）. The result shows that with the proposed design, the queries are muted effectively, the network flows are reduced remarkably, and the peer-to-peer file sharing system gains a good expansibility.
基金funded by the National Natural Science Foundation of China under Grant No.62362019the Hainan Provincial Natural Science Foundation of China under Grant No.624RC482.
文摘Metadata prefetching and data placement play a critical role in enhancing access performance for file systems operating over wide-area networks.However,developing effective strategies for metadata prefetching in environments with concurrent workloads and for data placement across distributed networks remains a significant challenge.This study introduces novel and efficient methodologies for metadata prefetching and data placement,leveraging fine-grained control of prefetching strategies and variable-sized data fragment writing to optimize the I/O bandwidth of distributed file systems.The proposed metadata prefetching technique employs dynamic workload analysis to identify dominant workload patterns and adaptively refines prefetching policies,thereby boosting metadata access efficiency under concurrent scenarios.Meanwhile,the data placement strategy improves write performance by storing data fragments locally within the nearest data center and transmitting only the fragment location metadata to the remote data center hosting the original file.Experimental evaluations using real-world system traces demonstrate that the proposed approaches reduce metadata access times by up to 33.5%and application data access times by 17.19%compared to state-of-the-art techniques.
文摘针对目前网络数据量急剧增加所带来的传输性能压力、文件系统开发因内核紧密耦合而导致的困难,以及传统网络文件系统难以适配新型存储介质的问题,提出一种基于扩展用户态文件系统(Extended Filesystem in Userspace,ExtFUSE)的网络文件系统(Network File System,NFS)。该系统通过扩展伯克利数据包过滤器实现整体的网络元数据提取、缓存以及预处理功能,以减少数据进出内核空间时因用户-内核模式切换、上下文切换及内存拷贝所致的时间开销,并提升数据访问时的缓存命中率。将该系统部署于MinIO服务器,并将其与用户空间文件系统(Filesystem in Userspace,FUSE)、基于FUSE的Gluster存储架构(Gluster Storage Architecture with Filesystem in Userspace,Gluster-FUSE)之间的性能数据进行对比分析,以此评估所提系统的性能。实验结果表明,所提系统在元数据操作时间上较FUSE平均降低17.3%,较Gluster-FUSE降低12.1%;扩展数据获取操作耗时显著降低,缓存命中率达到92.19%,较FUSE提升4.5%,较Gluster-FUSE提升1.4%,验证了系统在提升网络数据传输效率和稳定性方面的有效性。
文摘The development of intelligent algorithms for controlling autonomous mobile robots in real-time activities has increased dramatically in recent years.However,conventional intelligent algorithms currently fail to accurately predict unexpected obstacles involved in tour paths and thereby suffer from inefficient tour trajectories.The present study addresses these issues by proposing a potential field integrated pruned adaptive resonance theory(PPART)neural network for effectively managing the touring process of autonomous mobile robots in real-time.The proposed system is implemented using the AlphaBot platform,and the performance of the system is evaluated according to the obstacle prediction accuracy,path detection accuracy,time-lapse,tour length,and the overall accuracy of the system.The proposed system provide a very high obstacle prediction accuracy of 99.61%.Accordingly,the proposed tour planning design effectively predicts unexpected obstacles in the environment and thereby increases the overall efficiency of tour navigation.
