Sciweavers

83 search results - page 1 / 17
» Protocols and Lower Bounds for Failure Localization in the I...
Sort
View
EUROCRYPT
2008
Springer
13 years 6 months ago
Protocols and Lower Bounds for Failure Localization in the Internet
Abstract. A secure failure-localization path-quality-monitoring (FLPQM) protocols allows a sender to localize faulty links on a single path through a network to a receiver, even wh...
Boaz Barak, Sharon Goldberg, David Xiao
STOC
1997
ACM
91views Algorithms» more  STOC 1997»
13 years 8 months ago
Lower Bounds for Distributed Coin-Flipping and Randomized Consensus
We examine a class of collective coin- ipping games that arises from randomized distributed algorithms with halting failures. In these games, a sequence of local coin ips is gener...
James Aspnes
CJ
2010
132views more  CJ 2010»
13 years 2 months ago
Internet Failures: an Emergent Sea of Complex Systems and Critical Design Errors?
Complex systems researchers have looked to the Internet as a possible source of interesting emergent behaviour. Indeed, some high profile failures, and some low level phenomena, m...
Jon Crowcroft
ICNP
2005
IEEE
13 years 10 months ago
On Understanding of Transient Interdomain Routing Failures
The convergence time of the interdomain routing protocol, BGP, can last as long as 30 minutes [14,15]. Yet, routing behavior during BGP route convergence is poorly understood. BGP...
Feng Wang, Lixin Gao, Jia Wang, Jian Qiu
FOCS
2008
IEEE
13 years 11 months ago
Lower Bounds for Noisy Wireless Networks using Sampling Algorithms
We show a tight lower bound of Ω(N log log N) on the number of transmissions required to compute several functions (including the parity function and the majority function) in a...
Chinmoy Dutta, Jaikumar Radhakrishnan