Sciweavers

661 search results - page 83 / 133
» On Distributed Computation in Noisy Random Planar Networks
Sort
View
PODC
2005
ACM
15 years 3 months ago
Routing complexity of faulty networks
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
Omer Angel, Itai Benjamini, Eran Ofek, Udi Wieder
IPPS
2008
IEEE
15 years 4 months ago
On performance bottleneck of anonymous communication networks
Although a significant amount of effort has been directed at discovering attacks against anonymity communication networks and developing countermeasures to those attacks, there i...
Ryan Pries, Wei Yu, Steve Graham, Xinwen Fu
TLDI
2009
ACM
155views Formal Methods» more  TLDI 2009»
15 years 6 months ago
Opis: reliable distributed systems in OCaml
The importance of distributed systems is growing as computing devices become ubiquitous and bandwidth becomes plentiful. Concurrency and distribution pose algorithmic and implemen...
Pierre-Évariste Dagand, Dejan Kostic, Vikto...
ICPADS
2005
IEEE
15 years 3 months ago
On the Connectedness of Peer-to-Peer Overlay Networks
Peer-to-Peer (P2P) applications typically use overlay networks to forward the content queries. However, due to the distributed fashion of the overlay establishment, the overlay ne...
Weisheng Si, MingChu Li
ICPPW
2002
IEEE
15 years 2 months ago
Statistical Analysis of Connectivity in Unidirectional Ad Hoc Networks
A unidirectional link exists in an ad-hoc network when a node B is within the transmission range of another node A while node A cannot directly hear node B. However, a reverse rou...
Venugopalan Ramasubramanian, Daniel Mossé