A new Some-Read-Any-Write (SRAW) fault tolerant algorithm for redudant services is presented that allows a system to adjust failures dynamically in order to keep the availability and improve the performance. SRAW is b...A new Some-Read-Any-Write (SRAW) fault tolerant algorithm for redudant services is presented that allows a system to adjust failures dynamically in order to keep the availability and improve the performance. SRAW is based upon dynamic and active load balancing. By introducing dynamic and active load balancing scheme into redundant services, not only the processing speed of requests can be greatly improved, but also the load balancing can be simply and efficiently achieved. Integrated with consistency protocol in this paper, SRAW can also be applied to state services. The performance of SRAW algorithm is also analyzed, and comparisons with other fault tolerant algorithms, expecially with RAWA, indicate that SRAW efficiently improves the performance of redundant services with guaranteeing system availability. Keywords redundant service - fault tolerant - active - load balancing - quorum Supported by the Hebei Province Natural Science Foundation of China under Grant No.600091.Jun-Feng Tian received the B.S. degree in electrical engineering and the M.S. degree in computer application both from Hebei University, in 1986 and in 1995 respectively. Currently, he is a Ph.D. candidate in University of Science and Technology of China. He is a professor at Hebei University. His current research interests include network technology, system architecture and distributed computing.Jun-Wei Zhang was born in 1977 and received the B.S. and M.S. degrees in computer application from Hebei University, P.R. China, in 2000 and 2003, respectively. His current research interests include software fault tolerance and load balancing.Feng-Xian Wang received the B.S. degree in electrical engineering from Hebei University, P.R. China, in 1978. He is a professor in Hebei University. His current research interests include network security and distributed computing.展开更多
文摘A new Some-Read-Any-Write (SRAW) fault tolerant algorithm for redudant services is presented that allows a system to adjust failures dynamically in order to keep the availability and improve the performance. SRAW is based upon dynamic and active load balancing. By introducing dynamic and active load balancing scheme into redundant services, not only the processing speed of requests can be greatly improved, but also the load balancing can be simply and efficiently achieved. Integrated with consistency protocol in this paper, SRAW can also be applied to state services. The performance of SRAW algorithm is also analyzed, and comparisons with other fault tolerant algorithms, expecially with RAWA, indicate that SRAW efficiently improves the performance of redundant services with guaranteeing system availability. Keywords redundant service - fault tolerant - active - load balancing - quorum Supported by the Hebei Province Natural Science Foundation of China under Grant No.600091.Jun-Feng Tian received the B.S. degree in electrical engineering and the M.S. degree in computer application both from Hebei University, in 1986 and in 1995 respectively. Currently, he is a Ph.D. candidate in University of Science and Technology of China. He is a professor at Hebei University. His current research interests include network technology, system architecture and distributed computing.Jun-Wei Zhang was born in 1977 and received the B.S. and M.S. degrees in computer application from Hebei University, P.R. China, in 2000 and 2003, respectively. His current research interests include software fault tolerance and load balancing.Feng-Xian Wang received the B.S. degree in electrical engineering from Hebei University, P.R. China, in 1978. He is a professor in Hebei University. His current research interests include network security and distributed computing.
