W.-P. Wang, D. Tipper, B. Jaeger and D. Medhi, "Fault Recovery Routing in Wide Area Packet Networks," Proc. of 15th International Teletraffic Congress, Washington, DC, pp. 1077-1086, June 1997.  Home/Search   Document Details and Download   Summary   Related Articles   Check

.... or nonstationary congestion period triggered by the retransmission of lost information after an attack failure[4] Recently, this has led us to develop network rerouting optimization models, and conduct a comparison of various routing schemes in both an optimization and simulation environment[5]. We have extended the simulation study to incorporate a more realistic traffic source model, namely an MMPP model. The results show that that the conclusions of our original study still hold even when the traffic is MMPP. Mainly, that the rerouting algorithm used can have a significant effect on ....

W.-P. Wang, D. Tipper, B. Jaeger and D. Medhi, "Fault Recovery Routing in Wide Area Packet Networks," Proceedings of 15th International Teletraffic Congress (ITC), Washington, D.C., June 1997.

No context found.

W.-P. Wang, D. Tipper, B. Jaeger and D. Medhi, "Fault Recovery Routing in Wide Area Packet Networks," Proc. of 15th International Teletraffic Congress, Washington, DC, pp. 1077-1086, June 1997.

....not only guarantees service restoration, but also minimizes the duration and range of the failure impact. In packet switched networks, such service guarantees are especially important because backlog traffic accumulated during the failure restoration phase might introduce significant congestion [14], 15] Preplanning spare capacity can mitigate or even avoid this congestion. On the other hand, reserving additional spare capacity increases the network redundancy. Therefore, the major interest in survivable network design has been concentrated on providing cost efficient spare capacity ....

W.-P. Wang, D. Tipper, B. Jger, and D. Medhi, "Fault recovery routing in wide area packet networks," in Proceedings of 15th International Teletraffic Congress, Washington, DC, June 1997.

....not only guarantees service restoration, but also minimizes the duration and range of the failure impact. In packet switched networks, such service guarantees are especially important because backlog traffic accumulated during the failure restoration phase might introduce significant congestion [14], 15] Preplanning spare capacity can mitigate or even avoid this congestion. On the other hand, reserving additional spare capacity increases the network redundancy. Therefore, the major interest in survivable network design has been concentrated on providing cost efficient spare capacity ....

W.-P. Wang, D. Tipper, B. Jger, and D. Medhi, "Fault recovery routing in wide area packet networks," in Proceedings of 15th International Teletraffic Congress, Washington, DC, June 1997.

....along with appropraite traffic restoration protocols. However, caution must be employed it adopting such a strategy as transient conditions must be consider in the network and traffic restoration protocol design. The importance of consider transient condition is illustrated in two recent works. In [17] it was shown that traffic restoration schemes (in this case fault recovery routing) can have identical steady state performance ( connection blocking probability and demand restored) and very different transient behavior in terms of the magnitude and duration of congestion. Secondly in [4] it ....

W. Wang, D. Tipper, B. Jager and D. Medhi, "Fault Recovery Routing in Wide Area Packet Networks," Proceedings of 15th International Teletraffic Congress, Washington, D.C. June, 1997.

....level restoration may not be applicable in certain failure scenarios, such as a line card or a device failure) This, in turn, means that survivability and restoration at VP and or VC level would also be necessary. For call virtual circuit level restoration, the reader is directed to work such as [7, 21, 24, 25]. Our present paper concentrates on virtual path level survivability and restoration. Research supported by the US National Science Foundation under grants NCR 9506652 and CDA 9422092. The virtual path concept for ATM networks design and management have been addressed by numerous researchers ....

W. P. Wang, D. Tipper, B. Jaeger and D. Medhi, "Fault Recovery Routing in Wide Area Packet Networks," Proc. of 15th Intl. Teletraffic Congress , 1997.

....of a link failure in a generic virtual circuit based packet network. While the impact on the traffic performance due to a failure in the presence of routing has received considerable attention in circuit switched networks (that employ dynamic routing) and virtual circuit based packet networks [2, 12, 17, 19, 23, 24, 30, 34, 37], it has received little attention in the case of TCP IP network. In fact, most of the work devoted to TCP performance and its extension consider a single link or a linear network (no routing) in their studies. Another congestion (rather, a perceived congestion) at the TCP level can be due to ....

W.-P. Wang, D. Tipper, B. Jaeger and D. Medhi, "Fault Recovery Routing in Wide Area Packet Networks," Proceedings of 15th International Teletraffic Congress, Washington, DC, pp. 1077-1086, June 1997.

....the network to a failure is a critical issue. While there has been considerable work on understanding the impact of a network failure on routing, design and performance for other types of networks such as circuit switched networks, virtual circuit based packet networks including ATMbased networks [2, 3, 8, 11, 12, 19, 21], there has been very limited work in this area for IP datagram networks. In this work, we consider the issue of network performance of a wide area datagram network, such as the Internet, supporting multicast traffic along with unicast traffic, especially when subjected to a link failure. Failure ....

W. P. Wang, D. Tipper, B. Jaeger and D. Medhi, "Fault Recovery Routing in Wide Area Packet Networks," Proceedings of 15ht International Teletraffic Congress, Washington, DC, pp. 1077-1086, June 1997.

....consider trunk reservation to be a part of routing feature, and we classify admission control to be the issue of whether to admit a call to the network before it goes to the routing phase. Multi service dynamic routing has been addressed in recent years by several researchers (see, for example, [4, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38]) of these, only a few of them have considered call admission control with routing. While most of the work by other researchers address traditional performance issues such as call blocking, very few have considered revenue optimization; to our knowledge, issues such as amount of signaling loads ....

W.-P. Wang, B. Jager, D. Tipper and D. Medhi, Fault Recovery Routing in Wide-Area Packet Networks, Proc. of 15h International Teletraffic Congress, Washington, DC, pp. 1077-1086, June 1997.

....small, then all VCs will be rejected. Here we present results for the case where all VCs have the same large rejection cost (e.g. O k = 1000 8 k) An analysis of the affect of varying the rejection cost on connection blocking and the routes selected is given in the extended version of this paper [20]. The fault recovery restoration routing optimization problem is defined by (1) 4) together with a specific link cost formula (i.e. one of (5) 9) and a rejection cost. For the solution to the optimization problem we adopt the branch and bound approach discussed in [17] which was implemented ....

.... Knapsack problem has an overall time complexity of O(PKlogK P 2 ) Here K denotes the number of VCs affected by the failure and P denotes the average number of paths for rerouting the affected VCs (i.e. P = 1 k P K k=1 P k ) Several numerical computational experiments are given in [20] confirming the complexity cost. The solution to the optimization problem above requires global knowledge of the network after the failure, and hence can only be implemented in a centralized fashion. For example, a central network control center could obtain knowledge of the failure and the ....

[Article contains additional citation context not shown here]

W. Wang, D. Tipper, B Jaeger, and D. Medhi, "Fault Recovery Routing in Wide Area Packet Networks," technical report, University of Pittsburgh, August, 1996. available by anonymous ftp to violet.tele.pitt.edu.

....grant NCR 9506652 On Fault Recovery Priority in ATM Networks, B. Jager 2 I Introduction A basic challenge in ATM networking is meeting user demand for reliability and fault tolerance in a cost effective manner. The topic of fault recovery in ATM networks has received special attention recently [1, 2, 3, 4, 5, 6, 7]. This work focuses primarily on facility (i.e. physical) layer restoration or logical layer layer (i.e. virtual path (VP) layer in ATM) restoration and mainly for a single link failure. At the facility layer most of the work has been on provisioning spare network capacity in the form of SONET ....

....not available, or can not address a particular failure. Fault recovery at the VC level has the advantage of making maximum use of network resources since the demand is being restored in small units of bandwidth. Recently, work on fault recovery for ATM networks at the VC layer has begun to appear [6, 7], focusing on routing after a failure. One aspect of fault recovery at the VP and VC level that has been ignored is the ordering of VPs and VCs for rerouting, this problem can be seen by considering an arbitrary wide area ATM network which uses source node routing of the virtual circuits. In ....

[Article contains additional citation context not shown here]

W.P. Wang, D. Tipper, B. Jaeger and D. Medhi, "Fault Recovery Routing in Wide Area Packet Networks, Proceedings of 15th International Teletraffic Congress, Washington, DC, June 1997.

No context found.

W. P.Wang, D. Tipper, B. Jger, and D. Medhi, \Fault Recovery Routing in Wide Area Packet Networks," Proceedings of the 15th International Teletrac Congress - ITC 15,Washington, DC, 22-27 June 1997, pp. 1077-1086, Elsevier Science B. V. 1997. 32

No context found.

W. P. Wang, D. Tipper, B. Jger, and D. Medhi, \Fault Recovery Routing in Wide Area Packet Networks," Technical Report, University of Pittsburgh, August, 1996.

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