Download now Free registration required
Peer-to-peer file sharing has a great prospect, peer-to-peer search problems have become the academic focus of one of the research questions. Already distributed P2P systems for the lack of caching mechanism unorganized navigation capacity of the lack of global routing algorithm, is a disorderly search this end, this paper proposes the modified key clustering algorithm, the routing space the NT and ST layers of orderly search, from global perspective. Scalable Key clustering algorithm, the authors learn from the Local-range field research, inserted into the connector quick Link remote node in the routing table with a certain probability, to shorten the average path length.
- Format: PDF
- Size: 322.5 KB