Delivery of time-critical messages using a multiple copy approach
ACM Transactions on Computer Systems (TOCS)
Establishment of Isolated Failure Immune Real-Time Channels in HARTS
IEEE Transactions on Parallel and Distributed Systems
Simulation study of the capacity effects of dispersity routing for fault tolerant realtime channels
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Fast restoration of real-time communication service from component failures in multi-hop networks
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
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
Fault recovery for guaranteed performance communications connections
IEEE/ACM Transactions on Networking (TON)
Aggressive Transmissions of Short Messages Over Redundant Paths
IEEE Transactions on Parallel and Distributed Systems
RTSS '97 Proceedings of the 18th IEEE Real-Time Systems Symposium
IWQoS'03 Proceedings of the 11th international conference on Quality of service
| Hi-index | 0.01 |
Abstract: Dependability-of-Service (DoS) has become an important requirement for real-time applications, such as remote medical services, business-critical network meetings, and command & control applications. The Dependable Real-Time Protocol (DRTP) [5, 6, 7] in which each dependable real-time connection is realize d with one primary and one or more backup channels, has been shown to be an effective way of providing DoS. How to route both primary and backup channels for each dependable real-time connection is of vital importance to the success of failure recovery and the reduction of overhead in providing DoS. In this paper, we prop ose and evaluate three different schemes for routing the primary and backup channels of each dependable real-time connection. Specifically, we present methods based on link-state information and bounded flooding to discover routes for primary and backup channels while satisfying the required Quality-of-Service (QoS). The costs of link-state and Flooding algorithms are reduced significantly by using the fact that the probability of success in failure recovery can be estimated with simple link-state information, and by bounding the flooded region within an ellipse with the two communication end-points as loci. Our in-depth simulations have shown that the proposed routing schemes are highly effective, providing fault-tolerance of 87% or higher with the network capacity overhead of less than 25%.