Please use this identifier to cite or link to this item:
Title: Parameterized Maximum and Average Degree Approximation in Topic-based Publish-Subscribe Overlay Network Design
Authors: Onus, Melih
Richa, Andrea W.
Keywords: [No Keywords]
Issue Date: 2010
Publisher: IEEE
Source: International Conference on Distributed Computing Systems (ICDCS 2010) -- JUN 21-25, 2010 -- Genova, ITALY
Series/Report no.: IEEE International Conference on Distributed Computing Systems
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 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.
ISBN: 978-0-7695-4059-7
ISSN: 1063-6927
Appears in Collections:Bilgisayar Mühendisliği Bölümü / Department of Computer Engineering
Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection
WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection

Show full item record

CORE Recommender


checked on Sep 23, 2022


checked on Sep 24, 2022

Page view(s)

checked on Dec 26, 2022

Google ScholarTM



Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.