메뉴 건너뛰기




Volumn 2006, Issue , 2006, Pages

A self-stabilizing minimal dominating set algorithm with safe convergence

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; DATA TRANSFER; FAULT TOLERANT COMPUTER SYSTEMS; SECURITY OF DATA; STORAGE ALLOCATION (COMPUTER);

EID: 33847139130     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2006.1639550     Document Type: Conference Paper
Times cited : (46)

References (14)
  • 2
    • 84976834622 scopus 로고
    • Self-stabilizing systems in spite of distributed control
    • E. Dijkstra. Self-stabilizing systems in spite of distributed control. Commun. ACM, 17(11):643-644, 1974.
    • (1974) Commun. ACM , vol.17 , Issue.11 , pp. 643-644
    • Dijkstra, E.1
  • 3
    • 0003270746 scopus 로고    scopus 로고
    • Superstabilizing protocols for dynamic distributed systems
    • S. Dolev and T. Herman. Superstabilizing protocols for dynamic distributed systems. Chicago J. of Theoretical Comput. Sci., 3(4), 1997.
    • (1997) Chicago J. of Theoretical Comput. Sci , vol.3 , Issue.4
    • Dolev, S.1    Herman, T.2
  • 4
    • 0345415768 scopus 로고    scopus 로고
    • Fundamentals of fault-tolerant distributed computing in asynchronous environments
    • F. Gärtner. Fundamentals of fault-tolerant distributed computing in asynchronous environments. ACM Comput. Surv., 31:1-26, 1999.
    • (1999) ACM Comput. Surv , vol.31 , pp. 1-26
    • Gärtner, F.1
  • 5
    • 33847143235 scopus 로고    scopus 로고
    • A framework of safe stabilization
    • S. Ghosh and A. Bejan. A framework of safe stabilization. In Proceedings of SSS, LNCS 2704, pages 129-140, 2003.
    • (2003) Proceedings of SSS, LNCS , vol.2704 , pp. 129-140
    • Ghosh, S.1    Bejan, A.2
  • 7
    • 84947286561 scopus 로고    scopus 로고
    • Self-stabilizing protocols for maximal matching and maximal independent sets for ad hoc networks
    • W. Goddard, S. T. Hedetniemi, D. P. Jacobs, and P. K. Srimani. Self-stabilizing protocols for maximal matching and maximal independent sets for ad hoc networks. In Proceedings of IPDPS APDCM, page 162b, 2003.
    • (2003) Proceedings of IPDPS APDCM
    • Goddard, W.1    Hedetniemi, S.T.2    Jacobs, D.P.3    Srimani, P.K.4
  • 9
    • 85033333176 scopus 로고    scopus 로고
    • M. Gouda and M. Schneider. Maximum flow routing. In Proceedings of WSS, pages 2.1-2.13, 1995.
    • M. Gouda and M. Schneider. Maximum flow routing. In Proceedings of WSS, pages 2.1-2.13, 1995.
  • 11
    • 26444605636 scopus 로고    scopus 로고
    • A spaceoptimal self-stabilizing algorithm for the maximal independent set problem
    • M. Ikeda, S. Kamei, and H. Kakugawa. A spaceoptimal self-stabilizing algorithm for the maximal independent set problem. In Proceedings of PDCAT, pages 70-74, 2002.
    • (2002) Proceedings of PDCAT , pp. 70-74
    • Ikeda, M.1    Kamei, S.2    Kakugawa, H.3
  • 12
    • 33847107191 scopus 로고    scopus 로고
    • Route preserving stabilization
    • C. Johnen and S. Tixeuil. Route preserving stabilization. In Proceedings of SSS, LNCS 2704, pages 184-198, 2003.
    • (2003) Proceedings of SSS, LNCS , vol.2704 , pp. 184-198
    • Johnen, C.1    Tixeuil, S.2
  • 13
    • 0009049854 scopus 로고
    • Observation on self-stabilizing graph algorithms for anonymous networks
    • S. Shukla, D. Rosenkrantz, and S. Ravi. Observation on self-stabilizing graph algorithms for anonymous networks. Proceedings of WSS, 1995.
    • (1995) Proceedings of WSS
    • Shukla, S.1    Rosenkrantz, D.2    Ravi, S.3
  • 14
    • 35048870092 scopus 로고    scopus 로고
    • A synchronous self-stabilizing minimal domination protocol in an arbitrary network graph
    • Z. Xu, S. T. Hedetniemi, W. Goddard, and P. K. Srimani. A synchronous self-stabilizing minimal domination protocol in an arbitrary network graph. In Proceedings of IWDC, LNCS 2918, pages 26-32, 2003.
    • (2003) Proceedings of IWDC, LNCS , vol.2918 , pp. 26-32
    • Xu, Z.1    Hedetniemi, S.T.2    Goddard, W.3    Srimani, P.K.4


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