期刊名称：International Journal of Computer Science & Technology
印刷版ISSN：2229-4333
电子版ISSN：0976-8491
出版年度：2012
卷号：3
期号：2
页码：856-859
语种：English
出版社：Ayushmaan Technologies
摘要：Peer-to-Peer system is now one of the fastest growing and most popular applications. Centralize Peer to peer systems always suffer from the problems of single point of failure, low availability, denial of service attacks. Searching of the required data is a vital issue in both centralized and decentralized P2P network. Many methods have been implemented for searching in P2P network such as Flooding, Random Walk, Expanding Ring or Iterative deepening, K-Walker Random Walk, etc. Some of these generate large traffic while others take long searching time. A probabilistic approach with Two Level K Walker Random Walk for searching has been studied and enhanced in this paper so that these issues can slightly overcome. Advantages of two level walk are further reducing collision of nodes and helping in searching the distant nodes. But it has slightly increased the response time. This disadvantage can be overcome when there are a lot of dull nodes in the network with this enhancement.
