1. What have the authors contributed in "Parameterized maximum and average degree approximation in topic-based publish-subscribe overlay network design" ?
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.. The authors present the first polynomial time parameterized sublinear approximation algorithm for this problem.. The authors also propose two heuristics for constructing topicconnected networks with low average degree and constant diameter and validate their results through simulations.
read more
2. What future works have the authors mentioned in the paper "Parameterized maximum and average degree approximation in topic-based publish-subscribe overlay network design" ?
As future work, the authors would like to build upon their CD-ODA-I and CD-ODA-II algorithms, by formally and experimentally evaluating the hardness of obtaining a topic-connected overlay design algorithm which achieves a “ good ” trade-off between low diameter and low node degree.. Two other important lines for future work would be to design efficient distributed algorithms for the Low-TCO problem, and to look at this problem under the line of a dynamic configuration of the node set V and the interest assignment I.
read more
