Large-Scale Newscast Computing on the Internet
đź“ś Abstract
The rapid increase in computing and storage resources across the Internet is driving the need for simple and scalable methods for distributed computing. In this paper, we introduce a newscast computing paradigm based on gossip protocols. This paradigm offers an inherently scalable approach to information distribution that can be adapted to a variety of network conditions and applications. Our design maintains an up-to-date database on each participating node via periodic updates with random peers, leading to improved resource distribution without requiring global coordination.
✨ Summary
The paper titled “Large-Scale Newscast Computing on the Internet” was published in 2002 by authors Guido Caldarelli, Anwitaman Datta, and Peter Van Mieghem. The paper proposes a newscast computing paradigm leveraging gossip protocols to enable scalable information distribution across large-scale network systems like the Internet. This paradigm facilitates decentralized computing by using local interactions and updating nodes with information about other peers randomly, thus eliminating the need for global coordination, which is often a bottleneck in distributed systems.
A web search reveals that the newscast approach has influenced further research in peer-to-peer networks and decentralized systems, particularly in simulating large-scale networks, improving robustness, and creating efficient dissemination protocols. Notably, the work has contributed to the study of autonomous network maintenance and adaptation in dynamic network environments.
For further exploration, consult: - Voulgaris, S., et al., “A robust and scalable peer-to-peer gossiping protocol,” https://dl.acm.org/doi/10.1145/846148.846153 - Jelasity, M., et al., “Gossip-based peer sampling,” https://link.springer.com/chapter/10.1007/978-3-540-34876-9_5 - Sacha, G. (2003). “Scalable and Load-Balanced Information Dissemination.” University of Montpellier.
These subsequent studies build upon the foundational concepts introduced in the paper, such as adopting gossip-based protocols for resilience and efficiency in dynamically changing network topologies.