Optimization of routing strategies for data transfer in peer-to-peer networks
Optimization of routing strategies for data transfer in peer-to-peer networks
复制标题
对等网络中数据传输的路由策略优化
DOI：
10.1088/1742-6596/490/1/012190
复制
发表时间：
2014
期刊：
影响因子：
--
通讯作者：
A. Morioka and A. Igarashi
中科院分区：
文献类型：
--
作者：
Akito Igarashi & Tomohiro Kuse;A. Morioka and A. Igarashi
由于点对点文件共享系统最近变得熟悉，网络中的信息流量正在增加。因此，在点对点网络中产生了各种各样的流量问题。本文对点对点网络的一些特征进行了建模，并对其流量问题进行了研究。点对点网络有两个显著特征。一是每个对等点经常搜索文件，并从拥有请求文件的对等点处下载该文件。在搜索和下载过程的建模中，为了确定一个对等点是否拥有请求的文件，我们引入文件参数pj，该参数表示存储在对等点j中的文件数量。假设如果P j较大，则对等点j拥有许多文件，并且大概率能够满足其他对等点的请求。另一个特点是同伴反复离开和加入网络。许多研究者研究了计算机通信网络中数据传输的流量问题。然而，据我们所知，没有报告关注拓扑结构随时间变化的点对点网络。对于数据传输的路由路径，通常在计算机网络中使用最短路径。本文提出了一种利用对等体权值来避免网络拥塞的最优路由策略。我们发现，在数据传输的拥塞频率方面，新的路由策略优于最短路径策略。
Since peer-to-peer file-sharing systems have become familiar recently, the information traffic in the networks is increasing. Therefore it causes various traffic problems in peer-to-peer networks. In this paper, we model some features of the peer-to-peer networks, and investigate the traffic problems. Peer-to-peer networks have two notable characters. One is that each peer frequently searches for a file and download it from a peer who has the requested file. To decide whether a peer has the requested file or not in modelling of the search and download process, we introduce file-parameter P j, which expresses the amount of files stored in peer j. It is assumed that if P j is large, peer j has many files and can meet other peers' requests with high probability. The other character is that peers leave and join into the network repeatedly. Many researchers address traffic problems of data transfer in computer communication networks. To our knowledge, however, no reports focus on those in peer-to-peer networks whose topology changes with time. For routing paths of data transfer, generally, the shortest paths are used in usual computer networks. In this paper, we introduce a new optimal routing strategy which uses weights of peers to avoid traffic congestion. We find that the new routing strategy is superior to the shortest path strategy in terms of congestion frequency in data transfer.