R. Kawamura and I. Tokizawa, Self-healing Virtual Path Architecture in ATM Networks, IEEE Communications Magazine, pp.72-79, September 1995. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Network Restoration Using Recurrent Neural Networks - Kumar, Venkataram (Correct)
....may not be as efficient as the one after failure since the traffic pattern at the time of failure cannot be estimated. Also, the method requires huge memory to store the alternative path at each node along the existing path. A variation of the restoration before failure using zero bandwidth paths [17] are not sure to provide an alternate path if the bandwidth is not available at the time of failure. The restoration can be done between the source and destination (source based rerouting) or between the nodes where the failure took place (local rerouting) or between the local node and the ....
R. Kawamura and I. Tokizawa, Self-healing Virtual Path Architecture in ATM Networks, IEEE Communications Magazine, pp.72-79, September 1995.
AI Approaches to Network Management: Recent Advances and A.. - Kumar, Venkataram (Correct)
....on the use of source based local local destination rerouting and the location of the node link failure plays a role in deciding which method works well. The debate also persists on the issues like, the restoration should be centralized distributed and choosing the alternate before after failure [132]. In [84] 86] methods for ATM network restoration using virtual paths are discussed. While choosing a combination of the above strategy is one factor in deciding the restoration, computation of the alternative path is another. Since rerouting is also a routing, finding an optimal path for a given ....
R. Kawamura and I. Tokizawa, Self-healing Virtual Path Architecture in ATM Networks, IEEE Comm. Magazine, pp.72-79, September 1995.
Modeling, Algorithms and Analysis of Survivable VP Planning in.. - Wu, Lee (1999) (Correct)
.... the end to end path restoration that has been widely cited to be more advantageous than a link restoration scheme [2] 10] 16] In order to increase the bandwidth utilization, the backup capacity is allowed to be shared among independent paths [17] 22] By using the terminology in references [9], 17] the backup sharing scheme, VP SH (Virtual Path Self Healing) can always reach better capacity usage than no sharing case [17] 22] Although the no sharing scheme, VP APS (Virtual Path Automatic Protection Switch) has lower complexity and technical di#culties than the VP SH scheme. ....
....VP integrity by assuming the VP to physical capacity ratio to be very small [15] This assumption is not always true in reality. Kawamura et al. give a heuristic algorithm for planning virtual paths under several restoration schemes and give simulation results to show their performance comparison [9], 10] The joint survivable VP design problem can be formulated as a nonlinear combinatorial optimization problem that is an NP hard problem. In order to deal with this intractable feature, network designers try to get near optimal solutions instead of casting the real optimal solutions. Thus, ....
R. Kawamura and I. Tokizawa, "Self-healing virtual path architecture in ATM networks," IEEE Commun. Mag., vol.33, no.9, pp.72--79, 1995.
Modeling Recoverable Connections in Fault-Tolerant ATM Networks - Stahl, al. (1996) (Correct)
....to a particular link [Doverspike 1991] Both approaches require large amounts of idle capacity. Kawamura et al. reduce this requirement by making sev eral backup paths share the same idle capacity. The path s routes are coordinated to ensure all paths can be recovered for any single node failure [Kawamura et al. 1995]. A competing recovery strategy is distributed redundancy, in which uncommitted spare capacity is distributed throughout the network [Grover 1987] When a fault occurs, the recovery algorithm assembles the capacity into restoration segments. Because recovery paths are built dynamically using ....
....using currently available resources, this approach can theoretically tolerate any number of failures. This work models path level recovery in ATM using distributed redundancy. One drawback with recovery at the virtual path level is the difficulty of supporting multiple grades of reliability [Kawamura et al. 1995]. Both Oki et al. and Nederlof et al. suggest circuit level recovery to support priority classes [Oki et al. 1995; Nederlof et al. 1995] but circuit level recovery has other drawbacks (explored in Section 4) A simple solution at the VP level is to associate a priority with each path and assign ....
Kawamura, R., Sato, K. and Tokizawa, I. 1995. "Self-healing Virtual Path Architecture in ATM Networks." IEEE Communications, September, 120-127.
PANEL - Protection Across NEtwork Layers - Demeester, Gryseels, Struyve.. (1997) (Correct)
No context found.
R. Kawamura, I. Tokizawa, "Self-healing Virtual Path Architecture in ATM Networks", IEEE
Towards Resliient Networks and Services - Georgatsos, (eds.) (1999) (Correct)
No context found.
R. Kawamura and I. Tokizawa, Self-healing Virtual Path Architecture in ATM Networks, IEEE Comm. Mag., vol. 33, no. 2, September 1995.
Understanding Prioritized Recovery in Fault-Tolerant ATM Networks - Stahl (1998) (Correct)
No context found.
KT95 Kawamura, R. and Tokizawa, I. "Self-healing Virtual Path Architecture in ATM Networks. " IEEE Communications Magazine, September 1995, p. 72-78.
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