基于多目标优化NSGA-II算法的点对点网络最优数据复制新策略

IF 1.3 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS
IET Networks Pub Date : 2024-12-12 DOI:10.1049/ntw2.12141
Abouzar Samimi, Maryam Goudarzi
{"title":"基于多目标优化NSGA-II算法的点对点网络最优数据复制新策略","authors":"Abouzar Samimi,&nbsp;Maryam Goudarzi","doi":"10.1049/ntw2.12141","DOIUrl":null,"url":null,"abstract":"<p>A peer-to-peer (P2P) network is defined as a distributed network in which nodes with similar characteristics exchange data with others. Efficient data sharing in P2P systems is essentially faced with challenges due to uncertainties of erratic node failures and unreliable network connectivity. Data replication on multiple nodes can improve availability and alleviate latency. However, the number of created replicas and the corresponding location of these replicas need to be determined optimally. In this paper, a novel framework for data replication is proposed in P2P networks, in which optimal allocations are achieved based on the two objectives including the minimisation of delay and maximisation of hit rate of queries. The proposed model finds allocations that specify the number and location of each replica of existing files in the network based on two considered objectives. A multi-objective technique based on the Non-Dominated Sorting Genetic Algorithm II (NSGA-II) algorithm is utilised to solve the proposed model and to extract non-dominated Pareto-optimal solutions of the allocations. Finally, one of the allocations of the obtained Pareto optimal set is applied to the network and the delay and hit rate of queries pertaining to this situation is compared with two models: i) initial model of the network, that is, the state where there is no replica of the files except the original version of the file, and ii) the random replication model to verify the efficiency of the presented method. All simulations in this paper have been done using C++ programming language.</p>","PeriodicalId":46240,"journal":{"name":"IET Networks","volume":"14 1","pages":""},"PeriodicalIF":1.3000,"publicationDate":"2024-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/ntw2.12141","citationCount":"0","resultStr":"{\"title\":\"A novel strategy for optimal data replication in peer-to-peer networks based on a multi-objective optimisation – NSGA-II algorithm\",\"authors\":\"Abouzar Samimi,&nbsp;Maryam Goudarzi\",\"doi\":\"10.1049/ntw2.12141\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>A peer-to-peer (P2P) network is defined as a distributed network in which nodes with similar characteristics exchange data with others. Efficient data sharing in P2P systems is essentially faced with challenges due to uncertainties of erratic node failures and unreliable network connectivity. Data replication on multiple nodes can improve availability and alleviate latency. However, the number of created replicas and the corresponding location of these replicas need to be determined optimally. In this paper, a novel framework for data replication is proposed in P2P networks, in which optimal allocations are achieved based on the two objectives including the minimisation of delay and maximisation of hit rate of queries. The proposed model finds allocations that specify the number and location of each replica of existing files in the network based on two considered objectives. A multi-objective technique based on the Non-Dominated Sorting Genetic Algorithm II (NSGA-II) algorithm is utilised to solve the proposed model and to extract non-dominated Pareto-optimal solutions of the allocations. Finally, one of the allocations of the obtained Pareto optimal set is applied to the network and the delay and hit rate of queries pertaining to this situation is compared with two models: i) initial model of the network, that is, the state where there is no replica of the files except the original version of the file, and ii) the random replication model to verify the efficiency of the presented method. All simulations in this paper have been done using C++ programming language.</p>\",\"PeriodicalId\":46240,\"journal\":{\"name\":\"IET Networks\",\"volume\":\"14 1\",\"pages\":\"\"},\"PeriodicalIF\":1.3000,\"publicationDate\":\"2024-12-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://onlinelibrary.wiley.com/doi/epdf/10.1049/ntw2.12141\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IET Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://onlinelibrary.wiley.com/doi/10.1049/ntw2.12141\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IET Networks","FirstCategoryId":"1085","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1049/ntw2.12141","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

点对点(P2P)网络被定义为一种分布式网络,在这种网络中,具有相似特征的节点与其他节点交换数据。由于节点故障不稳定和网络连接不可靠等不确定性,P2P系统中数据的高效共享面临着挑战。在多个节点上进行数据复制可以提高可用性并减轻延迟。但是,需要以最佳方式确定已创建副本的数量以及这些副本的相应位置。本文提出了一种新的P2P网络数据复制框架,该框架基于最小化延迟和最大化查询命中率两个目标来实现最优分配。提出的模型根据两个考虑的目标找到分配,指定网络中现有文件的每个副本的数量和位置。利用基于非支配排序遗传算法II (NSGA-II)的多目标技术对该模型进行求解,并提取分配的非支配pareto最优解。最后,将得到的Pareto最优集的其中一个分配应用到网络中,并将这种情况下查询的延迟和命中率与两个模型进行比较:i)网络的初始模型,即除了文件的原始版本之外没有文件副本的状态;ii)随机复制模型,以验证所提方法的效率。本文所有的仿真都是用c++编程语言完成的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

A novel strategy for optimal data replication in peer-to-peer networks based on a multi-objective optimisation – NSGA-II algorithm

A novel strategy for optimal data replication in peer-to-peer networks based on a multi-objective optimisation – NSGA-II algorithm

A peer-to-peer (P2P) network is defined as a distributed network in which nodes with similar characteristics exchange data with others. Efficient data sharing in P2P systems is essentially faced with challenges due to uncertainties of erratic node failures and unreliable network connectivity. Data replication on multiple nodes can improve availability and alleviate latency. However, the number of created replicas and the corresponding location of these replicas need to be determined optimally. In this paper, a novel framework for data replication is proposed in P2P networks, in which optimal allocations are achieved based on the two objectives including the minimisation of delay and maximisation of hit rate of queries. The proposed model finds allocations that specify the number and location of each replica of existing files in the network based on two considered objectives. A multi-objective technique based on the Non-Dominated Sorting Genetic Algorithm II (NSGA-II) algorithm is utilised to solve the proposed model and to extract non-dominated Pareto-optimal solutions of the allocations. Finally, one of the allocations of the obtained Pareto optimal set is applied to the network and the delay and hit rate of queries pertaining to this situation is compared with two models: i) initial model of the network, that is, the state where there is no replica of the files except the original version of the file, and ii) the random replication model to verify the efficiency of the presented method. All simulations in this paper have been done using C++ programming language.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IET Networks
IET Networks COMPUTER SCIENCE, INFORMATION SYSTEMS-
CiteScore
5.00
自引率
0.00%
发文量
41
审稿时长
33 weeks
期刊介绍: IET Networks covers the fundamental developments and advancing methodologies to achieve higher performance, optimized and dependable future networks. IET Networks is particularly interested in new ideas and superior solutions to the known and arising technological development bottlenecks at all levels of networking such as topologies, protocols, routing, relaying and resource-allocation for more efficient and more reliable provision of network services. Topics include, but are not limited to: Network Architecture, Design and Planning, Network Protocol, Software, Analysis, Simulation and Experiment, Network Technologies, Applications and Services, Network Security, Operation and Management.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信