메뉴 건너뛰기
Journal of Supercomputing
Volumn 45, Issue 2, 2008, Pages 173-184
On conditional diagnosability and reliability of the BC networks
Author keywords

BC networks; Conditional diagnosability; PMC model; Super connectivity
Indexed keywords

COMPUTER NETWORKS; NETWORK PROTOCOLS;
EID: 45849128341     PISSN: 09208542     EISSN: 15730484     Source Type: Journal    
DOI: 10.1007/s11227-007-0167-8     Document Type: Article
Times cited : (130)
References (12)
  • 1
    • 0002275818 scopus 로고
    • Connectivity extremal problems and the design of reliable probabilistic networks
    • Wiley New York
    • Bauer D, Boesch F, Suffel C, Tindell R (1981) Connectivity extremal problems and the design of reliable probabilistic networks. In: The theory and application of graphs. Wiley, New York, pp 45-54
    • (1981) The Theory and Application of Graphs , pp. 45-54
    • Bauer, D.1    Boesch, F.2    Suffel, C.3    Tindell, R.4
  • 2
    • 84941474134 scopus 로고
    • Synthesis of reliable networks. A survey
    • Boesch FT (1986) Synthesis of reliable networks. A survey. IEEE Trans Reliab 35:240-246
    • (1986) IEEE Trans Reliab , vol.35 , pp. 240-246
    • Boesch, F.T.1
  • 4
    • 0021445280 scopus 로고
    • 2.5) fault identification algorithm for diagnosable systems
    • 6
    • 2.5) fault identification algorithm for diagnosable systems. IEEE Trans Comput 33(6):486-492
    • (1984) IEEE Trans Comput , vol.33 , pp. 486-492
    • Dahbura, A.T.1    Masson, G.M.2
  • 5
    • 0037828832 scopus 로고    scopus 로고
    • BC interconnection networks and their properties
    • 1
    • Fan J, He L (2003) BC interconnection networks and their properties. Chin J Comput 26(1):84-90
    • (2003) Chin J Comput , vol.26 , pp. 84-90
    • Fan, J.1    He, L.2
  • 6
    • 14844366636 scopus 로고    scopus 로고
    • The t//k-diagnosability of the BC graphs
    • 2
    • Fan JX, Lin XL (2005) The t//k-diagnosability of the BC graphs. IEEE Trans Comput 54(2):176-184
    • (2005) IEEE Trans Comput , vol.54 , pp. 176-184
    • Fan, J.X.1    Lin, X.L.2
  • 7
    • 84947657515 scopus 로고
    • Characterization of connection assignment of diagnosable systems
    • 1
    • Hakimi SL, Amin AT (1974) Characterization of connection assignment of diagnosable systems. IEEE Trans Comput 23(1):86-88
    • (1974) IEEE Trans Comput , vol.23 , pp. 86-88
    • Hakimi, S.L.1    Amin, A.T.2
  • 8
    • 3242690800 scopus 로고    scopus 로고
    • The diagnosability of the matching composition network under the comparison diagnosis model
    • 8
    • Lai PL, Tan JM, Tsai CH, Hsu L (2004) The diagnosability of the matching composition network under the comparison diagnosis model. IEEE Trans Comput 53(8):1064-1069
    • (2004) IEEE Trans Comput , vol.53 , pp. 1064-1069
    • Lai, P.L.1    Tan, J.M.2    Tsai, C.H.3    Hsu, L.4
  • 9
    • 14844366755 scopus 로고    scopus 로고
    • Conditional diagnosability measures for large multiprocessor systems
    • 2
    • Lai PL, Tan JM, Chang CP, Hsu L (2005) Conditional diagnosability measures for large multiprocessor systems. IEEE Trans Comput 54(2):165-175
    • (2005) IEEE Trans Comput , vol.54 , pp. 165-175
    • Lai, P.L.1    Tan, J.M.2    Chang, C.P.3    Hsu, L.4
  • 10
    • 0019696801 scopus 로고
    • A comparison connection assignment for self-diagnosis of multiprocessor system
    • Maeng J, Malek M (1981) A comparison connection assignment for self-diagnosis of multiprocessor system. In: Proc 11th intl symp fault-tolerant computing, pp 173-175
    • (1981) Proc 11th Intl Symp Fault-tolerant Computing , pp. 173-175
    • Maeng, J.1    Malek, M.2
  • 11
  • 12
    • 0021542893 scopus 로고
    • A polynomial time algorithm for fault diagnosability
    • IEEE Computer Society, Oct 1984
    • Sullivan GF (1984) A polynomial time algorithm for fault diagnosability. In: Proc 25th annu symp foundations comput sci, IEEE Computer Society, Oct 1984, pp 148-156
    • (1984) Proc 25th Annu Symp Foundations Comput Sci , pp. 148-156
    • Sullivan, G.F.1

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