Optimization of routing strategies for data transfer in peer-to-peer networks

2nd International Conference on Mathematical Modeling in Physical Sciences 2013

物理学;数学

Morioka, Atsushi^1 ; Igarashi, Akito^1

Department of Applied Mathematics and Physics, Kyoto University, Kyoto, Japan^1

关键词: Computer communication networks;    High probability;    Information traffic;    Peer-to-peer file sharing systems;    Routing strategies;    Shortest path strategies;    Topology changes;    Traffic problems;   

Others  :  https://iopscience.iop.org/article/10.1088/1742-6596/490/1/012190/pdf
DOI  :  10.1088/1742-6596/490/1/012190

来源: IOP

【 摘 要 】

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 Pj, which expresses the amount of files stored in peer j. It is assumed that if Pjis 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.