Karger, D.R., Lehman, E., Leighton, T., Levine, M., Lewin, D. and Panigrahy, R. (1997) Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the Worldwide Web. ACM Symposium on Theory of Computing, 5, 654-663.
http://dx.doi.org/10.1145/258533.258660

has been cited by the following article:

• TITLE: Design and Implementation of Peer-to-Peer Service Routing Algorithm

  AUTHORS: Xiaoyan Gao

  KEYWORDS: Peer-to-Peer, Services Routing, Ant Colony Algorithm

  JOURNAL NAME: Journal of Software Engineering and Applications, Vol.8 No.11, November 16, 2015

  ABSTRACT: Due to the lack of QoS (quality of service) guarantee in current Peer-to-Peer services routing network, it is difficult to apply Peer-to-Peer network to business successfully. Therefore, a service guarantee routing model is proposed in this paper, and an ant colony algorithm is designed for this routing model. Finally, the experimental analysis of the Peer-to-Peer services routing algorithm is presented. The experimental result shows the effectiveness of the service routing algorithm.