Fairness-based traffic grooming in survivable WDM mesh networks

Abstract

Under the constraints of the number of transceivers per node and wavelength continuity, the fairness issue of connections with different bandwidth granularities in survivable traffic-grooming WDM mesh networks is investigated. An extended wavelength-plane graph (EWG) model and two dynamic grooming path protection algorithms with considering blocking fairness are proposed. Based on dynamic traffic with different load, the performance of our schemes has been evaluated via simulations. The results show that they provide good blocking fairness while at the same time ensure a small increase in the overall traffic blocking probability.