Abstract
We consider the problem of traffic grooming in
wavelength-division-multiplexing (WDM) rings. Our objective is to minimize the
required number of electronic add–drop multiplexers. We first formulate the problem
as an integer linear programming (ILP) problem, and we then show that this ILP
problem can be converted into an equivalent mixed ILP (MILP) problem in which a
large number of integer variables in the original ILP can be relaxed to continuous
variables. The resulting MILP problem is much easier to solve. For ring networks
found in most applications (e.g., access and interoffice rings), which typically
have less than 20 nodes, it can produce optimal or near-optimal solutions in a few
seconds or minutes by use of commercially available linear programming software,
such as CPLEX, on a PC. We also discuss how our ILP formulation can be extended to
more-general traffic grooming problems, such as networks with dynamic traffic and
how to take the number of wavelengths into consideration. Finally, numerical
examples are presented.
© 2002 Optical Society of America
PDF Article
More Like This
Cited By
You do not have subscription access to this journal. Cited by links are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.
Contact your librarian or system administrator
or
Login to access Optica Member Subscription