Delivery of time-critical messages using a multiple copy approach
ACM Transactions on Computer Systems (TOCS)
A Primary-Backup Channel Approach to Dependable Real-Time Communication in Multihop Networks
IEEE Transactions on Computers
Resource aggregation for fault tolerance in integrated services networks
ACM SIGCOMM Computer Communication Review
Aggressive Transmissions of Short Messages Over Redundant Paths
IEEE Transactions on Parallel and Distributed Systems
Experimental Evaluation of Failure-Detection Schemes in Real-time Communication Networks
FTCS '97 Proceedings of the 27th International Symposium on Fault-Tolerant Computing (FTCS '97)
RTSS '97 Proceedings of the 18th IEEE Real-Time Systems Symposium
IEEE/ACM Transactions on Networking (TON)
An Efficient Resource Sharing Scheme for Dependable Real-Time Communication in Multihop Networks
HiPC '02 Proceedings of the 9th International Conference on High Performance Computing
Algorithms for computing QoS paths with restoration
IEEE/ACM Transactions on Networking (TON)
On surviving dual-link failures in path protected optical WDM mesh networks
Optical Switching and Networking
| Hi-index | 0.00 |
Several distributed real time applications require fault tolerance apart from guaranteed timeliness. It is essential to provide hard guarantees on recovery delays, due to component failures, which cannot be ensured in traditional datagram services. Several schemes exist whid attempt to guarantee recovery in a timely and resource efficient manner. These methods center around a priori resermtion of netw ork resources called spare resources along a backup route. In this paper we propose a method of segmented bac kups which improves upon the existing methods in terms of resource utilisation, call acceptance rate and bounded failure recovery time. We demonstrate the efficiency of our method using simulation studies.