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.
Chapter PDF
Similar content being viewed by others
References
Google Embarrassed and Apologetic After Crash, http://www.computerweekly.com/Articles/2009/05/15/236060/google-embarrassed-and-apologetic-after-crash.htm
Rocketfuel, http://www.cs.washington.edu/research/networking/rocketfuel/maps/weights/weights-dist.tar.gz
Bertsekas, D., Gallager, R.: Data Networks. Prentice-Hall, Inc., Upper Saddle River (1987)
Dijkstra, E., Scholten, C.: Termination Detection for Diffusing Computations. Information Processing Letters (11) (1980)
El-Arini, K., Killourhy, K.: Bayesian Detection of Router Configuration Anomalies. In: MineNet ’05: Proceedings of the 2005 ACM SIGCOMM workshop on Mining network data, pp. 221–222. ACM, New York (2005)
Feamster, N., Balakrishnan, H.: Detecting BGP Configuration Faults with Static Analysis. In: 2nd Symp. on Networked Systems Design and Implementation (NSDI), Boston, MA (May 2005)
Garcia-Lunes-Aceves, J.J.: Loop-free Routing using Diffusing Computations. IEEE/ACM Trans. Netw. 1(1), 130–141 (1993)
Gyllstrom, D., Vasudevan, S., Kurose, J., Miklau, G.: Recovery from False State in Distributed Routing Algorithms. Technical Report UM-CS-2010-017
Hu, Y.C., Johnson, D.B., Perrig, A.: SEAD: Secure Efficient Distance Vector Routing for Mobile Wireless Ad Hoc Networks. In: Proceedings Fourth IEEE Workshop on Mobile Computing Systems and Applications, pp. 3–13 (2002)
Jefferson, D.: Virtual Time. ACM Trans. Program. Lang. Syst. 7(3), 404–425 (1985)
Liu, P., Ammann, P., Jajodia, S.: Rewriting Histories: Recovering from Malicious Transactions. Distributed and Parallel Databases 8(1), 7–40 (2000)
Mittal, V., Vigna, G.: Sensor-Based Intrusion Detection for Intra-domain Distance-vector Routing. In: CCS 2002: Proceedings of the 9th ACM Conf. on Comp. and Communications Security, pp. 127–137. ACM, New York (2002)
Mohan, C., Haderle, D., Lindsay, B., Pirahesh, H., Schwarz, P.: ARIES: A Transaction Recovery Method Supporting Fine-Granularity Locking and Partial Rollbacks Using Write-Ahead Logging. ACM Trans. Database Syst. 17(1), 94–162 (1992)
Moy, J.: Hitless OSPF Restart. In: Work in progress, Internet Draft (2001)
Padmanabhan, V., Simon, D.: Secure Traceroute to Detect Faulty or Malicious Routing. SIGCOMM Comput. Commun. Rev. 33(1), 77–82 (2003)
Pei, D., Massey, D., Zhang, L.: Detection of Invalid Routing Announcements in RIP Protocol. In: Global Telecommunications Conference, GLOBECOM ’03, December 2003, vol. 3, pp. 1450–1455. IEEE, Los Alamitos (2003)
School, K., Westhoff, D.: Context Aware Detection of Selfish Nodes in DSR based Ad-hoc Networks. In: Proc. of IEEE GLOBECOM, pp. 178–182 (2002)
Shaikh, A., Dube, R., Varma, A.: Avoiding Instability During Graceful Shutdown of OSPF. Technical report. In: Proc. IEEE INFOCOM (2002)
Smith, B., Murthy, S., Garcia-Luna-Aceves, J.J.: Securing Distance-vector Routing Protocols. In: Symposium on Network and Distributed System Security, p. 85 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gyllstrom, D., Vasudevan, S., Kurose, J., Miklau, G. (2010). Efficient Recovery from False State in Distributed Routing Algorithms. In: Crovella, M., Feeney, L.M., Rubenstein, D., Raghavan, S.V. (eds) NETWORKING 2010. NETWORKING 2010. Lecture Notes in Computer Science, vol 6091. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12963-6_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-12963-6_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-12962-9
Online ISBN: 978-3-642-12963-6
eBook Packages: Computer ScienceComputer Science (R0)