In this paper, we address the traffic grooming problem in WDM mesh networks when the offered traffic is characterized by a set of traffic matrices—a variant of dynamically changing traffic. We justify the need to address this problem in mesh networks and also argue for the validity of our approach to solve this problem. Our primary objective is to design the network in terms of the number of wavelengths and transceivers required to support any offered traffic matrix. We provide a simple and generic framework to minimize the number of transceivers needed in the network. Simulation results have been presented in contrast with a possible approach, to enable comparison with our solution strategy. An ILP formulation of our approach is also presented.