Name
Abstract | ||
|---|---|---|
Current approaches to providing robust network connections which are tolerant to failures involve restoration schemes which mainly focus on reserving backup paths. In this paper we propose a technique for which avoids the extra cost for reserving, by pre-identifying (but not reserving) the backup paths. We present and analyze an algorithm to solve this problem and study a practical special case in detail. Through simulations we show that our model is significantly more cost-efficient than backup path reservation. We also show how this model can fit into the MPLS architecture |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1109/QSHINE.2005.41 | QSHINE |
Keywords | Field | DocType |
mpls networks,restoration scheme,current approach,multiprotocol label switching,path protection,backup path reservation,practical special case,robust network connection,extra cost,backup path,mpls architecture,cost efficiency | Reservation,Backup path,Architecture,Multiprotocol Label Switching,Computer science,Computer network,Path protection,Backup,Distributed computing,Special case | Conference |
ISBN | Citations | PageRank |
0-7695-2423-0 | 0 | 0.34 |
References | Authors | |
7 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dan Wang | 1 | 169 | 13.41 |
| Funda Ergun | 2 | 151 | 10.13 |