Brief announcement: Parameterized maximum and average degree approximation in topic-based publish-subscribe overlay network design

Melih Onus, Andrea Richa

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Scopus citations

Abstract

Designing an overlay network for publish/subscribe communication in a system where nodes may subscribe to many different topics of interest is of fundamental importance. For scalability and efficiency, it is important to keep the degree of the nodes in the publish/subscribe system low. It is only natural then to formalize the following problem: Given a collection of nodes and their topic subscriptions connect the nodes into a graph which has low average and maximum degree and in such a way that for each topic t, the graph induced by the nodes interested in t is connected. We present the first polynomial time parameterized sublinear approximation algorithm for this problem.

Original languageEnglish (US)
Title of host publicationSPAA'09 - Proceedings of the 21st Annual Symposium on Parallelism in Algorithms and Architectures
Pages39-40
Number of pages2
DOIs
StatePublished - Nov 23 2009
Event21st Annual Symposium on Parallelism in Algorithms and Architectures, SPAA'09 - Calgary, AB, Canada
Duration: Aug 11 2009Aug 13 2009

Publication series

NameAnnual ACM Symposium on Parallelism in Algorithms and Architectures

Conference

Conference21st Annual Symposium on Parallelism in Algorithms and Architectures, SPAA'09
CountryCanada
CityCalgary, AB
Period8/11/098/13/09

Keywords

  • Multicast
  • Optimization
  • Overlay networks
  • Peer-to-peer
  • Pub/sub

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture

Fingerprint Dive into the research topics of 'Brief announcement: Parameterized maximum and average degree approximation in topic-based publish-subscribe overlay network design'. Together they form a unique fingerprint.

  • Cite this

    Onus, M., & Richa, A. (2009). Brief announcement: Parameterized maximum and average degree approximation in topic-based publish-subscribe overlay network design. In SPAA'09 - Proceedings of the 21st Annual Symposium on Parallelism in Algorithms and Architectures (pp. 39-40). [1584000] (Annual ACM Symposium on Parallelism in Algorithms and Architectures). https://doi.org/10.1145/1583991.1584000