TY - JOUR

T1 - Minimum maximum-degree publish-subscribe overlay network design

AU - Onus, Melih

AU - Richa, Andrea

N1 - Funding Information:
Manuscript received February 23, 2010; revised October 05, 2010; accepted January 15, 2011; approved by IEEE/ACM TRANSACTIONS ON NETWORKING Editor D. Rubenstein. Date of publication June 23, 2011; date of current version October 14, 2011. This work was supported in part by the NSF under Awards CCF-0830791 and CCF-0830704. A preliminary version containing some of the results in this paper appeared at the IEEE Conference on Computer Communications (INFOCOM) Rio de Janeiro, Brazil, April 19–25, 2009, and the IEEE International Conference on Distributed Computing Systems (ICDCS) Genoa, Italy, June 21–25, 2010.

PY - 2011/10

Y1 - 2011/10

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

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

KW - Communications technology

KW - peer-to-peer computing

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

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

U2 - 10.1109/TNET.2011.2144999

DO - 10.1109/TNET.2011.2144999

M3 - Article

AN - SCOPUS:80054115540

SN - 1063-6692

VL - 19

SP - 1331

EP - 1343

JO - IEEE/ACM Transactions on Networking

JF - IEEE/ACM Transactions on Networking

IS - 5

M1 - 5929496

ER -