p-Cycle design without candidate cycle enumeration in mixed-line-rate optical networks

摘要

This paper develops and evaluates a new protection solution for pre-configured-cycle (p-cycle) design in Mixed-Line-Rate (MLR) optical networks. Conventional p-cycle approaches require enumerating candidate cycles in advance and screening p-cycles using heuristic algorithms. Our method generates p-cycles directly in one-step using an Integer Linear Programming (ILP) model. Cost-effective transponders and distance-adaptive line rates are provisioned for every p-cycle to minimize joint cost of transponders and spare capacity. The design problem is solved together with spectral clustering based graph partitioning, which permits to compute the optimal solution in independent sub-graphs concurrently. The results show that our protection method is cost-efficient for p-cycle design with mixed line rates and scalable for large optical networks.