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 Citations (Scopus)

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 publicationAnnual ACM Symposium on Parallelism in Algorithms and Architectures
Pages39-40
Number of pages2
DOIs
StatePublished - 2009
Event21st Annual Symposium on Parallelism in Algorithms and Architectures, SPAA'09 - Calgary, AB, Canada
Duration: Aug 11 2009Aug 13 2009

Other

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

Fingerprint

Publish/subscribe
Overlay networks
Overlay Networks
Approximation algorithms
Network Design
Scalability
Polynomials
Communication
Approximation
Vertex of a graph
Graph in graph theory
Maximum Degree
Approximation Algorithms
Polynomial time

Keywords

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

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture

Cite this

Brief announcement : Parameterized maximum and average degree approximation in topic-based publish-subscribe overlay network design. / Onus, Melih; Richa, Andrea.

Annual ACM Symposium on Parallelism in Algorithms and Architectures. 2009. p. 39-40 1584000.

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

Onus, M & Richa, A 2009, Brief announcement: Parameterized maximum and average degree approximation in topic-based publish-subscribe overlay network design. in Annual ACM Symposium on Parallelism in Algorithms and Architectures., 1584000, pp. 39-40, 21st Annual Symposium on Parallelism in Algorithms and Architectures, SPAA'09, Calgary, AB, Canada, 8/11/09. https://doi.org/10.1145/1583991.1584000
Onus, Melih ; Richa, Andrea. / Brief announcement : Parameterized maximum and average degree approximation in topic-based publish-subscribe overlay network design. Annual ACM Symposium on Parallelism in Algorithms and Architectures. 2009. pp. 39-40
@inproceedings{554f8fa62c3d461c8812e31137b72d71,
title = "Brief announcement: Parameterized maximum and average degree approximation in topic-based publish-subscribe overlay network design",
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.",
keywords = "Multicast, Optimization, Overlay networks, Peer-to-peer, Pub/sub",
author = "Melih Onus and Andrea Richa",
year = "2009",
doi = "10.1145/1583991.1584000",
language = "English (US)",
isbn = "9781605586069",
pages = "39--40",
booktitle = "Annual ACM Symposium on Parallelism in Algorithms and Architectures",

}

TY - GEN

T1 - Brief announcement

T2 - Parameterized maximum and average degree approximation in topic-based publish-subscribe overlay network design

AU - Onus, Melih

AU - Richa, Andrea

PY - 2009

Y1 - 2009

N2 - 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.

AB - 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.

KW - Multicast

KW - Optimization

KW - Overlay networks

KW - Peer-to-peer

KW - Pub/sub

UR - http://www.scopus.com/inward/record.url?scp=70449629574&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=70449629574&partnerID=8YFLogxK

U2 - 10.1145/1583991.1584000

DO - 10.1145/1583991.1584000

M3 - Conference contribution

AN - SCOPUS:70449629574

SN - 9781605586069

SP - 39

EP - 40

BT - Annual ACM Symposium on Parallelism in Algorithms and Architectures

ER -