Survivability and Traffic Grooming in WDM Optical Networks
Providing detailed coverage of key issues in modern optical networks, this highly useful book provides a framework for dealing with survivability and traffic grooming in wide-area networks.
TABLE OF CONTENTS Survivability and Traffic Grooming in WDM Optical Networks
19.7: Light Trail Hop-length Limit: Tlmax = 5
19.7 Light Trail Hop-length Limit: Tl max = 5
When Tl max increases to 5, the running time for solving the ILP formulation increases dramatically. This is because, as mentioned earlier, the number of candidate paths increases very fast as Tl max increases. This increase introduces a significant number of variables and constraints in the ILP formulation. The optimal solution contains 10 light trails: the detailed results are shown in Table 19.7. The heuristic algorithms give solutions in a timescale of seconds. The better solution obtained from using both best-fit increasing packing order and best-fit decreasing packing order consists of 13 light trails as shown in Table 19.8.
| No. | Light trails | Hops | Accommodated s d pairs | Load |
|---|---|---|---|---|
| 1 | {1, 2, 3, 4, 7, 6} | 5 | (1, 4) (1, 6) (1, 7) (3, 6) (4, 6) | 39 |
| 2 | {2, 1, 6, 7, 9, 10} | 5 | (2, 1) (2, 6) (2, 7) (2, 9) (2, 10) (1, 9) (1, 10) (9, 10) (6, 9) (6, 10) | 47 |
| 3 | {3, 4, 7, 8, 10, 9} | 5 | (3, 7) (3, 8) (3, 10) (4, 7) (4, 8) (4, 9) (4, 10) (7, 8) (7, 9) (10, 9) | 42 |
| 4 | {4, 3, 2, 1, 5, 8} | 5 | (4, 1) (4, 5) (3, 2) (3, 1) (3,... |
Copyright Cambridge University Press 2005 under license agreement with Books24x7
