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


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.

Share and Cite:

G. Chmaj and S. Latifi, "Decentralization of a Multi Data Source Distributed Processing System Using a Distributed Hash Table," International Journal of Communications, Network and System Sciences, Vol. 6 No. 10, 2013, pp. 451-458. doi: 10.4236/ijcns.2013.610047.

Conflicts of Interest

The authors declare no conflicts of interest.


[1] J. Ding, I. Balasingham and P. Bouvry, “Management of Overlay Networks: A Survey,” Proceedings of 3rd International Conference on Mobile Ubiquitous Computing, Systems, Services and Technologies, Sliema, 11-16 October 2009, pp. 249-255.
[2] D. Kasthurirathna and C. Keppetiyagama, “Architectural description based Overlay Networks,” Proceedings of International Conference on Advances in ICT for Emerging Regions, Colombo, 1-2 September 2011, pp. 14-18.
[3] G. Chmaj and K. Walkowiak, “A P2P Computing System for Overlay Networks,” Future Generation Computer Systems, Vol. 29, No. 1, 2013, pp. 242-249.
[4] G. Chmaj and D. Zydek, “Software Development Approach for Discrete Simulators,” Proceedings of 21st International Conference on Systems Engineering, Las Vegas, 16-18 August 2011, pp. 273-278.
[5] 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.
[6] Z. Zhang, “The Power of DHT as a Logical Space,” Proceedings of 10th IEEE International Workshop on Future Trends of Distributed Computing Systems, Suzhou, 26-28 May 2004, pp. 325-331.
[7] F. Umer and A. Qayyum, “Architecture for Decentralized, Distributed Event Communication Mechanism through Overlay Network,” Proceedings of IEEE Symposium on Emerging Technologies, Islamabad, 17-18 Sepember 2005, pp. 252-257.
[8] C. S. Raghavendra, K. M. Sivalingam and T. Znati (Editors), “Wireless Sensor Networks,” Springer, 2004.
[9] W. Song, S. Kim, S. Seok and D. Choi, “Pastry Based Sensor Data Sharing,” Proceedings of 18th InternatonalConference on Computer Communications and Networks, San Francisco, 3-6 August 2009, pp. 1-6.
[10] T. Delot, N. Mitton, S. Ilarri and T. Hien, “Decentralized Pull-Based Information Gathering in Vehicular Networks Using GeoVanet,” Proceedings of 12th International Conference on Mobile Data Management, Lulea, 6-9 June 2011, pp. 174-183.
[11] J. Timpanaro, T. Cholez, I. Chrisment and O. Festor, “When KAD Meets BitTorrent—Building a Stronger P2P Network,” Proceedings of IEEE International Parallel & Distributed Processing Symposium, Shanghai, 2011, pp. 1635-1642.
[12] E. Rosas, N. Hidalgo and M. Marin, “Two-Level Result Caching for Web Search Queries on Structured P2P Networks,” Proceedings of IEEE 18th International Conference on Parallel and Distributed Systems, Singapore, 17-19 December 2012, pp. 221-228.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.