Optimal agreement in a scale-free network environment

Informatica

Volumn 17, Issue 1, 2006, Pages 137-150

  Wang, Shu Ching ^a,c,d   Yan, Kuo Qin ^a   Chiang, Mao Lun ^b  

^a CHAOYANG UNIVERSITY OF TECHNOLOGY   (Taiwan)

^b NATIONAL CHUNG HSING UNIVERSITY   (Taiwan)

^c Department of Information Management ^*  (Taiwan)

^d Department of Information Management   (Taiwan)

Author keywords

Byzantine agreement; Complex network and random network; Consensus; Fault tolerance; Scale free network

Indexed keywords

EID: 33645682188     PISSN: 08684952     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (23)

1. Babaoglu, O., and R. Drummond (1985). Streets of Byzantium: network architectures for fast reliable broad-casts. IEEE Trans. on Data and Knowledge Engineering, SE-11(6), 546-554.
2. Barabási, A.-L., and R. Albert ( 1999). Emergence of scaling in random networks. Science, 286, 509-512.
3. Barabási, A.-L., R. Albert and H. Jeong (1999). Mean-field theory for scale-free random networks. Physica A, 272, 173-187.
4. Barabási, A.-L., R. Albert and H. Jeong (2000). Scale-free characteristics of random networks: the topology of the world wide web. Physica A, 281, 69-77.
5. Barborak, M., M. Malek and A. Dahbura (1993). The consensus problem in fault-tolerant computing. ACM Computing Surveys, 25(2), 171-220.
6. Bar-Noy, A., and D. Dolev (1991). Consensus algorithms with one-bit messages. Distributed Computing, 4, 105-110.
7. Dasgupta, P. (1998). Agreement under faulty interfaces. Information Processing Letters, 65, 125-129.
8. Dolev, D. (1982). The Byzantine generals strike again. Journal of Algorithm., 3, 14-30.
9. Dolev, D., and R. Reischuk (1985). Bounds on information exchange for Byzantine agreement. Journal of ACM, 32(1), 191-204.
10. ErdosP., and A. Renyi (1960). On the evolution of random graphs. Publ. Math. Inst. Hung. Acad. Sci., 5, 17-60.
11. Fischer, M. (1983). The consensus problem in unreliable distributed systems (A brief survey). Lecture Notes in Computer Science, In Proceedings of the 1983 International Fault Tolerance Computer Conference, Borgholm, Sweden, pp. 127-140.
12. Lamport, L., R. Shostak and M. Pease (1982). The Byzantine generals problem. ACM Tran. on Programming Languages and System, 43, 384-401.
13. Meyer, F.J., and D.K. Pradhan (1991). Consensus with dual failure modes. IEEE Trans. on Parallel and Distributed Systems, 2(2), 214-222.
14. Molina, M. (1986). Application of Byzantine agreement in database systems. ACM Trans. on Database Systems, 11(1), 27-47.
15. Pease, M., R. Shostak and L. Lamport (1980). Reaching agreement, in presence of faults. Journal of ACM, 27(2), 228-234.
16. Shima, K., H. Higaki and M. Takizawa (1996). Fault-tolerant causal delivery in group communication. In Proceedings of International Conference of Parallel and Distributed Systems, pp. 302-309.
17. Siu, H.S., Y.H. Chin and W.P. Yang (1996). A note on consensus on dual failure modes. IEEE Trans. on Parallel and Distributed Systems, 7(3), 335-345.
18. Wang, S.C., Y.H. Chin and K.Q. Yan (1995). Byzantine agreement in a generalized connected environment model. In IEEE Trans. on Parallel and Distributed System., 6(4). pp. 420-427.
19. Wang, S.C., K.Q. Yan, S.H. Kao and L.Y. Tseng (2000). Consensus with dual link failure modes on generalized network. CY Journal, ISSN 1026-244X, 35-52.
20. Wang, X.F., and G. Chen (2002). Synchronization in scale-free dynamical networks: robustness and fragility. IEEE Trans. on Circuits and Systems, 49(1), 54-62.
21. Yan, K.Q., Y.H Chin and S.C. Wang (1988). An optimal solution for consensus problem in an unreliable communication system. In Proceedings of International Conference on Parallel Processing, pp. 388-391.
22. Yan, K.Q., Y.H. Chin and S.C. Wang (1992). Optimal agreement algorithm in malicious faulty processors and faulty links. IEEE Trans. on Data and. Knowledge Engineering, 4(3), 266-280.
23. Yan, K.Q., S.C. Wang and Y.H. Chin (1999). Consensus under unreliable communication. Information Processing Letters, 69(5), 243-248.