Sciweavers

270 search results - page 24 / 54
» Fault Detection in Routing Protocols
Sort
View
EUROCRYPT
2003
Springer
14 years 1 months ago
Two-Threshold Broadcast and Detectable Multi-party Computation
Classical distributed protocols like broadcast or multi-party computation provide security as long as the number of malicious players f is bounded by some given threshold t, i.e., ...
Matthias Fitzi, Martin Hirt, Thomas Holenstein, J&...
ADHOC
2007
144views more  ADHOC 2007»
13 years 8 months ago
Adaptive gossip protocols: Managing security and redundancy in dense ad hoc networks
Abstract. Many ad hoc routing algorithms rely on broadcast flooding for location discovery or, more generally, for secure routing applications. Flooding is a robust algorithm but ...
Mike Burmester, Tri Van Le, Alec Yasinsac
DSN
2004
IEEE
13 years 11 months ago
FRTR: A Scalable Mechanism for Global Routing Table Consistency
This paper presents a scalable mechanism, Fast Routing Table Recovery (FRTR), for detecting and correcting route inconsistencies between neighboring BGP routers. The large size of...
Lan Wang, Daniel Massey, Keyur Patel, Lixia Zhang
IFIP
2005
Springer
14 years 1 months ago
Global Internet Routing Forensics: Validation of BGP Paths Using ICMP Traceback
Nearly all network applications rely on the global Internet routing infrastructure to compute routes and deliver packets. Unfortunately, false Internet routes can be maliciously in...
Eunjong Kim, Daniel Massey, Indrajit Ray
DSD
2008
IEEE
147views Hardware» more  DSD 2008»
13 years 9 months ago
A Low-Cost Cache Coherence Verification Method for Snooping Systems
Due to modern technology trends such as decreasing feature sizes and lower voltage levels, fault tolerance is becoming increasingly important in computing systems. Shared memory i...
Demid Borodin, Ben H. H. Juurlink