Efficient recovery from false state in distributed routing algorithms

Authors:
Daniel Gyllstrom;Sudarshan Vasudevan;Jim Kurose;Gerome Miklau
Affiliations:
Department of Computer Science, University of Massachusetts Amherst, MA;Department of Computer Science, University of Massachusetts Amherst, MA;Department of Computer Science, University of Massachusetts Amherst, MA;Department of Computer Science, University of Massachusetts Amherst, MA
Venue:
NETWORKING'10 Proceedings of the 9th IFIP TC 6 international conference on Networking
Year:
2010

Citing 11
Cited 0

Virtual time

ACM Transactions on Programming Languages and Systems (TOPLAS)
Data networks

Data networks
ARIES: a transaction recovery method supporting fine-granularity locking and partial rollbacks using write-ahead logging

ACM Transactions on Database Systems (TODS)
Loop-free routing using diffusing computations

IEEE/ACM Transactions on Networking (TON)
Rewriting Histories: Recovering from Malicious Transactions

Distributed and Parallel Databases - Security of data and transaction processing
Sensor-based intrusion detection for intra-domain distance-vector routing

Proceedings of the 9th ACM conference on Computer and communications security
Secure traceroute to detect faulty or malicious routing

ACM SIGCOMM Computer Communication Review
Securing Distance-Vector Routing Protocols

SNDSS '97 Proceedings of the 1997 Symposium on Network and Distributed System Security
SEAD: Secure Efficient Distance Vector Routing for Mobile Wireless Ad Hoc Networks

WMCSA '02 Proceedings of the Fourth IEEE Workshop on Mobile Computing Systems and Applications
Bayesian detection of router configuration anomalies

Proceedings of the 2005 ACM SIGCOMM workshop on Mining network data
Detecting BGP configuration faults with static analysis

NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2

Quantified Score

Hi-index	0.00

Visualization

Abstract

Malicious and misconfigured nodes can inject incorrect state into a distributed system, which can then be propagated system-wide as a result of normal network operation. Such false state can degrade the performance of a distributed system or render it unusable. For example, in the case of network routing algorithms, false state corresponding to a node incorrectly declaring a cost of 0 to all destinations (maliciously or due to misconfiguration) can quickly spread through the network. This causes other nodes to (incorrectly) route via the misconfigured node, resulting in suboptimal routing and network congestion. We propose three algorithms for efficient recovery in such scenarios and prove the correctness of each of these algorithms. Through simulation, we evaluate our algorithms – in terms of message and time overhead – when applied to removing false state in distance vector routing. Our analysis shows that over topologies where link costs remain fixed and for the same topologies where link costs change, a recovery algorithm based on system-wide checkpoints and a rollback mechanism yields superior performance when using the poison reverse optimization.