@article{c1125da2e55e4fbb82f4df24c9b96c29,

title = "Parameterized maximum and average degree approximation in topic-based publish-subscribe overlay network design",

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

keywords = "multicast, optimization problems, overlay networks, peer to peer, publish/subscribe",

author = "Melih Onus and Andrea Richa",

note = "Funding Information: In this paper, we study a new optimization problem (Low-TCO) that constructs a practical and scalable overlay network for publish/subscribe communication with many topics. We present a topic-connected overlay network design algorithm (Low-ODA) which approximates both average degree and maximum degree well. We anticipate that the parameterized algorithmic framework proposed by Low-ODA will be applicable in other network design domains where, for scalability, it is important to keep both the maximum degree as well as the average degree of an overlay network low. Examples of such application domains are in the design of survivable networks [18] and in wireless networks [15] . As future work, we would like to build upon our 2D-ODA algorithm, 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. This basically amounts to a bicriteria optimization problem and we have to be able to “quantify” the relative importance of optimizing over these two parameters (e.g., in the 2D-ODA algorithm we restrict our attention to networks of diameter 2, while aiming at maintaining the average degree low). Another open problem is overlay networks with logarithmic diameters as in distributed systems such as DHT and small-world networks. 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 . Melih Onus received the BS degree in computer engineering from Bilkent University, Turkey in 2003. He received Ph.D. degree in computer science from Arizona State University (ASU), Tempe, in 2009. He is currently an instructor at TOBB University of Economics and Technology, Turkey. His research interests are in the areas of distributed computing, computer networks and algorithms. Andrea W. Richa is an Associate Professor at the Department of Computer Science and Engineering at Arizona State University, Tempe, since August 2004. She joined this department as an Assistant Professor in August 1998. Prof. Richa received her M.S. and Ph.D. degrees from the School of Computer Science at Carnegie Mellon University, in 1995 and 1998, respectively. She also earned an M.S. degree in Computer Systems from the Graduate School in Engineering (COPPE), and a B.S. degree in Computer Science, both at the Federal University of Rio de Janeiro, Brazil, in 1992 and 1990, respectively. Prof. Richa's main area of research is in network algorithms. Some of the topics Dr. Richa has worked on include packet scheduling, distributed load balancing, packet routing, mobile network clustering and routing protocols, and distributed data tracking. Prof. Richa's data tracking (or name lookup) algorithm has been widely recognized as the first benchmark algorithm for the development of distributed databases in peer-topeer networking, having being references by over 130 academic journal or conference publications to date, and being implemented as part of two of the current leading projects in peer-to-peer networking. Dr. Richa's was the recipient of an NSF CAREER Award in 1999. For a selected list of her publications, CV, and current research projects, please visit http://www.public.asu.edu/aricha . Publisher Copyright: {\textcopyright} 2015 Elsevier B.V.",

year = "2016",

month = jan,

day = "15",

doi = "10.1016/j.comnet.2015.10.023",

language = "English (US)",

volume = "94",

pages = "307--317",

journal = "Computer Networks",

issn = "1389-1286",

publisher = "Elsevier",

}