TY - GEN

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

AU - Onus, Melih

AU - Richa, Andrea

PY - 2010

Y1 - 2010

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

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

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

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

U2 - 10.1109/ICDCS.2010.54

DO - 10.1109/ICDCS.2010.54

M3 - Conference contribution

AN - SCOPUS:77955892906

SN - 9780769540597

T3 - Proceedings - International Conference on Distributed Computing Systems

SP - 644

EP - 652

BT - ICDCS 2010 - 2010 International Conference on Distributed Computing Systems

T2 - 30th IEEE International Conference on Distributed Computing Systems, ICDCS 2010

Y2 - 21 June 2010 through 25 June 2010

ER -