On lightpath scheduling in service differentiated survivable WDM mesh networks

Abstract

Service differentiated survivable WDM mesh networks providing dedicated path protection and shared path protection are investigated under scheduled traffic. Scheduled routing with holding-time aware and unaware are studied for comparison. To tackle the service provisioning problem, an integer linear programming(ILP) formulation is presented for either situation to find the optimal service provisioning solution for a given set of traffic demands. Numerical results show that over 48% capacity savings are achieved when the holding-time knowledge is exploited.