### 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 a heuristic for constructing topic-connected networks with low average degree and diameter 2 and validate our results through simulations.

Original language | English (US) |
---|---|

Pages (from-to) | 307-317 |

Number of pages | 11 |

Journal | Computer Networks |

Volume | 94 |

DOIs | |

State | Published - Jan 15 2016 |

### Fingerprint

### Keywords

- multicast
- optimization problems
- overlay networks
- peer to peer
- publish/subscribe

### ASJC Scopus subject areas

- Computer Networks and Communications

### Cite this

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

Research output: Contribution to journal › Article

}

TY - JOUR

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

AU - Onus, Melih

AU - Richa, Andrea

PY - 2016/1/15

Y1 - 2016/1/15

N2 - 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 a heuristic for constructing topic-connected networks with low average degree and diameter 2 and validate our results through simulations.

AB - 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 a heuristic for constructing topic-connected networks with low average degree and diameter 2 and validate our results through simulations.

KW - multicast

KW - optimization problems

KW - overlay networks

KW - peer to peer

KW - publish/subscribe

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

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

U2 - 10.1016/j.comnet.2015.10.023

DO - 10.1016/j.comnet.2015.10.023

M3 - Article

VL - 94

SP - 307

EP - 317

JO - Computer Networks

JF - Computer Networks

SN - 1389-1286

ER -