S. Han and K. G. Shin, "A Primary-backup Channel Approach to Dependable Realtime Communication in Multi-hop Networks," IEEE Transactions on Computers, vol. 47, no. 1, pp. 46--61, January 1998.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....as the primary path. But this brings on the issue of failure of components along this predetermined path. 1. 1 Related Work A simple and e ective method to ensure fast and guaranteed failure recovery is to reserve a priori spare resources along another path, called a backup path (or channel)[1, 2, 3, 4, 5], which is disjoint with the primary path. Activation of these spare resources occur only when the primary channel is disabled. So, these spare resources are available for best e ort trac. A simple way to reserve resources for such a backup channel is the end to end detouring [3, 4] scheme. In ....

....we have mainly concentrated on the resource reservation issues of real time communication and do not address issues like message scheduling or queuing at each node. Here, it can be safely assumed that the real time model (which speci es the real time issues like queuing and scheduling) assumed in [5] will be applicable in our case, too. This is because in that work too, the authors try to achieve QoS guarantees based on end to end resource reservations. Keeping this criteria in mind, we can understand how segmented backups are more resource ecient than end to end backups. Consider the ....

[Article contains additional citation context not shown here]

S. Han and K. G. Shin, \A Primary-Backup Channel Approach to Dependable Real-Time Communication in Multihop Networks," IEEE Trans. on Computers, Vol. 47, No. 1, pp. 46-61, January 1998.

....but no end to end backup. improved network resource utilization: This is because segmented backups are typically shorter than end to end backups and need less spare resources. Moreover, shorter backup paths lead to more efficient resource aggregation through backup multiplexing [4] 6] [8]. better QoS guarantees: A segmented backup can comprise of multiple backups, each of which spans a part of the primary path rather than its full length. This allows for faster failure recovery and more fine grained control of fault tolerance for long primary paths over components with varying ....

....is an important metric while evaluating different schemes. In this section, we briefly outline a method to minimize the amount of spare resources reserved by multiplexing (sharing) the backups passing through the same link. The technique of backup multiplexing is discussed in detail in [4] 6] [8] and we adapt it here to our case of segmented backups. We consider single link failure model for our analysis, under the assumption that component (link) failure recovery time, i.e. time taken for the fault to be rectified, is much smaller than the network s mean time to failure (MTTF) Using ....

[Article contains additional citation context not shown here]

S. Han and K. G. Shin, "A primary-backup channel approach to dependable real-time communication in multihop networks," IEEE Trans. Computers, vol. 47, no. 1, pp. 46-61, January 1998.

....based on underlying unicast routing are as survivable as the unicast routing protocol. If the multicast routing protocol is independent of the unicast routing protocol, it must implement its own restoration mechanism [3] Though significant research has been done for failure recovery in unicasting [21, 22, 23], not much research has been done to handle failure in multicasting. 24] is the only work done in this area. 2.3 On Session Issues Tree Maintenance In dynamic multicasting, due to continuous grafting and pruning, the multicast tree degrades over time [25] To improve the quality (cost) of the ....

S. Han and K.G. Shin, "A primary-backup channel approach to dependable real-time communication in multihop networks," IEEE Trans. Computers, vol.47, no.1, pp.46-61, Jan. 1998.

....session, it may be possible to obtain a better multicast tree with the addition of a new node. The most important aspect of network dynamics is failure handling because failure introduces service disruption. For unicasting, one type of failure handling approach is the protection based approach [11, 12, 13] wherein dedicated protection mechanisms, such as redundant (backup) channels operating in hot standby, are employed to cope with failures. The primary and backup channels are usually node disjoint. This approach is more suitable for hard real time communication wherein every packet is critical. ....

S. Han and K.G. Shin, "A primary-backup channel approach to dependable real-time communication in multihop networks," IEEE Trans. Computers, vol.47, no.1, pp.46-61, Jan. 1998.

....multicast session, it may be possible to obtain a better multicast tree with the addition of a new node. A critical aspect of network dynamics is failure handling because failure introduces service disruption. For unicasting, one type of failure handling approach is the protection based approach [7, 8] wherein dedicated protection mechanisms, such as redundant (backup) channels operating in hot standby, are employed to cope with failures. This approach is more suitable for hard real time communication wherein every packet is critical. The other type is the restoration based approach wherein a ....

S. Han and K.G. Shin, \A primary-backup channel approach to dependable real-time communication in multihop networks," IEEE Trans. Computers, vol.47, no.1, pp.46-61, Jan. 1998.

....the most important schemes under this category. Primary backup Channel Scheme: A real time channel is dependable if it has the desired number of backup channels, i.e. a dependable channel (D connection or D channel) consists of one primary and one or more backup channels acting as cold standby [5]. The bandwidth of the backup channels is the same as its primary channel. A backup channel is activated on detection of a fault in any network component along the path of the primary channel. The two main issues here are: i) backup channel(s) establishment, before the occurrence of faults, which ....

....channel scheme is to establish dependable channels that minimize the spare resource reservation, thereby improving the call acceptance rate. i) Backup Route Selection: The problem of optimal routing of backup channels to optimize on spare resource allocation is known to be NP complete [5]. Therefore, heuristic cost functions and least cost routing are used for setting up paths. A cost function that takes backup multiplexing into account gives a better performance but requires information regarding routing path of all the primary channels in the entire network for evaluating the ....

[Article contains additional citation context not shown here]

S. Han and K.G. Shin, "A primary-backup channel approach to dependable real-time communication in multihop networks," IEEE Trans. Computers, vol.47, no.1, pp.46-61, Jan. 1998.

....network protocol. Integrated fault tolerant real time communication has been addressed for in a variety of network settings in [2, 4, 8, 11, 16, 17] Han and Shin detail detect and recover approaches to fault tolerance by establishing D connections (short for dependable real time connection) in [7]. The D connection consists of a primary channel and one or more backup channels. A backup channel remains a cold standby until it is activated due to detection of faults. As with any detect and recover approach, data is lost during the time interval when the failure is handled. Our work ....

S. Han and K.G. Shin. A Primary-Backup Channel Approach to Dependable Real-Time Communication in Multi-hop Networks. IEEE Transactions on Computers, 47:46--61, Jan 1998.

....known as the Primary backup channel scheme. 2.2. 1 Primary backup Channel Scheme A real time channel is dependable if it has the desired number of backup channels, i.e. a dependable channel (D connection or D channel) consists of one primary and one or more backup channels acting as cold standby [7]. The bandwidth of a backup channel is the same as its primary channel. A backup channel is activated on detection of a fault in any network component in the primary channel. Two main issues here are: i) backup channel(s) establishment, before a fault, which involves selecting route(s) for the ....

....that takes backup multiplexing into account gives a better performance but requires information regarding routing path of all the primary channels in the entire network for evaluating the cost function. Therefore, the backup route selection is centralized and is usually done at the source node [7]. Spare Resource Allocation with Backup Multiplexing: This is a resource sharing technique used in the primary backup channel scheme wherein, on each link, only a very small fraction of the resources, such as bandwidth, are allocated for all backup channels using that link. Such a link is said to ....

[Article contains additional citation context not shown here]

S. Han and K.G. Shin, "A primary-backup channel approach to dependable real-time communication in multihop networks," IEEE Trans. Computers, vol.47, no.1, pp.46-61, Jan. 1998.

.... songkuk, dqao, skodase, kgshn eecs. mich. edu 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 4 control applications. The Dependable Real Time Protocol (DRTP) [5, 6, 7] in which each dependable real time connection is realized 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 ....

....[12] additional resources are reserved in the vicinity of each real time channel, and the failed components are de toured by using the reserved resources. In [13] the SFI method was extended to combat special patterns of multiple failures in a hexagonal mesh network. Spare resource allocation [4, 5, 6, 7] is another ap proach that employs failure detection and recovery for fault tolerance. Additional (called spare) resources are reserved a priori solely for the purpose of speedy service recovery from possible network failures. The key advantage of proactive schemes is that the latency and ....

[Article contains additional citation context not shown here]

S. Han and K. G. Shin. A primary-backup channel approach to dependable real-time communication in multi-hop networks. IEEE Transactions on Computers, 47(1), 1998.

....fsongkuk,dqiao,skodase,kgshing eecs.umich.edu 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 realized with one primary and one or more backup channels, has been shown to be an e ective 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 ....

....[12] additional resources are reserved in the vicinity of each real time channel, and the failed components are detoured by using the reserved resources. In [13] the SFI method was extended to combat special patterns of multiple failures in a hexagonal mesh network. Spare resource allocation [4, 5, 6, 7] is another approach that employs failure detection and recovery for fault tolerance. Additional (called spare) resources are reserved a priori solely for the purpose of speedy service recovery from possible network failures. The key advantage of proactive schemes is that the latency and ....

[Article contains additional citation context not shown here]

S. Han and K. G. Shin. A primary-backup channel approach to dependable real-time communication in multi-hop networks. IEEE Transactions on Computers, 47(1), 1998.

.... real time applications by maintaining an environment that satisfies real time, predictability and reliability requirements[1] Many real time systems have the requirements of high reliability, the real time tasks must finish with the specified deadlines in spite of hardware and software failure[2]. In the research of new generation real time systems, scheduling algorithms with fault tolerance is one of the key points. BASIC IDEA OF THE ALGORITHM Our algorithm can schedules a set of real time tasks, which contains two kinds of real time tasks, one has fault tolerant requirement(FTR) and ....

S. Han and K.G. Shin. A primary-backup channel approach to dependable real-time communication in multiple networks. IEEE Transactions on Computers, 1998, 47(1) : 46-61.

No context found.

S. Han and K. G. Shin, "A Primary-backup Channel Approach to Dependable Realtime Communication in Multi-hop Networks," IEEE Transactions on Computers, vol. 47, no. 1, pp. 46--61, January 1998.

No context found.

S. Han and K. G. Shin. A Primary-Backup Channel Approach to Dependable Real-Time Communication in Multihop Networks. IEEE Transactions on Computers, 47(1):46-- 61, January 1998.

No context found.

S. Han and K. G. Shin. A Primary-Backup Channel Approach to Dependable Real-Time Communication in Multihop Networks. IEEE Transactions on Computers, 47(1), 1998.

No context found.

S. Han and K.G. Shin, "A primary-backup channel approach to dependable real-time communication in multihop networks," IEEE Trans. Computers, vol.47, no.1, pp.46-61, Jan. 1998.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC