Abstract
The distributed storage of a co-occurrence graph in a peer-to-peer (P2P) network faces the loss of knowledge when peers disappear. Recovery mechanisms are necessary to ensure stable operation, but conventional redundancy methods have too many drawbacks in the P2P network.
It was possible to show that using messages flowing through the rest of the network provided enough redundancy for comprehensive recovery of a faulty and failed peer. The messages were created in normal operation and can be used without much additional (network) load. There is a high probability that the network will continuously produce valid results, even if peers disappear and have to be replaced by new, initially empty peers. Thus, a co-occurrence graph can be stored in a peer-to-peer network in a very robust manner, and the algorithms found can significantly increase fault tolerance.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Almeida, S., Vicentini, J., Bonilha, L., De Campos, B., Casseb, R., Min, L.: Brain connectivity and functional recovery in patients with ischemic stroke. J. Neuroimaging 27, 65–70 (2017). https://onlinelibrary.wiley.com/doi/abs/10.1111/jon.12362
Kubek, M., Unger, H.: The WebEngine: a fully integrated, decentralised web search engine. In: Proceedings of the 2nd International Conference on Natural Language Processing and Information Retrieval, pp. 26–31 (2018). https://doi.org/10.1145/3278293.3278294/
Patterson, D., Gibson, G., Katz, R.: A case for redundant arrays of inexpensive disks (RAID). In: Proceedings of the 1988 ACM SIGMOD International Conference on Management of Data, pp. 109–116 (1988). https://doi.org/10.1145/50202.50214
Simcharoen, S., Unger, H.: The brain: WebEngine version 2.0. In: Unger, H., Kubek, M. (eds.) The Autonomous Web, pp. 51–68. Springer, Cham (2022). https://doi.org/10.1007/978-3-030-90936-9_4
Simcharoen, S., Nagy, G., Unger, H.: Decentralised routing in P2P-systems with incomplete knowledge. In: Unger, H., Kubek, M. (eds.) The Autonomous Web. Studies in Big Data, vol. 101, pp. 123–135. Springer, Cham (2022). https://doi.org/10.1007/978-3-030-90936-9_9
Unger, H., Kubek M., Sukjit, P.: Netzbasierte Ansätze zur natürlichsprachlichen Informationsverarbeitung. Springer Fachmedien Wiesbaden (2022). https://doi.org/10.1007/978-3-658-37284-2
Watts, D., Strogatz, S.: Collective dynamics of ‘small-world’ networks. Nature 393, 440–442 (1998). https://www.nature.com/articles/30918
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Drebinger, M., Tominski, O., Unger, H. (2023). Reconstruct a Distributed Co-occurrence Graph in a P2P Network Without Overhead. In: Unger, H., Schaible, M. (eds) Real-time and Autonomous Systems 2022. Real-Time 2022. Lecture Notes in Networks and Systems, vol 674. Springer, Cham. https://doi.org/10.1007/978-3-031-32700-1_16
Download citation
DOI: https://doi.org/10.1007/978-3-031-32700-1_16
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-32699-8
Online ISBN: 978-3-031-32700-1
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)