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

14 Scopus citations

Abstract

Publish/subscribe communication systems where nodes subscribe to many different topics of interest are becoming increasingly more common. Designing overlay networks that connect the nodes subscribed to each distinct topic is hence a fundamental problem in these systems. For scalability and efficiency, it is important to keep the degree of the nodes in the publish/subscribe system low. Ideally one would like to be able not only to keep the average degree of the nodes low, but also to ensure that all nodes have equally the same degree, giving rise to the following problem: Given a collection of nodes and their topic subscriptions, connect the nodes into a graph with low average and maximum degree such 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. We also propose two heuristics for constructing topic-connected networks with low average degree and constant diameter and validate our results through simulations. In fact, the results in this section are a refinement of the preliminary results by Onus and Richa in INFOCOM'09.

Original languageEnglish (US)
Title of host publicationICDCS 2010 - 2010 International Conference on Distributed Computing Systems
Pages644-652
Number of pages9
DOIs
StatePublished - Aug 27 2010
Event30th IEEE International Conference on Distributed Computing Systems, ICDCS 2010 - Genova, Italy
Duration: Jun 21 2010Jun 25 2010

Publication series

NameProceedings - International Conference on Distributed Computing Systems

Other

Other30th IEEE International Conference on Distributed Computing Systems, ICDCS 2010
CountryItaly
CityGenova
Period6/21/106/25/10

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Fingerprint Dive into the research topics of '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. (2010). Parameterized maximum and average degree approximation in topic-based publish-subscribe overlay network design. In ICDCS 2010 - 2010 International Conference on Distributed Computing Systems (pp. 644-652). [5541686] (Proceedings - International Conference on Distributed Computing Systems). https://doi.org/10.1109/ICDCS.2010.54