Efficient Recovery from False State in Distributed Routing Algorithms

  • Daniel Gyllstrom
  • Sudarshan Vasudevan
  • Jim Kurose
  • Gerome Miklau
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6091)


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.


Routing Security Recovery Checkpointing Fault Tolerance 


  1. 1.
  2. 2.
  3. 3.
  4. 4.
    Bertsekas, D., Gallager, R.: Data Networks. Prentice-Hall, Inc., Upper Saddle River (1987)Google Scholar
  5. 5.
    Dijkstra, E., Scholten, C.: Termination Detection for Diffusing Computations. Information Processing Letters (11) (1980)Google Scholar
  6. 6.
    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)CrossRefGoogle Scholar
  7. 7.
    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)Google Scholar
  8. 8.
    Garcia-Lunes-Aceves, J.J.: Loop-free Routing using Diffusing Computations. IEEE/ACM Trans. Netw. 1(1), 130–141 (1993)CrossRefGoogle Scholar
  9. 9.
    Gyllstrom, D., Vasudevan, S., Kurose, J., Miklau, G.: Recovery from False State in Distributed Routing Algorithms. Technical Report UM-CS-2010-017Google Scholar
  10. 10.
    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)Google Scholar
  11. 11.
    Jefferson, D.: Virtual Time. ACM Trans. Program. Lang. Syst. 7(3), 404–425 (1985)CrossRefMathSciNetGoogle Scholar
  12. 12.
    Liu, P., Ammann, P., Jajodia, S.: Rewriting Histories: Recovering from Malicious Transactions. Distributed and Parallel Databases 8(1), 7–40 (2000)CrossRefGoogle Scholar
  13. 13.
    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)CrossRefGoogle Scholar
  14. 14.
    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)CrossRefGoogle Scholar
  15. 15.
    Moy, J.: Hitless OSPF Restart. In: Work in progress, Internet Draft (2001)Google Scholar
  16. 16.
    Padmanabhan, V., Simon, D.: Secure Traceroute to Detect Faulty or Malicious Routing. SIGCOMM Comput. Commun. Rev. 33(1), 77–82 (2003)CrossRefGoogle Scholar
  17. 17.
    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)Google Scholar
  18. 18.
    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)Google Scholar
  19. 19.
    Shaikh, A., Dube, R., Varma, A.: Avoiding Instability During Graceful Shutdown of OSPF. Technical report. In: Proc. IEEE INFOCOM (2002)Google Scholar
  20. 20.
    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)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Daniel Gyllstrom
    • 1
  • Sudarshan Vasudevan
    • 1
  • Jim Kurose
    • 1
  • Gerome Miklau
    • 1
  1. 1.Department of Computer ScienceUniversity of Massachusetts Amherst

Personalised recommendations