Delivery of time-critical messages using a multiple copy approach
ACM Transactions on Computer Systems (TOCS)
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
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
A rearrangeable algorithm for the construction delay-constrained dynamic multicast trees
IEEE/ACM Transactions on Networking (TON)
A new distributed route selection approach for channel establishment in real-time networks
IEEE/ACM Transactions on Networking (TON)
Delayed Internet routing convergence
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Aggressive Transmissions of Short Messages Over Redundant Paths
IEEE Transactions on Parallel and Distributed Systems
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
A Segmented Backup Scheme for Dependable Real Time Communication in Multihop Networks
IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
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
Quality-of-service routing for supporting multimedia applications
IEEE Journal on Selected Areas in Communications
QoS-based routing of multimedia streams in computer networks
IEEE Journal on Selected Areas in Communications
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
Reliability constrained routing in QoS networks
IEEE/ACM Transactions on Networking (TON)
Utility Accrual Channel Establishment in Multihop Networks
IEEE Transactions on Computers
Traffic recovery time constrained shared sub-path protection algorithm in survivable WDM networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Improved quasi-path restoration in mesh networks
IEEE/ACM Transactions on Networking (TON)
Research note: A proactive backup scheme for reliable real-time transmission
Journal of Parallel and Distributed Computing
Optimal segment size for fixed-sized segment protection in wavelength-routed optical networks
ANTS'09 Proceedings of the 3rd international conference on Advanced networks and telecommunication systems
Providing delay constraint services with the palindrome scheduler schemes
AEE'06 Proceedings of the 5th WSEAS international conference on Applications of electrical engineering
On surviving dual-link failures in path protected optical WDM mesh networks
Optical Switching and Networking
Optical Switching and Networking
An overview of algorithms for network survivability
ISRN Communications and Networking
Hi-index | 0.00 |
Several distributed real-time applications (e.g., medical imaging, air traffic control, and video conferencing) demand hard guarantees on the message delivery latency and the recovery delay from component failures. As these demands cannot be met in traditional datagram services, special schemes have been proposed to provide timely recovery for real-time communications in multihop networks. These schemes reserve additional network resources (spare resources) a priori along a backup channel that is disjoint with the primary. Upon a failure in the primary channel, its backup is activated, making the real-time connection dependable. In this paper, we propose a new method of providing backups called segmented backups, in which backup paths are provided for partial segments of the primary path rather than for its entire length, as is done in the existing schemes. We show that our method offers: 1) improved network resource utilization; 2) higher average call acceptance rate; 3) better quality-of-service guarantees on propagation delays and failure-recovery times; and 4) increased flexibility to control the level of fault tolerance of each connection separately. We provide an algorithm for routing the segmented backups and prove its optimality with respect to spare resource reservation. We detail necessary extensions to resource reservation protocol (RSVP) to support our scheme and argue that they increase the implementation complexity of RSVP minimally. Our simulation studies on various network topologies demonstrate that spare resource aggregation methods such as backup multiplexing are more effective when applied to our scheme than to earlier schemes.