Presentation 2005-01-27
Proposals and Evaluations of Modified-BFS using the number of links in P2P Networks
Junya Sugawara, Toyofumi Takenaka,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) One of the serious problems in unstructured peer-to-peer networks is network overload by the large amounts of query messages generated by Breadth First Search (BFS). The search method called modified-BFS (m-BFS) has been proposed in order to reduce the number of queries. However, although this technique can reduce the number of queries, it cannot obtain sufficient success responses. In this paper, we improve the performance of m-BFS by taking account of the neighbor's degree, which means the number of links of neighbor nodes, and evaluate its performance. In addition, we introduce Local Indices to improve the efficiency of our proposal search method.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Peer-to-Peer / search / BFS / modified-BFS / local indices
Paper # NS2004-181,OCS2004-141
Date of Issue

Conference Information
Committee OCS
Conference Date 2005/1/20(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Optical Communication Systems (OCS)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Proposals and Evaluations of Modified-BFS using the number of links in P2P Networks
Sub Title (in English)
Keyword(1) Peer-to-Peer
Keyword(2) search
Keyword(3) BFS
Keyword(4) modified-BFS
Keyword(5) local indices
1st Author's Name Junya Sugawara
1st Author's Affiliation Graduate School of Engineering, Nihon University()
2nd Author's Name Toyofumi Takenaka
2nd Author's Affiliation Graduate School of Engineering, Nihon University
Date 2005-01-27
Paper # NS2004-181,OCS2004-141
Volume (vol) vol.104
Number (no) 618
Page pp.pp.-
#Pages 4
Date of Issue