## Routing Restorable Bandwidth Guaranteed Connections using Maximum 2-Route Flows (2002)

### Cached

### Download Links

- [www.ieee-infocom.org]
- [suraj.lums.edu.pk]
- [www.glue.umd.edu]
- [www.ecse.rpi.edu]
- [www.ecse.rpi.edu]
- DBLP

### Other Repositories/Bibliography

Venue: | IEEE/ACM Transactions on Networking |

Citations: | 30 - 0 self |

### BibTeX

@INPROCEEDINGS{Kar02routingrestorable,

author = {Koushik Kar and Murali Kodialam and T.V. Lakshman},

title = {Routing Restorable Bandwidth Guaranteed Connections using Maximum 2-Route Flows},

booktitle = {IEEE/ACM Transactions on Networking},

year = {2002},

pages = {2003}

}

### Years of Citing Articles

### OpenURL

### Abstract

Routing with service restorability is of much importance in Multi-Protocol Label Switched (MPLS) networks, and is a necessity in optical networks. For restoration, each connection has an active path and a disjoint backup path. The backup path enables service restoration upon active path failure. For bandwidth efficiency backups may be shared. This requires that at least the aggregate backup bandwidth used on each link be distributed to nodes performing route computations. If this information is not available, sharing is not possible. Also, one scheme in use for restorability in optical networks is for the sender to transmit simultaneously on the two disjoint paths and for the receiver to choose data from the path with stronger signal. This has the advantage of fast receiver-initiated recovery upon failure but it does not allow backup sharing.

### Citations

270 | Faster and simpler algorithms for multicommodity flow and other fractional packing problems
- Garg, Könemann
- 1998
(Show Context)
Citation Context ...e do not need to keep track of the flows on each disjoint path pair, and the time complexity does not depend on the number of disjoint path pairs. The approach is based on a work by Garg and Konemann =-=[7]-=-, in which they propose -approximation algorithms for multicommodity flows and some other fractional packing problems. This kind of approach applies in our case too, and allows us to develop a simpl... |

111 | Dynamic routing of bandwidth guaranteed tunnels with restoration
- Kodialam, Lakshman
- 2000
(Show Context)
Citation Context ...estoration since only the receiver needs to detect and act upon failure. In this paper, we consider the problem of dynamic routing of restorable connections. This is similar to the problem studied in =-=[12]-=-. However, in [12] the emphasis is on the development of algorithms that permit efficient backup sharing while using only aggregate information on active and backup link usage. The no sharing case is ... |

87 |
A Quick Method for Finding Shortest Pairs of Disjoint Paths
- Suurballe, Tarjan
- 1984
(Show Context)
Citation Context ...terference to the problem of determining the path set (two disjoint paths) that minimizes the sum of the criticality indices of the links in the path set. We use the algorithm of Suurballe and Tarjan =-=[14]-=- to solve this disjoint path problem as outlined in Section IV. III. PROBLEM STATEMENT Let !#"$ % &' describe the given network, where " is % & ( ) the set of routers (nodes) and the set of links (edg... |

68 |
Solving minimum-cost flow problems by successive approximations, extended abstract, submitted to STOC 87
- Goldberg
- 1986
(Show Context)
Citation Context ...roof of correctness of the above algorithm can be found in [11]. The maxflow between two nodes in a network can be computed in ~s^( )A time by the Goldberg Tarjan highest label preflow push algorithm =-=[8]-=-. Since this algorithm solves at most three maxflow problems, the running time of the algorithm is ~u^( )c . B. 2-Critical Link Computation The solution of the maximum 2-route flow is now used to comp... |

67 | Minimum Interference Routing of Bandwidth Guaranteed Tunnels with MPLS Traffic Engineering Applications
- Kar, Kodialam, et al.
- 2000
(Show Context)
Citation Context ...ntext of optical networks, see [3] and the references therein. For dynamic routing of non-restorable connections, a recently proposed algorithm that performs very well is minimum interference routing =-=[9]-=-. Here the idea is that a newly routed connection’s path must not interfere too much with paths that might be critical to satisfy future demands (as explained in more detail later). In this paper, we ... |

19 |
A method for obtaining the maximum multiroute flows in a network
- Kishimoto
- 1996
(Show Context)
Citation Context ...re too much with potential future demands between different ingress-egress pairs. To define interference concretely for the restorable routing problem, we require the concept of maximum 2-route flows =-=[11]-=- [1], which we describe below. A. Maximum 2-route Flow Recall that routing of a restorable demand has to be done over a pair of link-disjoint paths (one for the active and the other for the backup). A... |

15 |
Traffic Engineering Extensions
- Katz, Yeung
- 1999
(Show Context)
Citation Context ...providing backup. While this can be disseminated by simple extensions to link-state routing protocols, current extensions only disseminate link status and the bandwidth used for carrying active paths =-=[10]-=-. Sharing is also not possible when the sender simultaneously transmits on both paths and the receiver chooses to receive data from the path with the stronger signal. This scheme has been used in opti... |

9 |
Dynamic establishment of protection paths
- Anand, Qiao
- 2000
(Show Context)
Citation Context ... cannot achieve efficiency by sharing, our objective here is to improve performance by improved path selection. For some alternative approaches to this problem in the context of optical networks, see =-=[3]-=- and the references therein. For dynamic routing of non-restorable connections, a recently proposed algorithm that performs very well is minimum interference routing [9]. Here the idea is that a newly... |

4 |
On Multi-Route Maximum Flows in Networks Networks
- Aggarwal, Orlin
- 1997
(Show Context)
Citation Context ...o much with potential future demands between different ingress-egress pairs. To define interference concretely for the restorable routing problem, we require the concept of maximum 2-route flows [11] =-=[1]-=-, which we describe below. A. Maximum 2-route Flow Recall that routing of a restorable demand has to be done over a pair of link-disjoint paths (one for the active and the other for the backup). An el... |

3 |
Tripathi, “Quality of Service Based Routing: A Performance Perspective
- Apostopoulos, Guerin, et al.
- 1998
(Show Context)
Citation Context ...mands are integral, and uniformly distributed between 1 and 3 units. Figure 2 shows the network we consider (experimentation on 3 other networks also yielded similar results). The network, taken from =-=[4]-=-, has 18 nodes and 30 links, and represents a typical ISP network. All link capacities are assumed to be 20 units. Figures 3-5 show the proportion of rejected demands under different load conditions, ... |

1 |
Optical Network Design and Routing
- Doshi
- 1999
(Show Context)
Citation Context ...t both algorithms perform very well in comparison to previously proposed algorithms. I. INTRODUCTION Restoring service after failures is an important issue in both MPLS [5], [13] and optical networks =-=[6]-=-. For restoration, each connection is routed along two disjoint paths: a primary (active path) and a secondary (backup) path. The backup path is used for restoring connectivity if the active path fail... |

1 | Framework for MPLS based Recovery - al - 2001 |

1 |
Framework for MPLS based Recovery”, Internet draft û draft-ietf-mpls-recovery-frmwrk-04.txt ü
- Sharma
- 2001
(Show Context)
Citation Context ...ations. We demonstrate that both algorithms perform very well in comparison to previously proposed algorithms. I. INTRODUCTION Restoring service after failures is an important issue in both MPLS [5], =-=[13]-=- and optical networks [6]. For restoration, each connection is routed along two disjoint paths: a primary (active path) and a secondary (backup) path. The backup path is used for restoring connectivit... |