Name
Abstract | ||
|---|---|---|
From the publish-subscribe systems of the early days of the Internet to the recent emergence of Web 3.0 and IoT (Internet of Things), new problems arise in the design of networks centered at producers and consumers of constantly evolving information. In a typical problem, each terminal is a source or sink of information and builds a physical network in the form of a tree or an overlay network in the form of a star rooted at itself. Every pair of pub-sub terminals that need to be coordinated (e.g. the source and sink of an important piece of control information) define an edge in a bipartite demand graph; the solution must ensure that the corresponding networks rooted at the endpoints of each demand edge overlap at some node. This simple overlap constraint, and the requirement that each network is a tree or a star, leads to a variety of new questions on the design of overlapping networks.In this paper, for the general demand case of the problem, we show that a natural LP formulation has a non-constant integrality gap; on the positive side, we present a logarithmic approximation for the general demand case. When the demand graph is complete, however, we design approximation algorithms with small constant performance ratios, irrespective of whether the pub networks and sub networks are required to be trees or stars. |
Year | Venue | Field |
|---|---|---|
2015 | APPROX-RANDOM | Publication,Approximation algorithm,Physical network,Bipartite graph,Logarithm,Overlay network,A* search algorithm,Mathematics,The Internet,Distributed computing |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
9 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jennifer Iglesias | 1 | 1 | 1.04 |
| Rajmohan Rajaraman | 2 | 2038 | 250.08 |
| R. Ravi | 3 | 2898 | 275.40 |
| Ravi Sundaram | 4 | 762 | 72.13 |