Results 1  10
of
207,779
Algebraic gossip on Arbitrary Networks
 ArXiv:0901.1444
, 2009
"... Abstract — Consider a network of nodes where each node has a message to communicate to all other nodes. For this communication problem, we analyze a gossip based protocol where coded messages are exchanged. This problem was studied in [4] where a bound to the dissemination time based on the spectral ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
on the spectral properties of the underlying communication graph is provided. Our contribution is a uniform bound that holds for arbitrary networks. I.
An algebraic approach to network coding
 IEEE/ACM TRANSACTIONS ON NETWORKING
, 2003
"... We take a new look at the issue of network capacity. It is shown that network coding is an essential ingredient in achieving the capacity of a network. Building on recent work by Li et al., who examined the network capacity of multicast networks, we extend the network coding framework to arbitrary n ..."
Abstract

Cited by 858 (88 self)
 Add to MetaCart
We take a new look at the issue of network capacity. It is shown that network coding is an essential ingredient in achieving the capacity of a network. Building on recent work by Li et al., who examined the network capacity of multicast networks, we extend the network coding framework to arbitrary
Shortest paths routing in arbitrary networks
 JOURNAL OF ALGORITHMS
, 1999
"... We introduce an online protocol which routes any set of N packets along shortest paths with congestion C and dilation D through an arbitrary network in OC � Ž D � log N. steps, with high probability. This time bound is optimal up to the additive log N, and it has previously only been reached for bo ..."
Abstract

Cited by 12 (2 self)
 Add to MetaCart
We introduce an online protocol which routes any set of N packets along shortest paths with congestion C and dilation D through an arbitrary network in OC � Ž D � log N. steps, with high probability. This time bound is optimal up to the additive log N, and it has previously only been reached
Distributed Packet Switching in Arbitrary Networks
 In Proceedings of the 28th Annual ACM Symposium on Theory of Computing
, 1996
"... In a seminal paper Leighton, Maggs, and Rao consider the packet scheduling problem when a single packet has to traverse each path. They show that there exists a schedule where each packet reaches its destination in O(C + D) steps, where C is the congestion and D is the dilation. The proof relies o ..."
Abstract

Cited by 42 (2 self)
 Add to MetaCart
In a seminal paper Leighton, Maggs, and Rao consider the packet scheduling problem when a single packet has to traverse each path. They show that there exists a schedule where each packet reaches its destination in O(C + D) steps, where C is the congestion and D is the dilation. The proof relies on the Lov'asz Local Lemma, and hence is not algorithmic. In a followup paper Leighton and Maggs use an algorithmic version of the Local Lemma due to Beck to give centralized algorithms for the problem. Leighton, Maggs, and Rao also give a distributed randomized algorithm where all packets reach their destinations with high probability in O(C +D log n) steps. In this paper we develop techniques to guarantee the high probability of delivering packets without resorting to the Lov'asz Local Lemma. We improve the distributed algorithm for problems with relatively high dilation to O(C) + (log n) O(log n) D + poly(log n). We extend the techniques to handle the case of infinite streams of ...
Approximation Algorithms for Data Placement in Arbitrary Networks
, 2001
"... We study approximation algorithms for placing replicated data in arbitrary networks. Consider a network of nodes with individual storage capacities and a metric communication cost function, in which each node periodically issues a request for an object drawn from a collection of uniformlength objec ..."
Abstract

Cited by 84 (4 self)
 Add to MetaCart
We study approximation algorithms for placing replicated data in arbitrary networks. Consider a network of nodes with individual storage capacities and a metric communication cost function, in which each node periodically issues a request for an object drawn from a collection of uniform
Formal Verification of Arbitrary Network Topologies
"... We show how data independence results can be used to generalise an inductive proof from binary to arbitrary branching tree networks. The example used is modelled on the RSVP Resource Reservation Protocol. Of particular interest is the need for a separate lowerlevel induction which is itself closely ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
We show how data independence results can be used to generalise an inductive proof from binary to arbitrary branching tree networks. The example used is modelled on the RSVP Resource Reservation Protocol. Of particular interest is the need for a separate lowerlevel induction which is itself
Dynamic Bayesian Networks: Representation, Inference and Learning
, 2002
"... Modelling sequential data is important in many areas of science and engineering. Hidden Markov models (HMMs) and Kalman filter models (KFMs) are popular for this because they are simple and flexible. For example, HMMs have been used for speech recognition and biosequence analysis, and KFMs have bee ..."
Abstract

Cited by 770 (3 self)
 Add to MetaCart
been used for problems ranging from tracking planes and missiles to predicting the economy. However, HMMs
and KFMs are limited in their “expressive power”. Dynamic Bayesian Networks (DBNs) generalize HMMs by allowing the state space to be represented in factored form, instead of as a single discrete
Fibonacci Heaps and Their Uses in Improved Network optimization algorithms
, 1987
"... In this paper we develop a new data structure for implementing heaps (priority queues). Our structure, Fibonacci heaps (abbreviated Fheaps), extends the binomial queues proposed by Vuillemin and studied further by Brown. Fheaps support arbitrary deletion from an nitem heap in qlogn) amortized tim ..."
Abstract

Cited by 739 (18 self)
 Add to MetaCart
In this paper we develop a new data structure for implementing heaps (priority queues). Our structure, Fibonacci heaps (abbreviated Fheaps), extends the binomial queues proposed by Vuillemin and studied further by Brown. Fheaps support arbitrary deletion from an nitem heap in qlogn) amortized
Results 1  10
of
207,779