Skip to Main Content
Under the constraints of the number of transceivers per node and wavelength continuity, the fairness issue of connections with different bandwidth granularities in traffic-grooming WDM mesh networks is investigated. Based on an auxiliary graph model, two fairness-based dynamic grooming algorithms are proposed. We evaluate the performance of our schemes via simulations. The results show that they provide good fairness while at the same time ensure a small increase in the overall traffic blocking probability.