K. P. N. Puttaswamy and B. Y. Zhao, “A Case for Unstructured Distributed Hash Tables,” Proceedings of IEEE Global Internet Symposium, Anchorage, 11 May 2007, pp. 7-12.
http://dx.doi.org/10.1109/GI.2007.4301423

has been cited by the following article:

• TITLE: Decentralization of a Multi Data Source Distributed Processing System Using a Distributed Hash Table

  AUTHORS: Grzegorz Chmaj, Shahram Latifi

  KEYWORDS: Data Transmission; Distributed Processing; Distributed Hash Table; Energy Dissipation

  JOURNAL NAME: International Journal of Communications, Network and System Sciences, Vol.6 No.10, October 25, 2013

  ABSTRACT: A distributed processing system (DPS) contains many autonomous nodes, which contribute their own computing power. DPS is considered a unified logical structure, operating in a distributed manner; the processing tasks are divided into fragments and assigned to various nodes for processing. That type of operation requires and involves a great deal of communication. We propose to use the decentralized approach, based on a distributed hash table, to reduce the communication overhead and remove the server unit, thus avoiding having a single point of failure in the system. This paper proposes a mathematical model and algorithms that are implemented in a dedicated experimental system. Using the decentralized approach, this study demonstrates the efficient operation of a decentralized system which results in a reduced energy emission.