loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
20th International Conference on Advanced Information Networking and Applications - Volume 1 (AINA'06)
Multi-Node Global Directory Construction in Peer-to-Peer Systems
Vienna, Austria
April 18-April 20
ISBN: 0-7695-2466-4
InSung Kang, Korea University Anam-Dong Sungbuk-Ku, Seoul, Korea
HongSoo Kim, Korea University Anam-Dong Sungbuk-Ku, Seoul, Korea
SungJin Choi, Korea University Anam-Dong Sungbuk-Ku, Seoul, Korea
MaengSoon Baik, Korea University Anam-Dong Sungbuk-Ku, Seoul, Korea
ChongSun Hwang, Korea University Anam-Dong Sungbuk-Ku, Seoul, Korea
In P2P systems, the speed of searching for desired lists of sharable files is one of the most important measurement issues in evaluation of overall system performance. Although the searching schemes of existing non-structured P2P systems have been improved to enhance speed considerably, they still never reach to the level of those of the centralized and structured systems. In this paper, we propose a multinode global directory in P2P systems, where all the lists of sharable resources of the joining peers are aggregated and divided into the chosen nodes while keeping collating sequence as a whole to make one big linked list. Thus in indexed sequential searching, the system provides us with convenience of using the command like ?dir? of MS-DOS, and in general keyword searching, which is naturally impossible for the structured P2P systems, the searching speed is even faster than those of centralized P2P systems since a small list segment is scanned at each node synchronously in parallel.
Citation:
InSung Kang, HongSoo Kim, SungJin Choi, MaengSoon Baik, ChongSun Hwang, "Multi-Node Global Directory Construction in Peer-to-Peer Systems," aina, vol. 1, pp.713-720, 20th International Conference on Advanced Information Networking and Applications - Volume 1 (AINA'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.