Share Email Print

Proceedings Paper

Multicast traffic grooming in WDM networks
Author(s): Ahmed E. Kamal; Raza Ul-Mustafa
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

This paper considers the problem of grooming multicast traffic in WDM networks, with arbitrary mesh topologies. The problem is different from grooming of unicast traffic, since traffic can be delivered to destinations through other destinations in the same set, or through branching points. The paper presents an optimal Integer Linear Programming (ILP) formulation in order to minimize the cost of the network in terms of the number of SONET Add/Drop Multiplexers (ADM). The formulation also minimizes the number of wavelength channels used in the network, and does not allow bifurcation of traffic. Since the ILP formulation is able to solve limited size problems, the paper also introduces a heuristic approach to solve the problem.

Paper Details

Date Published: 1 October 2003
PDF: 12 pages
Proc. SPIE 5285, OptiComm 2003: Optical Networking and Communications, (1 October 2003); doi: 10.1117/12.533163
Show Author Affiliations
Ahmed E. Kamal, Iowa State Univ. (United States)
Raza Ul-Mustafa, Iowa State Univ. (United States)

Published in SPIE Proceedings Vol. 5285:
OptiComm 2003: Optical Networking and Communications
Arun K. Somani; Zhensheng Zhang, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?