Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

SODA
2004
ACM

favoriteEmaildiscussreport

76views Algorithms» more SODA 2004»

Network failure detection and graph connectivity

13 years 5 months ago

Network failure detection and graph connectivity

Download www.cs.cornell.edu

Jon M. Kleinberg, Mark Sandler, Aleksandrs Slivkin

Real-time Traffic

Algorithms | SODA 2004 |

claim paper

Related Content

» Connectivity oracles for failure prone graphs

» Monitoring connectivity in wireless sensor networks

» Measuring the Vulnerability of Interconnection Networks in Embedded Systems

» On lifetimebased node failure and stochastic resilience of decentralized peertopeer networ...

» Fast Recovery From DualLink or SingleNode Failures in IP Networks Using Tunneling

» Practical and robust geographic routing in wireless networks

» On the Devolution of LargeScale Sensor Networks in the Presence of Random Failures

» On the Expected Connection Lifetime and Stochastic Resilience of Wireless MultiHop Network...

» Improving link failure detection and response in IEEE 80211 wireless ad hoc networks

Post Info
More Details (n/a)

Added	31 Oct 2010
Updated	31 Oct 2010
Type	Conference
Year	2004
Where	SODA
Authors	Jon M. Kleinberg, Mark Sandler, Aleksandrs Slivkins

Comments (0)