메뉴 건너뛰기




Volumn 19, Issue 2, 2006, Pages 149-161

An efficient fault-containing self-stabilizing algorithm for the shortest path problem

Author keywords

Fault containment; Self stabilizing algorithm; Shortest path problem; Single fault situation; Stabilization time

Indexed keywords

ALGORITHMS; FAULT TOLERANT COMPUTER SYSTEMS; INFORMATION THEORY; STABILIZATION;

EID: 33750550861     PISSN: 01782770     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00446-006-0001-1     Document Type: Article
Times cited : (5)

References (22)
  • 4
    • 0011540529 scopus 로고
    • A self-stabilizing algorithm for all-pairs shortest path tree problem
    • Chandrasekar, S., Srimani, P.K.: A self-stabilizing algorithm for all-pairs shortest path tree problem. Parallel Algorithm Appl. 4(1/2), 125-137 (1994)
    • (1994) Parallel Algorithm Appl. , vol.4 , Issue.1-2 , pp. 125-137
    • Chandrasekar, S.1    Srimani, P.K.2
  • 5
    • 84976834622 scopus 로고
    • Self-stabilizing systems in spite of distributed control
    • Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control. Comm. ACM 17(11), 643-644 (1974)
    • (1974) Comm. ACM , vol.17 , Issue.11 , pp. 643-644
    • Dijkstra, E.W.1
  • 6
    • 0002728519 scopus 로고
    • Self-stabilizing systems in spite of distributed control (EWD391)
    • Reprinted in: Springer, New York Berlin Heidelberg
    • Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control (EWD391). Reprinted in: Selected Writing on Computing: A Personal Perspective, pp. 41-46. Springer, New York Berlin Heidelberg (1982)
    • (1982) Selected Writing on Computing: A Personal Perspective , pp. 41-46
    • Dijkstra, E.W.1
  • 7
    • 0022582906 scopus 로고
    • A belated proof of self-stabilization
    • Dijkstra, E.W.: A belated proof of self-stabilization. Distributed Comput. 1(1), 5-6 (1986)
    • (1986) Distributed Comput. , vol.1 , Issue.1 , pp. 5-6
    • Dijkstra, E.W.1
  • 8
    • 0002676195 scopus 로고
    • Self-stabilization of dynamic systems assuming only read/write atomicity
    • Dolev, S., Israeli, A., Moran, S.: Self-stabilization of dynamic systems assuming only read/write atomicity. Distributed Comput. 7(1), 3-16 (1993)
    • (1993) Distributed Comput. , vol.7 , Issue.1 , pp. 3-16
    • Dolev, S.1    Israeli, A.2    Moran, S.3
  • 9
    • 0002790058 scopus 로고    scopus 로고
    • An exercise in fault-containment: Self-stabilizing leader election
    • Ghosh, S., Gupta, A.: An exercise in fault-containment: self-stabilizing leader election. Inf. Process. Lett. 59, 281-288 (1996)
    • (1996) Inf. Process. Lett. , vol.59 , pp. 281-288
    • Ghosh, S.1    Gupta, A.2
  • 12
    • 0010276366 scopus 로고    scopus 로고
    • A fault-containing self-stabilizing spanning tree algorithm
    • Ghosh, S., Gupta, A., Pemmaraju, S.V.: A fault-containing self-stabilizing spanning tree algorithm. J. Comput. Inf. 2(1), 322-338 (1996)
    • (1996) J. Comput. Inf. , vol.2 , Issue.1 , pp. 322-338
    • Ghosh, S.1    Gupta, A.2    Pemmaraju, S.V.3
  • 15
    • 26444487578 scopus 로고    scopus 로고
    • A self-stabilizing algorithm for the shortest path problem assuming the distributed demon
    • Huang, T.C.: A self-stabilizing algorithm for the shortest path problem assuming the distributed demon. Comput. Math. Appl. 50, 671-681 (2005)
    • (2005) Comput. Math. Appl. , vol.50 , pp. 671-681
    • Huang, T.C.1
  • 16
    • 18444414885 scopus 로고    scopus 로고
    • A self-stabilizing algorithm for the shortest path problem assuming read/write atomicity
    • Huang, T.C.: A self-stabilizing algorithm for the shortest path problem assuming read/write atomicity. J. Comput. Syst. Sci. 71, 70-85 (2005)
    • (2005) J. Comput. Syst. Sci. , vol.71 , pp. 70-85
    • Huang, T.C.1
  • 17
    • 33750550936 scopus 로고    scopus 로고
    • An efficient fault-containing self-stabilizing algorithm for the shortest path problem
    • Taiwan
    • Huang, T.C.: An efficient fault-containing self-stabilizing algorithm for the shortest path problem. National Computer Symposium (NCS), Taiwan (2005)
    • (2005) National Computer Symposium (NCS)
    • Huang, T.C.1
  • 18
    • 0026817621 scopus 로고
    • A self-stabilizing algorithm for constructing breadth-first trees
    • Huang, S.T., Chen, N.S.: A self-stabilizing algorithm for constructing breadth-first trees. Inf. Process. Lett. 41, 107-117 (1992)
    • (1992) Inf. Process. Lett. , vol.41 , pp. 107-117
    • Huang, S.T.1    Chen, N.S.2
  • 19
    • 0036141574 scopus 로고    scopus 로고
    • A self-stabilizing algorithm for the shortest path problem in a distributed system
    • Huang, T.C., Lin, J.C.: A self-stabilizing algorithm for the shortest path problem in a distributed system. Comput. Math. Appl. 43, 103-109 (2002)
    • (2002) Comput. Math. Appl. , vol.43 , pp. 103-109
    • Huang, T.C.1    Lin, J.C.2
  • 21
    • 0141613209 scopus 로고    scopus 로고
    • An efficient fault-containing self-stabilizing algorithm for finding a maximal independent set
    • Lin, J.C., Huang, T.C.: An efficient fault-containing self-stabilizing algorithm for finding a maximal independent set. IEEE Trans. Parallel Distributed Syst. 14(8), 742-754 (2003)
    • (2003) IEEE Trans. Parallel Distributed Syst. , vol.14 , Issue.8 , pp. 742-754
    • Lin, J.C.1    Huang, T.C.2


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