Download:
|
by Seungjae Han, Kang G. Shin
in Proc. of ACM SIGCOMM’97
http://kabru.eecs.umich.edu/papers/publications/1997/sjhan-sigcomm97.ps.gz
Add To MetaCart
Abstract:
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.
Citations
|
873
|
RSVP: A New Resource ReSerVation Protocol
– Zhang, Deering, et al.
- 1993
|
|
573
|
Receiver-driven layered multicast
– McCanne, Jacobson, et al.
- 1996
|
|
210
|
Probability and Statistics with Reliability, Queuing and Computer Science Applications
– Trivedi
- 2002
|
|
100
|
H.Schulzrinne, \Real-time communication in packet-switched networks
– Aras, Kurose, et al.
- 1994
|
|
58
|
Tokizawa: “Self-healing ATM networks based on virtual path concept
– Kawamura, Sato, et al.
- 1994
|
|
44
|
Simulation Study of the Capacity Effects of Dispersity Routing for Fault Tolerant Realtime Channels
– Banerjea
- 1996
|
|
41
|
Fast restoration of ATM networks
– Anderson, Doshi, et al.
- 1994
|
|
25
|
Recovering guaranteed performance service connections from single and multiple faults
– Banerjea, Parris, et al.
- 1994
|
|
22
|
The selfhealing network: A fast distributed restoration technique for networks using digital crossconnect machines
– Grover
- 1987
|
|
22
|
Virtual path routing for survivable ATM networks
– Murakami, Kim
- 1996
|
|
21
|
Finding Disjoint Paths in Networks
– Sidhu, Nair, et al.
|
|
20
|
FITNESS: Failure immunization technology for network service survivability
– Yang, Hasegawa
- 1988
|
|
19
|
Delivery of Time-Critical Messages Using a Multiple Copy Approach
– Ramanathan, Shin
- 1992
|
|
11
|
Experimental evaluation of failure-detection schemes in real-time communication networks
– Han, Shin
- 1997
|
|
11
|
Efficient spare resource allocation for fast restoration of real-time channels from network component failures, in
– Han, Shin
- 1997
|
|
9
|
A distributed link restoration algorithm with robust preplanning
– Baker
- 1991
|
|
7
|
Aggressive transmissions of short messages over redundant paths
– Kao, Garcia-Molina, et al.
- 1994
|
|
5
|
Finding maximal link disjoint paths in a multigraph
– Whalen, Kenney
- 1990
|
|
1
|
Fault--tolerant real-- time communication in distributed computing systems
– Zheng, Shin
- 1992
|