Topology-Aware Replica Placement in Fault-Tolerant Embedded Networks

  • Thilo Streichert
  • Michael Glaß
  • Rolf Wanka
  • Christian Haubelt
  • Jürgen Teich
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4934)


Application details uncertain at design time as well as tolerance against permanent resource defects demand flexibility and redundancy. In this context, we present a strategy for placing replicas in embedded point-to-point networks where link as well as node defects may occur at runtime. The proposed strategies for replica placement are based on the partitioning of the network into biconnected components. We are able to distinguish between different replication strategies, i.e., active and passive replication. Our experimental results show that the reliability improvement due to the proposed replica placement strategies is up to 23% compared to a randomized strategy.


Network Node Computational Load Topology Graph Mapping Edge Active Replication 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Adya, A., Bolosky, W.J., Castro, M.: FARSITE: Federate, Available, and Reliable Storage for an Inclomplete Trusted Environment. In: Proceedings of the OSDI (2002)Google Scholar
  2. 2.
    Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading (1974)zbMATHGoogle Scholar
  3. 3.
    Cuenca-Acuna, F.M., Martin, R.P., Nguyen, T.D.: Autonomous Replication for High Availability in Unstructured P2P Systems. In: 22nd IEEE International Symposium on Reliable Distributed Systems (2003)Google Scholar
  4. 4.
    Douceur, J.R., Wattenhofer, R.: Competitive Hill-Climbing Strategies for Replica Placement in a Distributed File System. In: Welch, J.L. (ed.) DISC 2001. LNCS, vol. 2180, pp. 48–62. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  5. 5.
    Hohberg, W.: How to find biconnected components in distributed networks. J. Parallel Distrib. Comput. 9(4), 374–386 (1990)CrossRefGoogle Scholar
  6. 6.
    Hopcroft, J., Tarjan, R.: Algorithm 447: efficient algorithms for graph manipulation. Commun. ACM 16(6), 372–378 (1973)CrossRefGoogle Scholar
  7. 7.
    Karlsson, M., Karamanolis, C., Mahalingam, M.: A Framework for Evaluating Replica Placement Algorithms. Technical report, HP Labs, HPL-2002-219 (2002)Google Scholar
  8. 8.
    Laprie, J.C.: Dependability: Basic Concepts and Terminology - In English, French, German, and Japanese. Springer, Heidelberg (1992)Google Scholar
  9. 9.
    Lian, Q., Chen, W., Zhang, Z.: On the Impact of Replica Placement to the Reliability of Distributed Brick Storage Systems. In: Proceedings of the 25th IEEE International Conference on Distributed Computing Systems (ICDCS 2005), pp. 187–196. IEEE Computer Society Press, Washington (2005)CrossRefGoogle Scholar
  10. 10.
    Qiu, L., Padmanabhan, V.N., Voelker, G.M.: On the Placement of Web Server Replicas. In: Proc. of the IEEE INFOCOM conference, pp. 1587–1596 (April 2001)Google Scholar
  11. 11.
    Swaminathan, B., Goldman, K.: An Incremental Distributed Algorithm for Computing Biconnected Components in Dynamic Graphs. Algorith. 22(3), 305–329 (1998)zbMATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Szymaniak, M., Pierre, G., van Steen, M.: Latency-Driven Replica Placement. In: Proc. of the Symp. on Applications and the Internet (SAINT 2005) (2005)Google Scholar
  13. 13.
    Westbrok, J., Tarjan, R.E.: Maintaining Bridge-Connected and Biconnected Components On-Line. Algorithmica 7(1), 433–464 (1992)CrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Thilo Streichert
    • 1
  • Michael Glaß
    • 1
  • Rolf Wanka
    • 1
  • Christian Haubelt
    • 1
  • Jürgen Teich
    • 1
  1. 1.Department of Computer Science 12University of Erlangen-NurembergGermany

Personalised recommendations