Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
GPT-4o
Gemini 2.5 Pro Pro
o3 Pro
GPT-4.1 Pro
DeepSeek R1 via Azure Pro
2000 character limit reached

Topiary: Fast, Scalable Publish/Subscribe for Peer-to-Peer (D)Apps (2312.06800v1)

Published 11 Dec 2023 in cs.NI

Abstract: The emergence of blockchain technology has fostered the development of numerous decentralized applications (dapps) in recent years Pub/sub (publish/subscribe) systems play a crucial role by associating messages with specific topics and propagating them from publishers to subscribers across the network. Decentralized pub/sub aims to provide this functionality without relying on centralized control or global network state information, enabling message propagation among nodes in a coordinated manner. Efficiency in pub/sub services entails ensuring that subscribers receive published messages promptly. We introduce Topiary, a rapid and scalable protocol designed for decentralized applications' pub/sub systems. Topiary autonomously learns an efficient peer-to-peer (p2p) topology tailored to the publish/subscribe network. It does so by analyzing peers' interactions with their neighbors. Inspired by concepts from the multi-armed bandit problem, Topiary strikes an optimal balance between maintaining connections with well-connected neighbors and exploring new connections within the network, based on their topical needs. Through experimental evaluations, Topiary has shown a 50% reduction in broadcast latency while achieving an interested topic coverage of over 98%, marking it as a promising solution for efficient decentralized pub/sub networks.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (25)
  1. P. SAVOLAINEN, S. JUSLENIUS, E. ANDREWS, M. POKROVSKII, S. TARKOMA, and H. PIHKALA, “The streamr network: Performance and scalability,” url: https://streamrpublic. s3. amazonaws. com/streamr-network-scalability-whitepaper-2020-08-20. pdf.
  2. M. Al-Bassam, A. Sonnino, and V. Buterin, “Fraud and data availability proofs: Maximising light client security and scaling blockchains with dishonest majorities,” arXiv preprint arXiv:1809.09044, 2018.
  3. D. Vyzovitis, Y. Napora, D. McCormick, D. Dias, and Y. Psaras, “Gossipsub: Attack-resilient message propagation in the filecoin and eth2. 0 networks,” arXiv preprint arXiv:2007.02754, 2020.
  4. Y. Mao, S. Deb, S. B. Venkatakrishnan, S. Kannan, and K. Srinivasan, “Perigee: Efficient peer-to-peer network design for blockchains,” in Proceedings of the 39th Symposium on Principles of Distributed Computing, 2020, pp. 428–437.
  5. B. Xue, Y. Mao, , S. B. Venkatakrishnan, and S. Kannan, “Goldfish: Peer selection using matrix completion in unstructured p2p network,” in IEEE International Conference on Blockchain and Cryptocurrency, 2023.
  6. P. Auer, “Using confidence bounds for exploitation-exploration trade-offs,” Journal of Machine Learning Research, vol. 3, no. Nov, pp. 397–422, 2002.
  7. K. Babel and L. Baker, “Strategic peer selection using transaction value and latency,” in Proceedings of the 2022 ACM CCS Workshop on Decentralized Finance and Security, 2022, pp. 9–14.
  8. Y. Mao and S. B. Venkatakrishnan, “Less is more: Understanding network bias in proof-of-work blockchains,” Mathematics, vol. 11, no. 23, 2023. [Online]. Available: https://www.mdpi.com/2227-7390/11/23/4741
  9. Y. Gai, B. Krishnamachari, and R. Jain, “Learning multiuser channel allocations in cognitive radio networks: A combinatorial multi-armed bandit formulation,” in 2010 IEEE Symposium on New Frontiers in Dynamic Spectrum (DySPAN).   IEEE, 2010, pp. 1–9.
  10. B. Kveton, Z. Wen, A. Ashkan, and C. Szepesvari, “Tight regret bounds for stochastic combinatorial semi-bandits,” in Artificial Intelligence and Statistics.   PMLR, 2015, pp. 535–543.
  11. W. Chen, Y. Wang, and Y. Yuan, “Combinatorial multi-armed bandit: General framework and applications,” in International conference on machine learning.   PMLR, 2013, pp. 151–159.
  12. G. Dong, M. Tang, Z. Wang, J. Gao, S. Guo, L. Cai, R. Gutierrez, B. Campbel, L. E. Barnes, and M. Boukhechba, “Graph neural networks in iot: a survey,” ACM Transactions on Sensor Networks, vol. 19, no. 2, pp. 1–50, 2023.
  13. “Global ping statistics,” https://wondernetwork.com/pings.
  14. K. Wüst and A. Gervais, “Ethereum eclipse attacks,” ETH Zurich, Tech. Rep., 2016.
  15. “Ethereum node discovery protocol v5,” https://github.com/ethereum/devp2p/blob/master/discv5/discv5.md.
  16. S. B. V. Yunqi Zhang, “Kadabra: Adapting kademlia for the decentralized web,” arXiv preprint arXiv:2210.12858, 2023.
  17. “Take a look at pubsub on ipfs,” https://blog.ipfs.tech/25-pubsub/.
  18. “Ipfs search,” https://ipfs-search.com/#/.
  19. M. Castro, P. Druschel, A.-M. Kermarrec, and A. Rowstron, “Scribe: a large-scale and decentralized application-level multicast infrastructure,” IEEE Journal on Selected Areas in Communications, vol. 20, no. 8, pp. 1489–1499, 2002.
  20. S. Q. Zhuang, B. Y. Zhao, A. D. Joseph, R. H. Katz, and J. D. Kubiatowicz, “Bayeux: An architecture for scalable and fault-tolerant wide-area data dissemination,” in Proceedings of the 11th international workshop on Network and operating systems support for digital audio and video, 2001, pp. 11–20.
  21. S. Ratnasamy, M. Handley, R. Karp, and S. Shenker, “Application-level multicast using content-addressable networks,” in Networked Group Communication: Third International COST264 Workshop, NGC 2001 London, UK, November 7–9, 2001 Proceedings 3.   Springer, 2001, pp. 14–29.
  22. F. Rahimian, S. Girdzijauskas, A. H. Payberah, and S. Haridi, “Vitis: A gossip-based hybrid overlay for internet-scale publish/subscribe enabling rendezvous routing in unstructured overlay networks,” in 2011 IEEE International Parallel & Distributed Processing Symposium.   IEEE, 2011, pp. 746–757.
  23. R. Baldoni, R. Beraldi, V. Quema, L. Querzoni, and S. Tucci-Piergiovanni, “Tera: topic-based event routing for peer-to-peer architectures,” in Proceedings of the 2007 inaugural international conference on Distributed event-based systems, 2007, pp. 2–13.
  24. G. Chockler, R. Melamed, Y. Tock, and R. Vitenberg, “Spidercast: a scalable interest-aware overlay for topic-based pub/sub communication,” in Proceedings of the 2007 inaugural international conference on Distributed event-based systems, 2007, pp. 14–25.
  25. V. Setty, M. Van Steen, R. Vitenberg, and S. Voulgaris, “Poldercast: Fast, robust, and scalable architecture for p2p topic-based pub/sub,” in Middleware 2012: ACM/IFIP/USENIX 13th International Middleware Conference, Montreal, QC, Canada, December 3-7, 2012. Proceedings 13.   Springer, 2012, pp. 271–291.
Citations (1)

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.

X Twitter Logo Streamline Icon: https://streamlinehq.com