메뉴 건너뛰기




Volumn 4934 LNCS, Issue , 2008, Pages 23-37

Topology-aware replica placement in fault-tolerant embedded networks

Author keywords

[No Author keywords available]

Indexed keywords

BICONNECTED COMPONENTS; COMPUTING SYSTEMS; DESIGN TIME; EMBEDDED NETWORKS; FAULT-TOLERANT; INTERNATIONAL CONFERENCES; POINT-TO-POINT NETWORKS; RANDOMIZED STRATEGIES; RELIABILITY IMPROVEMENT; REPLICA PLACEMENT; REPLICATION STRATEGIES; RUN-TIME;

EID: 49949097312     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-78153-0_4     Document Type: Conference Paper
Times cited : (5)

References (13)
  • 1
    • 19944426523 scopus 로고    scopus 로고
    • FARSITE: Federate, Available, and Reliable Storage for an Inclomplete Trusted Environment
    • Adya, A., Bolosky, W.J., Castro, M.: FARSITE: Federate, Available, and Reliable Storage for an Inclomplete Trusted Environment. In: Proceedings of the OSDI (2002)
    • (2002) Proceedings of the OSDI
    • Adya, A.1    Bolosky, W.J.2    Castro, M.3
  • 4
    • 84956993049 scopus 로고    scopus 로고
    • 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, 2180, pp. 48-62. Springer, Heidelberg (2001)
    • 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)
  • 5
    • 45149136362 scopus 로고
    • How to find biconnected components in distributed networks
    • Hohberg, W.: How to find biconnected components in distributed networks. J. Parallel Distrib. Comput. 9(4), 374-386 (1990)
    • (1990) J. Parallel Distrib. Comput , vol.9 , Issue.4 , pp. 374-386
    • Hohberg, W.1
  • 6
    • 84976669902 scopus 로고
    • Algorithm 447: Efficient algorithms for graph manipulation
    • Hopcroft, J., Tarjan, R.: Algorithm 447: efficient algorithms for graph manipulation. Commun. ACM 16(6), 372-378 (1973)
    • (1973) Commun. ACM , vol.16 , Issue.6 , pp. 372-378
    • Hopcroft, J.1    Tarjan, R.2
  • 7
    • 0242419358 scopus 로고    scopus 로고
    • A Framework for Evaluating Replica Placement Algorithms
    • Technical report, HP Labs, HPL-2002-219
    • Karlsson, M., Karamanolis, C., Mahalingam, M.: A Framework for Evaluating Replica Placement Algorithms. Technical report, HP Labs, HPL-2002-219 (2002)
    • (2002)
    • Karlsson, M.1    Karamanolis, C.2    Mahalingam, M.3
  • 11
    • 0009630205 scopus 로고    scopus 로고
    • An Incremental Distributed Algorithm for Computing Biconnected Components in Dynamic Graphs
    • Swaminathan, B., Goldman, K.: An Incremental Distributed Algorithm for Computing Biconnected Components in Dynamic Graphs. Algorith. 22(3), 305-329 (1998)
    • (1998) Algorith , vol.22 , Issue.3 , pp. 305-329
    • Swaminathan, B.1    Goldman, K.2
  • 13
    • 0026626071 scopus 로고
    • Maintaining Bridge-Connected and Biconnected Components On-Line
    • Westbrok, J., Tarjan, R.E.: Maintaining Bridge-Connected and Biconnected Components On-Line. Algorithmica 7(1), 433-464 (1992)
    • (1992) Algorithmica , vol.7 , Issue.1 , pp. 433-464
    • Westbrok, J.1    Tarjan, R.E.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.