Abstract
Dynamic Hash Tables (DHT) are efficient tools which help to improve the system’s performance and reduce the overhead of search in peer-to-peer (P2P) systems. Chord exhibits significant disadvantages, such as keeping the node at a fixed position and storing entries on a fixed member peer. Thus, load imbalances may occur. To overcome this situation, a new ring-like associative memory has been introduced. Unlike the Chord, a fully decentralized token-game is presented for which items are in a lexical ordered ring-list, instead of being fixed to a determined peer. However, the items may have been shifted along the ring. According to the obtained experimental results the token-game worked with an adaption of the number of peers on the ring-list without any global instances. Furthermore, a suitable load-balancing basing on the physical analogue of communicating tubes which has been derived from the current flow theory that suggested a simultaneous and idiosyncratic flow of water that can be applied to the flow of information.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Lv, Q., Cao, P., Cohen, E., Li, K., Shenker, S.: Search and replication in unstructured P2P networks. In: Proceedings of the 16th International Conference on Supercomputing, pp. 84–95. ACM, New York (2002)
Jin, X., Chan, S.-H.G.: Unstructured peer-to-peer network architectures. In: Handbook of Peer-to-Peer Networking, pp. 117–142. Springer, Boston (2009)
Castro, M., Costa, M., Rowstron, A.: Peer-to-peer overlays: structured, unstructured, or both. Technical report MSR-TR-2004-73, Microsoft Research, System and Networking Group, Cambridge, UK (2004)
Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: a scalable peer-to-peer lookup service for internet applications. In: Proceedings of the 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, pp. 149–160. ACM, New York (2001)
Karger, D., Lehman, E., Leighton, F., Levine, M., Lewin, D., Panigrahy, R.: Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web. In: Proceedings of the 29th Annual ACM Symposium on Theory of Computing, pp. 654–663. ACM, New York (1997)
US Secure Hash Algorithm 1 (SHA1). http://www.ietf.org/rfc/rfc3174.txt. Accessed 20 Mar 2018
Siamak, S.: A peer-to-peer dictionary using chord DHT. http://citeseerx.ist.psu.edu/viewdoc/versions?doi=10.1.1.173.7388. Accessed 20 Mar 2018
Pitkow, J.E.: Summary of WWW characterizations. In: 7th International World-Wide Web Conference, Brisbane, Australia, pp. 3–13 (1998)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Simcharoen, S. (2020). Dynamic Data Management for an Associative P2P Memory. In: Boonyopakorn, P., Meesad, P., Sodsee, S., Unger, H. (eds) Recent Advances in Information and Communication Technology 2019. IC2IT 2019. Advances in Intelligent Systems and Computing, vol 936. Springer, Cham. https://doi.org/10.1007/978-3-030-19861-9_19
Download citation
DOI: https://doi.org/10.1007/978-3-030-19861-9_19
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-19860-2
Online ISBN: 978-3-030-19861-9
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)