DocumentCode :
464435
Title :
Reaching Consensus in a Dual Fallible Scale Free Network
Author :
Wang, S.C. ; Yang, S.C. ; Yan, K.Q.
Author_Institution :
Chaoyang Univ. of Technol., Taichung
fYear :
2007
fDate :
11-15 March 2007
Firstpage :
4029
Lastpage :
4033
Abstract :
Consensus problem plays a key role in the design of fault tolerant distributed system. Over the years, a number of solutions to consensus problem have been proposed with varying assumption of the network structures. However, most existing consensus protocols are designed for random networks. Recently, many large complex networks have emerged and displayed a scale free feature, which influences the system to reach a different common value. Unfortunately, existing consensus protocols and results cannot cope with the new network environment and the consensus problem thus needs to be revisited. The proposed protocol is called as the dual TM protocol (DTMP), which can make each correct processor reach a consensus value to cope with the faulty component in the scale free network. However, DTMP can make all correct processors reaching consensus with two rounds of message exchange and tolerate the maximum number of allowable components.
Keywords :
fault tolerant computing; protocols; dual TM protocol; dual fallible scale free network; fault tolerant distributed system; Chaotic communication; Communications Society; Complex networks; Computer crashes; Delay; Fault diagnosis; Fault tolerant systems; Protocols; Telecommunication network reliability; Working environment noise;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Wireless Communications and Networking Conference, 2007.WCNC 2007. IEEE
Conference_Location :
Kowloon
ISSN :
1525-3511
Print_ISBN :
1-4244-0658-7
Electronic_ISBN :
1525-3511
Type :
conf
DOI :
10.1109/WCNC.2007.736
Filename :
4224981
Link To Document :
بازگشت