Finding disjoint paths in networks
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
Delivery of time-critical messages using a multiple copy approach
ACM Transactions on Computer Systems (TOCS)
Receiver-driven layered multicast
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
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
Probability and Statistics with Reliability, Queuing and Computer Science Applications
Probability and Statistics with Reliability, Queuing and Computer Science Applications
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)
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)
Restoration by path concatenation: fast recovery of MPLS paths
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Comparison of two path restoration schemes in self-healing networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Fault-Tolerant Real-Time Communication in Distributed Computing Systems
IEEE Transactions on Parallel and Distributed Systems
Design and Evaluation of Routing Schemes for Dependable Real-Time Connections
DSN '01 Proceedings of the 2001 International Conference on Dependable Systems and Networks (formerly: FTCS)
Performance Evaluation of Dependable Real-Time Communication with Elastic QoS
DSN '01 Proceedings of the 2001 International Conference on Dependable Systems and Networks (formerly: FTCS)
Bandwidth Reallocation Techniques for Admitting High Priority Real-Time Calls in ATM Networks
ICN '01 Proceedings of the First International Conference on Networking-Part 1
Restoration by path concatenation: fast recovery of MPLS paths
Distributed Computing - Special issue: Selected papers from PODC '01
Controlled shared backup strategy based on channel availability
International Journal of Computer Applications in Technology
Efficient distributed bandwidth management for MPLS fast reroute
IEEE/ACM Transactions on Networking (TON)
IWQoS'03 Proceedings of the 11th international conference on Quality of service
RTSS'10 Proceedings of the 21st IEEE conference on Real-time systems symposium
Efficient distributed solution for MPLS fast reroute
NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
Asynchronous failed sensor node detection method for sensor networks
International Journal of Network Management
Aspen trees: balancing data center fault tolerance, scalability and cost
Proceedings of the ninth ACM conference on Emerging networking experiments and technologies
Hi-index | 0.00 |
For many applications it is important to provide communication services with guaranteed timeliness and fault-tolerance at an acceptable level of overhead. In this paper, we present a scheme for restoring real-time channels, each with guaranteed timeliness, from component failures in multi-hop networks. To ensure fast/guaranteed recovery, backup channels are set up a priori in addition to each primary channel. That is, a dependable real-time connection consists of a primary channel and one or more backup channels. If a primary channel fails, one of its backup channels is activated to become a new primary channel. We describe a protocol which provides an integrated solution to the failure-recovery problem (i.e., channel switching, resource re-allocation, ...). We also present a resource sharing method that significantly reduces the overhead of backup channels. The simulation results show that good coverage (in recovering from failures) can be achieved with about 30% degradation in network utilization under a reasonable failure condition. Moreover, the fault-tolerance level of each dependable connection can be controlled, independently of other connections, to reflect its criticality.