Date Added: Nov 2009
This paper addresses the problem of finding a static virtual topology design and flow routing in transparent optical WDM networks under a time-varying (multi-hour) traffic demand. Four variants of the problem are considered, using fixed or dynamically adaptable (i.e., variable) flow routing, which can be splittable or unsplittable. The authors' main objective is to minimize the number of transceivers needed which make up for the main network cost. They formulate the problem variants as exact ILPs (Integer Linear Programs) and MILPs (Mixed ILPs).