Name
Abstract | ||
|---|---|---|
In this paper, we solve a mapping problem related to supporting two service classes that are differentiated based on their level of protection. The first class of service, called Fully Protected (FP), offers end-users a guarantee of survivability in the case Ora single failure; all FP traffic is protected using either a 1:1 or 1 + 1 protection scheme at the WDM layer. The second class of service, called Best-Effort Protected (BEP), is not protected; instead restoration at the IP layer is provided. When a failure occurs, the network restores as much BEP traffic as possible, and thus BEP traffic does not receive any specific guarantees. The FP service class mimics what Internet users receive today. The BEP traffic is designed to run over the large amounts of unused bandwidth that exist in today's Internet. The motivation of this approach is to give carriers a mechanism for increasing the load carried on backbone networks without reducing the QoS received by existing customers. In order to support two such services, the logical links at the IP layer need to be carefully mapped onto primary and backup paths at the optical layer. We incorporate into our mapping problem a number of practical requirements that reflect constraints that carriers face and policies they want to enforce. For example, we allow the FP demand to be specified via a traffic matrix at the IP layer, we include an overprovisioning factor that specifies the portion of each link that must be left unused, and we incorporate a minimal fairness requirement on how the BEP traffic is allocated among connections. Our goal is to quantify how much BEP traffic can be carried in addition to the FP traffic, without impacting the protection quality of the FP traffic even in the case of failure, and without impacting the FP load. We provide two solutions, one is an optimal solution using an Integer Linear Program (ILP) model, and the other is an algorithm based on the Tabu Search (TS) methodology. Our heuristic algorithm allows us to solve this problem for large networks such as those spanning the continental US. We show that by having two such classes of service, the load on a network can be increased by a factor of 4-7 (depending upon the network). We illustrate that even with overprovisioning and fairness requirements (both of which reduce the total possible BEP load carried), we can still typically triple the total network load. We show that the location of the bottleneck can affect whether or not we see a difference in performance between 1: 1 or I + I protection schemes. Our results illustrate the gain in terms of additional BEP load carried that can be obtained simply due to the upgrade of a single link. Our proposal provides carriers a new vehicle for generating revenue by extracting benefit from all the sources of unused bandwidth in networks. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/s11107-005-4531-4 | PHOTONIC NETWORK COMMUNICATIONS |
Keywords | Field | DocType |
QoS,protection,restoration,network design | Bottleneck,Survivability,Network planning and design,Heuristic (computer science),Computer science,Quality of service,Computer network,Bandwidth (signal processing),Backup,Class of service,Distributed computing | Journal |
Volume | Issue | ISSN |
9 | 1 | 1387-974X |
Citations | PageRank | References |
5 | 0.57 | 8 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Antonio Nucci | 1 | 691 | 49.28 |
| Nina Taft | 2 | 2109 | 154.92 |
| Patrick Thiran | 3 | 2712 | 217.24 |
| Hui Zang | 4 | 1052 | 77.25 |
| Christophe Diot | 5 | 7831 | 590.69 |