THE INSTITUTE OF ELECTRONICS, INFORMATION AND COMMUNICATION ENGINEERS TECHNICAL REPORT OF IEICE. P2P 565 871 1 5 E-mail: {j-konisi,wakamiya,murata}@ist.osaka-u.ac.jp QoS P2P P2P P2P P2P (Peer-to-Peer) Abstract Proposal and Evaluation of a Cooperative Mechanism for Pure P2P File Sharing Networks Junjiro KONISHI, Naoki WAKAMIYA, and Masayuki MURATA Graduate School of Information Science and Technology, Osaka University 1 5 Yamadaoka, Suita-shi, Osaka 565 871, Japan E-mail: {j-konisi,wakamiya,murata}@ist.osaka-u.ac.jp To provide application-oriented network services, variety of overlay networks are deployed over physical IP networks. Since they share and compete for physical network resource, their selfish behaviors affect each other and their performance deteriorates. Our research group considers the model of overlay network symbiosis, where overlay networks coexist and cooperate to improve their application-level QoS while sustaining influences over physical networks and other overlay networks. In this paper, we propose mechanisms for pure P2P networks of file-sharing application to cooperate with each other. In our proposal, cooperative peers establish logical links among two or more P2P networks, through which messages and files are exchanged among cooperative P2P networks. Through simulation experiments, it was shown that our proposed mechanisms could improve the search efficiency and reduce load on P2P networks. Key words Overlay Network, P2P (Peer-to-Peer), File Sharing, Cooperative Network 1. QoS [1], [2] 1
QoS [3], [4] [5], [6] [3] i3 (Internet Indirection Infrastructure) i3 i3 packet trigger i3 i3 trigger packet trigger QoS [7] P2P P2P (Peer-to-Peer) Gnutella Winny P2P ( 1.) P2P [8] P2P Peer E 2. R el ay Peer F 2.Relay 2. R el ay Logical Link Data Link 1 Peer C Peer D 2. Re l a y 2. Re l a y 6.Transmit 3. Re s p o n s e 5.R equest Peer B 1. Q ue ry 4.R esp o n se Peer A P2P New File Get!! P2P P2P TTL P2P P2P P2P P2P P2P TTL P2P P2P P2P 2 P2P 3 4 2. P2P P2P P2P 2
Logical Link Query Cooperative Peer Response Candidate Network Candidate Network Q uery P2P Network In d ir ect T r an sm it R e que s t Di r e c t Tr a ns mi t R e s p o n s e P2P Network 2 P2P ( 2.)P2P 2. 1 P2P P2P P2P ( ) P2P ( 2.) P2P i3 P2P i3 i3 trigger i3 packet packet 256 l m P2P P2P P2P P2P P2P P2P IP m P2P P2P l + m n i3 inexact matching trigger packet P2P packet i3 2. 2 P2P P2P P2P P2P [9] P2P P2P 3
P2P TTL TTL TTL 2. 3 P2P i3 P2P i3 trigger l m P2P i3 inexact matching packet P2P 2. 4 P2P P2P P2P P2P P2P P2P P2P P2P P2P P2P P2P 2. 5 P2P ( 2.) P2P TTL 1 P2P P2P P2P P2P P2P 2. 6 3. 2 P2P 4
1.9.8.7 Uncooperative 1.9.8.7 Reachability.6.5.4 Reachability.6.5.4.3.3.2.1 1 2 3 4 5 6 7 TTL.2.1 1 2 3 4 5 6 7 8 9 1 Number of Cooperative Peers 3 TTL 4 3. 1 P2P BRITE [1] BA [11] F =1. Zipf 1 1 5 45473 5 TTL P2P =1. Zipf 1 2 P2P 5 45473 1 1 TTL 1 7 2 3. 2 34 Uncooperative P2P Decending Order of Degree Proposal (Hop Count >= n) TTL n 1 n 3 1 TTL 3 TTL 7 TTL 6 4 TTL 7 P2P 1 2 P2P 11 3. 3 56 P2P 3 5 4 6 TTL 7 33 TTL 6 35 1 7 7 2 P2P 5
Number of Messages 7 6 5 4 3 2 Uncooperative Number of Messages (x1 6 ) 12 1 8 6 4 Uncooperative 1 2 1 2 3 4 5 6 7 TTL 5 1 15 2 25 3 35 Degree 5 TTL 7 Number of Messages 7 6 5 4 3 2 1 1 2 3 4 5 6 7 8 9 1 6 Number of Cooperative Peers P2P 4. P2P P2P P2P P2P P2P 21 COE ( ) [1] L. Qiu, Y.R. Yang, Y. Zhang, and S. Shenker, On Selfish Routing in Internet-Like Environments, in Proceedings of ACM SIGCOMM, p151-162, Aug. 23. [2] M. Seshadri and R.H. Katz, Dynamics of Simultaneous Overlay Network Routing, in UCB EECS report UCB//CSD-3-1291, Nov. 23. [3] I. Stoica, D. Adkins, S. Zhuang, S. Shenker, and S. Surana, Internet Indirection Infrastructure, in Proceedings of ACM SIGCOMM, p73-88, Aug. 22. [4] M. Kwon and S. Fahmy, Toward Cooperative Inter-overlay Networking, in Poster in IEEE ICNP, Nov. 23. [5] A. Nakao, L. Peterson, and A. Bavier, A Routing Underlay for Overlay Networks, in Proceedings of ACM SIGCOMM, p11-18, Aug. 23. [6] D.G. Andersen, H. Balakrishnan, M.F. Kaashoek, and R. Morris, Resilient Overlay Networks, in Proceedings of ACM SOSP, Oct. 21. [7] N. Wakamiya and M. Murata, Toward Overlay Network Symbiosis, to be presented at the Fifth International Peerto-Peer conference (P2P25), Aug. 25. [8] R. Schollmeier and G. Schollmeier, Why peer-to-peer (P2P) does scale: An analysis of P2P traffic patterns, in Proceedings of P2P22, (Linkoping), Sept. 22. [9] L.A. Adamic, R.M. Lukose, A.R. Puniyani, and B.A. Huberman, Search in power-law networks, in Physical Review E, vol 64, 46135, Sept. 21. [1] A. Medina, A. Lakhina, I. Matta, and J. Byers, BRITE: An approach to universal topology generation, in Proceedings of the International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication System (MASCOTS 1). available at http://www.cs.bu.edu/brite/, 21. [11] A.L. Barabasi and R. Albert, Emergence of Scaling in Networks, in Science, Vol 286, p59-512, Oct. 1999. 6