메뉴 건너뛰기




Volumn 93, Issue 3, 2005, Pages 109-115

Broadcasting with locally bounded Byzantine faults

Author keywords

Algorithms; Broadcast; Byzantine faults; Distributed computing; Fault tolerance

Indexed keywords

ALGORITHMS; DISTRIBUTED COMPUTER SYSTEMS; GRAPH THEORY; NETWORK PROTOCOLS; PROBLEM SOLVING; TELECOMMUNICATION NETWORKS; THEOREM PROVING; TOPOLOGY; TRANSMITTERS;

EID: 10444286785     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2004.10.007     Document Type: Article
Times cited : (116)

References (11)
  • 1
    • 0028445434 scopus 로고
    • Information dissemination in distributed systems with faulty units
    • A. Bagchi, S.L. Hakimi, Information dissemination in distributed systems with faulty units, IEEE Trans. Comp. 43 (1994) 698-710.
    • (1994) IEEE Trans. Comp. , vol.43 , pp. 698-710
    • Bagchi, A.1    Hakimi, S.L.2
  • 2
    • 84947943512 scopus 로고
    • Broadcasting in hyper-cubes with randomly distributed Byzantine faults
    • Proc. WDAG'95, Springer, Berlin
    • F. Bao, Y. Igarashi, K. Katano, Broadcasting in hyper-cubes with randomly distributed Byzantine faults, in: Proc. WDAG'95, in: Lecture Notes in Comput. Sci., vol. 972, Springer, Berlin, 1995, pp. 215-229.
    • (1995) Lecture Notes in Comput. Sci. , vol.972 , pp. 215-229
    • Bao, F.1    Igarashi, Y.2    Katano, K.3
  • 3
    • 0026902215 scopus 로고
    • On the time complexity of broadcast in radio networks: An exponential gap between determinism and randomization
    • R. Bar-Yehuda, O. Goldreich, A. Itai, On the time complexity of broadcast in radio networks: an exponential gap between determinism and randomization, J. Comput. System Sci. 45 (1992) 104-126.
    • (1992) J. Comput. System Sci. , vol.45 , pp. 104-126
    • Bar-Yehuda, R.1    Goldreich, O.2    Itai, A.3
  • 4
    • 0039164244 scopus 로고    scopus 로고
    • Reliable broadcasting in logarithmic time with Byzantine link failures
    • P. Berman, K. Diks, A. Pelc, Reliable broadcasting in logarithmic time with Byzantine link failures, J. Algorithms 22 (1997) 199-211.
    • (1997) J. Algorithms , vol.22 , pp. 199-211
    • Berman, P.1    Diks, K.2    Pelc, A.3
  • 5
    • 21344496450 scopus 로고
    • Optimal communication in networks with randomly distributed Byzantine faults
    • D. Blough, A. Pelc, Optimal communication in networks with randomly distributed Byzantine faults, Networks 23 (1993) 691-701.
    • (1993) Networks , vol.23 , pp. 691-701
    • Blough, D.1    Pelc, A.2
  • 7
    • 0009768331 scopus 로고
    • The Byzantine generals strike again
    • D. Dolev, The Byzantine generals strike again, J. Algorithms 3 (1982) 14-30.
    • (1982) J. Algorithms , vol.3 , pp. 14-30
    • Dolev, D.1
  • 10
    • 0009152529 scopus 로고    scopus 로고
    • Fault-tolerant broadcasting in radio networks
    • E. Kranakis, D. Krizanc, A. Pelc, Fault-tolerant broadcasting in radio networks, J. Algorithms 39 (2001) 47-67.
    • (2001) J. Algorithms , vol.39 , pp. 47-67
    • Kranakis, E.1    Krizanc, D.2    Pelc, A.3
  • 11
    • 0012614841 scopus 로고    scopus 로고
    • Fault-tolerant broadcasting and gossiping in communication networks
    • A. Pelc, Fault-tolerant broadcasting and gossiping in communication networks, Networks 28 (1996) 143-156.
    • (1996) Networks , vol.28 , pp. 143-156
    • Pelc, A.1


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