Taichi Akiba
ABSTRACT
Content sharing in unstructured P2P networks, where there is no function to centrally manage content location information on the network, is executed by sending queries from a peer requesting content to its neighbors one after another. This causes a problem of large increase in network load. As a solution to this problem, a method has been proposed in which each peer keeps transmission records (TRs) of queries to efficiently direct queries. However, when a query is being guided through a TR and the link is broken due to peers leaving the system, the length of the search path increases until the system recognizes the broken link. In this paper, as a TR reference method, we focus on content possessing peers and propose a method for query guidance by referring to a newer TR to avoid using broken links. In the proposed method, the content possessing peer is recorded on each peer, and the TR to be referred to is determined based on the information. The effectiveness of the proposed method is evaluated by computer simulations and compared with the conventional methods.
- Q. Lv, P. Cao, E. Cohen, K. Li, S. Shenker, "Search and Replication in Unstructured Peer-to-Peer Networks," in Proc. 16th International Conference on Supercomputing (ICS-02), pp. 84-95, June 2002.Google Scholar
Digital Library
- T. Tomimatsu, S. Sugawara, Y. Ishibashi, "Query guidance with transmission records for efficient content searching in unstructured peer-to-peer networks," in Proc. IEEE 2013 International Communications Quality and Reliability, May 2013 (CQR) Workshop, May 2013.Google Scholar
- D. Takeda, S. Sugawara, “A Content Searching Scheme Using Popularity and Link Degree of Nodes in Unstructured P2P Networks with Cache Routers,” in Proc. International Conference on Complex, Intelligent, and Software Intensive Systems, International Workshop on Virtual Environment and Network-Oriented Applications (CISIS/VENOA-2016), July 2016.Google ScholarCross Ref
- E. J. Rosensweig, J. Kurose, "Breadcrumbs: efficient, best-effort content location in cache networks," in Proc. IEEE INFOCOM 2009 (The 28th Conference on Computer Communications), pp. 2631-2635, April 2009.Google Scholar
- K. Asano, H. Watanabe, S. Sugawara, “Efficient Quality Induction for Content Searching in Unstructured Peer-to-Peer Network,” in Proc. 2018 IEEE International Conference on Consumer Electronics-Taiwan (ICCE-TW 2018), pp. 329-330, May 2018.Google Scholar
- T. Kikuchi, T. Akiba, S. Sugawara, "Efficient Query Guidance Using Content Distribution Records in Unstructured Peer-to-Peer Network," in Proc. 2022 The 4th International Conference on Computer Communication and the Internet (ICCCI 2022), July 2022. (In press)Google Scholar
- A. Barabási, R. Albert, "Emergence of Scaling in Random Networks," Science, pp. 509-512, Oct. 1999.Google Scholar
Index Terms
- Improvement and Evaluation of Query Guidance Method Focusing on Content Transmission Record Assignment Time in Unstructured Peer-to-Peer Network
Recommendations
Combining search and trust models in unstructured peer-to-peer networks
Effectiveness of Peer-to-Peer (P2P) systems highly depends on efficiency and scalability of their search algorithms. Moreover, managing trust is a key issue for wide acceptance of P2P computing. Surprisingly, the majority of the available trust systems ...
Reducing query overhead through route learning in unstructured peer-to-peer network
In unstructured peer-to-peer networks, such as Gnutella, peers propagate query messages towards the resource holders by flooding them through the network. This is, however, a costly operation since it consumes node and link resources excessively and ...
A semantic overlay network for unstructured peer-to-peer protocols
ICPADS '07: Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 01Peer-to-Peer computing has become a popular networking paradigm for file sharing, distributed computing, collaborative working, etc. The widely used unstructured Peer-to-Peer protocols mainly face two problems arecting their working efficiency: 1) ...
Comments