Designing Overlapping Networks for Publish-Subscribe Systems

Authors Jennifer Iglesias, Rajmohan Rajaraman, R. Ravi, Ravi Sundaram

Thumbnail PDF


  • Filesize: 0.51 MB
  • 15 pages

Document Identifiers

Author Details

Jennifer Iglesias
Rajmohan Rajaraman
R. Ravi
Ravi Sundaram

Cite AsGet BibTex

Jennifer Iglesias, Rajmohan Rajaraman, R. Ravi, and Ravi Sundaram. Designing Overlapping Networks for Publish-Subscribe Systems. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 40, pp. 381-395, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)


From the publish-subscribe systems of the early days of the Internet to the recent emergence of Web 3.0 and IoT (Internet of Things), new problems arise in the design of networks centered at producers and consumers of constantly evolving information. In a typical problem, each terminal is a source or sink of information and builds a physical network in the form of a tree or an overlay network in the form of a star rooted at itself. Every pair of pub-sub terminals that need to be coordinated (e.g. the source and sink of an important piece of control information) define an edge in a bipartite demand graph; the solution must ensure that the corresponding networks rooted at the endpoints of each demand edge overlap at some node. This simple overlap constraint, and the requirement that each network is a tree or a star, leads to a variety of new questions on the design of overlapping networks. In this paper, for the general demand case of the problem, we show that a natural LP formulation has a non-constant integrality gap; on the positive side, we present a logarithmic approximation for the general demand case. When the demand graph is complete, however, we design approximation algorithms with small constant performance ratios, irrespective of whether the pub networks and sub networks are required to be trees or stars.
  • Approximation Algorithms
  • Steiner Trees
  • Publish-Subscribe Systems
  • Integrality Gap
  • VPN.


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. Ajit Agrawal, Philip N. Klein, and R. Ravi. When trees collide: An approximation algorithm for the generalized steiner problem on networks. SIAM J. Comput., 24(3):440-456, 1995. Google Scholar
  2. Yair Bartal. On approximating arbitrary metrices by tree metrics. In STOC, pages 161-168, 1998. Google Scholar
  3. R. C. Chakinala, A. Kumarasubramanian, K. A. Laing, R. Manokaran, C. Pandu Rangan, and R. Rajaraman. Playing push vs pull: models and algorithms for disseminating dynamic data in networks. In SPAA, pages 244-253, 2006. Google Scholar
  4. Yevgeniy Dodis and Sanjeev Khanna. Designing networks with bounded pairwise distance. In STOC, pages 750-759, 1999. Google Scholar
  5. Friedrich Eisenbrand and Fabrizio Grandoni. An improved approximation algorithm for virtual private network design. SODA, pages 928-932, 2005. Google Scholar
  6. Friedrich Eisenbrand, Fabrizio Grandoni, Thomas Rothvoss, and Guido Schafer. Connected facility location via random facility sampling and core detouring. JCSS, 76(8):709-726, 2010. Google Scholar
  7. Jittat Fakcharoenphol, Satish Rao, and Kunal Talwar. A tight bound on approximating arbitrary metrics by tree metrics. J. Comput. Syst. Sci., 69(3):485-497, 2004. Google Scholar
  8. Naveen Garg, Goran Konjevod, and R. Ravi. A polylogarithmic approximation algorithm for the group Steiner tree problem. J. Algorithms, 37(1):66-84, 2000. Google Scholar
  9. Navin Goyal, Neil Olver, and F. Bruce Shepherd. The VPN conjecture is true. J. ACM, 60(3):17, 2013. Google Scholar
  10. Anupam Gupta, Jon M. Kleinberg, Amit Kumar, Rajeev Rastogi, and Bülent Yener. Provisioning a virtual private network: a network design problem for multicommodity flow. STOC, pages 389-398, 2001. Google Scholar
  11. Eran Halperin, Guy Kortsarz, Robert Krauthgamer, Aravind Srinivasan, and Nan Wang. Integrality ratio for group Steiner trees and directed Steiner trees. SIAM J. Comput., 36(5):1494-1511, 2007. Google Scholar
  12. Kamal Jain. A factor 2 approximation algorithm for the generalized steiner network problem. Combinatorica, 21(1):39-60, 2001. Google Scholar
  13. Guy Kortsarz and David Peleg. Generating low-degree 2-spanners. SIAM Journal on Computing, 27(5):1438-1456, 1998. Google Scholar
  14. Shi Li. Approximation algorithms for network routing and facility location problems. Doctoral Dissertation, Princeton University, Januray 2014. Google Scholar
  15. Laura J. Poplawski and Rajmohan Rajaraman. Multicommodity facility location under group steiner access cost. SODA, pages 996-1013, 2011. Google Scholar
  16. R. Ravi and F. Sibel Salman. Approximation algorithms for the traveling purchaser problem and its variants in network design. ESA, pages 29-40, 1999. Google Scholar
  17. R. Ravi and Amitabh Sinha. Approximation algorithms for multicommodity facility location problems. SIAM J. Discrete Math., 24(2):538-551, 2010. Google Scholar
  18. Thomas Rothvoss and Laura Sanita. On the complexity of the asymmetric VPN problem. In APPROX/RANDOM, pages 326-338, 2009. Google Scholar
  19. David B. Shmoys, Chaitanya Swamy, and Retsef Levi. Facility location with service installation costs. In SODA, pages 1088-1097, 2004. Google Scholar
  20. Chaitanya Swamy and Amit Kumar. Primal-dual algorithms for connected facility location problems. Algorithmica, 40(4):245-269, 2004. Google Scholar
  21. Chaitanya Swamy and David B. Shmoys. Fault-tolerant facility location. ACM Transactions on Algorithms, 4(4), 2008. Google Scholar
  22. David P Williamson and David B Shmoys. The Design of Approximation Algorithms. Cambridge University Press, 2011. Google Scholar
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail