Minimum maximum-degree publish-subscribe overlay network design

Date
2011
Advisor
Instructor
Source Title
IEEE/ACM Transactions on Networking
Print ISSN
1063-6692
Electronic ISSN
Publisher
IEEE
Volume
19
Issue
5
Pages
1331 - 1343
Language
English
Type
Conference Paper
Journal Title
Journal ISSN
Volume Title
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 that has least possible maximum degree 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 logarithmic approximation algorithm for this problem and prove an almost tight lower bound on the approximation ratio. Our experimental results show that our algorithm drastically improves the maximum degree of publish/subscribe overlay systems. We also propose a variation of the problem by enforcing that each topic-connected overlay network be of constant diameter while keeping the average degree low. We present three heuristics for this problem that guarantee that each topic-connected overlay network will be of diameter 2 and that aim at keeping the overall average node degree low. Our experimental results validate our algorithms, showing that our algorithms are able to achieve very low diameter without increasing the average degree by much. © 2011 IEEE.

Course
Other identifiers
Book Title
Keywords
Communications technology, Approximation ratios, Average degree, Communications technology, Following problem, Logarithmic approximation, Low diameters, Lower bounds, Maximum degree, Node degree, Overlay systems, Peer-to-peer computing, Polynomial-time, Publish/subscribe, Publish/Subscribe system, Approximation algorithms, Distributed computer systems, Overlay networks, Polynomial approximation, Peer to peer networks
Citation
Published Version (Please cite this version)