334 search results - page 57 / 67 » Inapproximability of Survivable Networks |
DSN
2003
IEEE
14 years 1 months ago
2003
IEEE
In a recent paper [2] we have proposed FT-TCP: an architecture that allows a replicated service to survive crashes without breaking its TCP connections. FT-TCP is attractive in pr...
ICNP
2002
IEEE
14 years 1 months ago
2002
IEEE
— This paper describes a novel, ultra-fast heuristic algorithm to address an NP-hard optimization problem. One of its significances is that, for the first time, the paper shows...
TON
2008
13 years 8 months ago
2008
We define and evaluate methods to perform robust network monitoring using trajectory sampling in the presence of report loss. The first challenge is to reconstruct an unambiguous s...
SIROCCO
2004
13 years 10 months ago
2004
A black hole is a harmful host that destroys incoming agents without leaving any observable trace of such a destruction. The black hole search problem is to unambiguously determine...
JSAC
2006
13 years 8 months ago
2006
Abstract--Wireless sensor networks have received a lot of attention recently due to its wide applications. An accurate and synchronized clock time is crucial in many sensor network...