Multicast traffic grooming in WDM networks

Ahmed E. Kamal; Raza Ul-Mustafa

doi:10.1117/12.533163

1 October 2003 Multicast traffic grooming in WDM networks

Ahmed E. Kamal, Raza Ul-Mustafa

Proceedings Volume 5285, OptiComm 2003: Optical Networking and Communications; (2003) https://doi.org/10.1117/12.533163
Event: OptiComm 2003: Optical Networking and Communications, 2003, Dallas, TX, United States

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.

Citation Download Citation

Ahmed E. Kamal and Raza Ul-Mustafa "Multicast traffic grooming in WDM networks", Proc. SPIE 5285, OptiComm 2003: Optical Networking and Communications, (1 October 2003); https://doi.org/10.1117/12.533163

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available