Sciweavers

295 search results - page 14 / 59
» A New Node Centroid Algorithm for Bandwidth Minimization
Sort
View
CCS
2010
ACM
14 years 10 months ago
Recruiting new tor relays with BRAIDS
Tor, a distributed Internet anonymizing system, relies on volunteers who run dedicated relays. Other than altruism, these volunteers have no incentive to run relays, causing a lar...
Rob Jansen, Nicholas Hopper, Yongdae Kim
74
Voted
ICASSP
2010
IEEE
14 years 10 months ago
A general formalism for the analysis of distributed algorithms
The major contribution of this paper is the presentation of a general unifying description of distributed algorithms allowing to map local, node-based, algorithms onto a single gl...
Ondrej Sluciak, Thibault Hilaire, Markus Rupp
ICC
2007
IEEE
146views Communications» more  ICC 2007»
15 years 4 months ago
A Delay-Constrained Shared Mesh Restoration Scheme
—We present a multi-constrained routing algorithm, called Delay-constrained Pool Sharing (DPS), in a survivable mesh network. The goal of this algorithm is to find a pair of link...
Hassan Naser, Ming Gong
VLSISP
2002
112views more  VLSISP 2002»
14 years 9 months ago
Minimizing Buffer Requirements under Rate-Optimal Schedule in Regular Dataflow Networks
Large-grain synchronous dataflow graphs or multi-rate graphs have the distinct feature that the nodes of the dataflow graph fire at different rates. Such multi-rate large-grain dat...
Ramaswamy Govindarajan, Guang R. Gao, Palash Desai
ICDCS
2007
IEEE
15 years 4 months ago
AVMON: Optimal and Scalable Discovery of Consistent Availability Monitoring Overlays for Distributed Systems
This paper addresses the problem of selection and discovery of a consistent availability monitoring overlay for computer hosts in a large-scale distributed application, where host...
Ramsés Morales, Indranil Gupta