PODC 2006 | Sciweavers

47

PODC
2006
ACM

142views Distributed And Parallel Com...» more PODC 2006»

Sketching asynchronous streams over a sliding window

14 years 6 months ago

We study the problem of maintaining sketches of recent elements of a data stream. Motivated by applications involving network data, we consider streams that are asynchronous, in w...

Srikanta Tirthapura, Bojian Xu, Costas Busch

claim paper

Read More »

42

click to vote

PODC
2006
ACM

172views Distributed And Parallel Com...» more PODC 2006»

Computing separable functions via gossip

14 years 6 months ago

Download web.mit.edu

Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...

Damon Mosk-Aoyama, Devavrat Shah

claim paper

Read More »

28

click to vote

PODC
2006
ACM

90views Distributed And Parallel Com...» more PODC 2006»

Peer counting and sampling in overlay networks: random walk methods

14 years 6 months ago

Download www.irisa.fr

Laurent Massoulié, Erwan Le Merrer, Anne-Ma...

claim paper

Read More »

37

click to vote

PODC
2006
ACM

134views Distributed And Parallel Com...» more PODC 2006»

On the complexity of distributed graph coloring

14 years 6 months ago

Download www.dcg.ethz.ch

Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...

Fabian Kuhn, Roger Wattenhofer

claim paper

Read More »

27

click to vote

PODC
2006
ACM

99views Distributed And Parallel Com...» more PODC 2006»

Reliable broadcast in radio networks: the bounded collision case

14 years 6 months ago

Download www.crhc.illinois.edu

Chiu-Yuen Koo, Vartika Bhandari, Jonathan Katz, Ni...

claim paper

Read More »

52

click to vote

PODC
2006
ACM

133views Distributed And Parallel Com...» more PODC 2006»

Optimal-stretch name-independent compact routing in doubling metrics

14 years 6 months ago

Download www.public.asu.edu

We consider the problem of name-independent routing in doubling metrics. A doubling metric is a metric space whose doubling dimension is a constant, where the doubling dimension o...

Goran Konjevod, Andréa W. Richa, Donglin Xi...

claim paper

Read More »

30

click to vote

PODC
2006
ACM

113views Distributed And Parallel Com...» more PODC 2006»

Timeliness, failure-detectors, and consensus performance

14 years 6 months ago

Download webee.technion.ac.il

We study the implication that various timeliness and failure detector assumptions have on the performance of consensus algorithms that exploit them. We present a general framework...

Idit Keidar, Alexander Shraer

claim paper

Read More »

33

click to vote

PODC
2006
ACM

120views Distributed And Parallel Com...» more PODC 2006»

The art of multiprocessor programming

14 years 6 months ago

Download www.cs.tau.ac.il

Maurice Herlihy

claim paper

Read More »

42

click to vote

PODC
2006
ACM

98views Distributed And Parallel Com...» more PODC 2006»

Quorum placement in networks: minimizing network congestion

14 years 6 months ago

Download www.cs.cmu.edu

A quorum system over a universe of logical elements is a collection of subsets (quorums) of elements, any two of which intersect. In numerous distributed algorithms, the elements ...

Daniel Golovin, Anupam Gupta, Bruce M. Maggs, Flor...

claim paper

Read More »

30

click to vote

PODC
2006
ACM

96views Distributed And Parallel Com...» more PODC 2006»

An O(1) RMRs leader election algorithm

14 years 6 months ago