A distributed algorithm of fault recovery for stateful failover
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
NGITS'09 Proceedings of the 7th international conference on Next generation information technologies and systems
A fault-tolerant architecture for transportation information services of e-government
AST/UCMA/ISA/ACN'10 Proceedings of the 2010 international conference on Advances in computer science and information technology
Towards reliable intelligent transportation systems for e-government
EGOVIS'11 Proceedings of the Second international conference on Electronic government and the information systems perspective
Autonomic resources management of CORBA based systems for transportation with an agent
ICCSA'10 Proceedings of the 2010 international conference on Computational Science and Its Applications - Volume Part IV
| Hi-index | 0.00 |
Performance and fault tolerance are two major issues that need to be addressed while designing highly available and reliable systems. The network topology or the notion of connectedness among the network nodes defines the system communication architecture and is an important design consideration for fault tolerant systems. A number of fault tolerant designs for specific multi-processor architecture exists in the literature, but none of them discriminates between stateless and stateful failover. In this paper, we propose a reliable network topology and a high availability framework which is tolerant upto a maximum of k node faults in a network and is designed specifically to meet the needs of stateful failover. Assuming the nodes in the network are capable of handling multiple processes, through our design we have been able to prove that in the event of k node failures the load can be uniformly distributed across the network - ensuring load balance. We also provide an useful characterization for the network, which under the proposed framework ensures one hop communication between the required nodes.