Results 1  10
of
121
An Efficient Distributed Algorithm for Constructing Small Dominating Sets
, 2001
"... The dominating set problem asks for a small subset D of nodes in a graph such that every node is either in D or adjacent to a node in D. This problem arises in a number of distributed network applications, where it is important to locate a small number of centers in the network such that every node ..."
Abstract

Cited by 98 (1 self)
 Add to MetaCart
The dominating set problem asks for a small subset D of nodes in a graph such that every node is either in D or adjacent to a node in D. This problem arises in a number of distributed network applications, where it is important to locate a small number of centers in the network such that every node is nearby at least one center. Finding a dominating set of minimum size is NPcomplete, and the best known approximation is logarithmic in the maximum degree of the graph and is provided by the same simple greedy approach that gives the wellknown logarithmic approximation result for the closely related set cover problem.
A sublinear time distributed algorithm for minimumweight spanning trees
 SIAM J. Comput
, 1998
"... (Extended Abstract) ..."
SybilInfer: Detecting Sybil Nodes using Social Networks
"... SybilInfer is an algorithm for labelling nodes in a social network as honest users or Sybils controlled by an adversary. At the heart of SybilInfer lies a probabilistic model of honest social networks, and an inference engine that returns potential regions of dishonest nodes. The Bayesian inference ..."
Abstract

Cited by 66 (5 self)
 Add to MetaCart
SybilInfer is an algorithm for labelling nodes in a social network as honest users or Sybils controlled by an adversary. At the heart of SybilInfer lies a probabilistic model of honest social networks, and an inference engine that returns potential regions of dishonest nodes. The Bayesian inference approach to Sybil detection comes with the advantage label has an assigned probability, indicating its degree of certainty. We prove through analytical results as well as experiments on simulated and realworld network topologies that, given standard constraints on the adversary, SybilInfer is secure, in that it successfully distinguishes between honest and dishonest nodes and is not susceptible to manipulation by the adversary. Furthermore, our results show that SybilInfer outperforms state of the art algorithms, both in being more widely applicable, as well as providing vastly more accurate results. 1
Fast Distributed Construction of Small kDominating Sets and Applications
, 2000
"... This paper presents a fast distributed algorithm to compute a small kdominating set D (for any xed k) and its induced graph partition (breaking the graph into radius k clusters centered around the vertices of D). The time complexity of the algorithm is O(k log n). ..."
Abstract

Cited by 48 (7 self)
 Add to MetaCart
This paper presents a fast distributed algorithm to compute a small kdominating set D (for any xed k) and its induced graph partition (breaking the graph into radius k clusters centered around the vertices of D). The time complexity of the algorithm is O(k log n).
Overlay Mesh Construction Using Interleaved Spanning Trees
 in Proc. of INFOCOM
, 2004
"... In this paper we evaluate a method of using interleaved spanning trees to compose a resilient, high performance overlay mesh. Though spanning trees of arbitrary type could be used to construct an overlay mesh, we focus on a distributed algorithm that computes k minimum spanning trees on an arbitrary ..."
Abstract

Cited by 45 (1 self)
 Add to MetaCart
(Show Context)
In this paper we evaluate a method of using interleaved spanning trees to compose a resilient, high performance overlay mesh. Though spanning trees of arbitrary type could be used to construct an overlay mesh, we focus on a distributed algorithm that computes k minimum spanning trees on an arbitrary graph. The principal motivation behind this strategy is to provide applications with a kredundant, high quality mesh suitable for demanding applications like A/V broadcast, video conferencing, data collection, multipath routing, and file mirroring/transfer. We elaborate details of kMST, pointing out advantages and potential problem points of the protocol, and then analyze its performance using a variety of metrics with simulation as well as a functional PlanetLab implementation.
A neartight lower bound on the time complexity of distributed MST construction
 SIAM J. Comput
, 1999
"... Abstract. This paper presents a lower boundof Ω(D + √ n / log n) on the time requiredfor the distributed construction of a minimumweight spanning tree (MST) in weighted nvertex networks of diameter D = Ω(log n), in the bounded message model. This establishes the asymptotic nearoptimality of existi ..."
Abstract

Cited by 44 (5 self)
 Add to MetaCart
(Show Context)
Abstract. This paper presents a lower boundof Ω(D + √ n / log n) on the time requiredfor the distributed construction of a minimumweight spanning tree (MST) in weighted nvertex networks of diameter D = Ω(log n), in the bounded message model. This establishes the asymptotic nearoptimality of existing timeefficient distributed algorithms for the problem, whose complexity is O(D + √ n log ∗ n).
Spine Routing in Ad Hoc Networks
 ACM/Baltzer Cluster Computing Journal (special issue on Mobile Computing
, 1998
"... this paper are: (a) how to build and maintain the spine, (b) what network topology information to collect in the spine, and (c) how to compute routes once the information is aggregated in the spine nodes. This infrastructure is specifically built to address the dynamics of the network topology, scar ..."
Abstract

Cited by 40 (4 self)
 Add to MetaCart
(Show Context)
this paper are: (a) how to build and maintain the spine, (b) what network topology information to collect in the spine, and (c) how to compute routes once the information is aggregated in the spine nodes. This infrastructure is specifically built to address the dynamics of the network topology, scarcity of the shared resources, and the nature of applications that may typically run in such adhoc networking environments. We address the following goals in this paper:
Distributed MST for Constant Diameter Graphs
 In Proceedings of the 20th Annual ACM Symposium on Principles of Distributed Computing
, 2001
"... This paper considers the problem of distributively constructing a minimumweight spanning tree (MST) for thatÇÐÓ�Ò graphs of constant diameter in the boundedmessages model, where each message can contain at most�bits for some parameter�. It is shown that the time required to compute an MST for grap ..."
Abstract

Cited by 25 (6 self)
 Add to MetaCart
This paper considers the problem of distributively constructing a minimumweight spanning tree (MST) for thatÇÐÓ�Ò graphs of constant diameter in the boundedmessages model, where each message can contain at most�bits for some parameter�. It is shown that the time required to compute an MST for graphs of diameter�or can be as high asªÔÒ��andª�ÔÒ�Ô�, respectively. The lower bound holds even if the algorithm is allowed to be randomized. On the other hand, it is shown time units suffice to compute an MST deterministically for graphs with diameter, when��ÇÐÓ�Ò. These results complement a previously known lower bound of ªÔÒ��for graphs of diameterªÐÓ�Ò. 1
Optimal Distributed Algorithm for Minimum Spanning Trees Revisited
 in Proceedings of the 14th Annual ACM Symposium on Principles of Distributed Computing
, 1995
"... In an earlier paper, Awerbuch presented an innovative distributed algorithm for solving minimum spanning tree (MST) problems that achieved optimal time and message complexity through the introduction of several advanced features. In this paper, we show that there are some cases where his algorithm ..."
Abstract

Cited by 24 (3 self)
 Add to MetaCart
(Show Context)
In an earlier paper, Awerbuch presented an innovative distributed algorithm for solving minimum spanning tree (MST) problems that achieved optimal time and message complexity through the introduction of several advanced features. In this paper, we show that there are some cases where his algorithm can create cycles or fail to achieve optimal time complexity. We then show how to modify the algorithm to avoid these problems, and demonstrate both the correctness and optimality of the revised algorithm. 1 Introduction Given an undirected graph G with N nodes and E edges, with weights assigned to each edge, we want to find a spanning tree for which the combined weight of all its edges is minimized, denoted an MST in the sequel. Furthermore, we want to use a distributed algorithm to find that MST by placing a processor at each node and treating each edge as a bidirectional and errorfree communication channel, over which the nodes can exchange messages among themselves. We assume that ini...
A fast distributed approximation algorithm for minimum spanning trees
 IN PROCEEDINGS OF THE 20TH INTERNATIONAL SYMPOSIUM ON DISTRIBUTED COMPUTING (DISC
, 2006
"... We present a distributed algorithm that constructs an O(log n)approximate minimum spanning tree (MST) in any arbitrary network. This algorithm runs in time Õ(D(G) + L(G, w)) where L(G, w) is a parameter called the local shortest path diameter and D(G) is the (unweighted) diameter of the graph. Our ..."
Abstract

Cited by 24 (7 self)
 Add to MetaCart
We present a distributed algorithm that constructs an O(log n)approximate minimum spanning tree (MST) in any arbitrary network. This algorithm runs in time Õ(D(G) + L(G, w)) where L(G, w) is a parameter called the local shortest path diameter and D(G) is the (unweighted) diameter of the graph. Our algorithm is existentially optimal (up to polylogarithmic factors), i.e., there exists graphs which need Ω(D(G) + L(G, w)) time to compute an Happroximation to the MST for any H ∈ [1, Θ(log n)]. Our result also shows that there can be a significant time gap between exact and approximate MST computation: there exists graphs in which the running time of our approximation algorithm is exponentially faster than the timeoptimal distributed algorithm that computes the MST. Finally, we show that our algorithm can be used to find an approximate MST in wireless networks and in random weighted networks in almost optimal Õ(D(G)) time.