Bounds on Traffic Grooming in Star and Tree Networks

Abstract

We consider the problem of grooming traffic in WDM star and tree networks to minimize equipment cost. We prove an important result regarding wavelength assignment in both topologies. We present a series of lower and upper bounds on the optimal solutions for both star and tree networks. The bounds allow us to evaluate a set of heuristics we also develop