Share Email Print
cover

Proceedings Paper

Survivable traffic grooming in WDM ring networks
Author(s): Srikanth Sankaranarayanan; Suresh Subramaniam; Hongsik Choi; Hyeong-Ah Choi
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

Traffic grooming, in which low-rate circuits are multiplexed onto wavelengths, with the goal of minimizing the number of add-drop multiplexers (ADMs) and wavelengths has received much research attention from the optical networking community in recent years. While previous work has considered various traffic models and network architectures, protection requirements of the circuits have not been considered for the most part. In this paper, we consider survivable traffic grooming, or grooming traffic which contains a mix of circuits that need protection and that do not need protection. We assume a unidirectional ring network with all-to-all symmetric traffic with t greater than or equal to 1 circuits between each node pair, of which s require protection. As it turns out, survivable traffic grooming presents a significant tradeoff between the number of wavelengths and the number of ADMs, which is almost non-existent in non-survivable traffic grooming for this type of traffic. We explore this tradeoff by establishing bounds and optimal results for some specific cases in this paper.

Paper Details

Date Published: 1 October 2003
PDF: 11 pages
Proc. SPIE 5285, OptiComm 2003: Optical Networking and Communications, (1 October 2003); doi: 10.1117/12.533189
Show Author Affiliations
Srikanth Sankaranarayanan, George Washington Univ. (United States)
Suresh Subramaniam, George Washington Univ. (United States)
Hongsik Choi, George Washington Univ. (United States)
Hyeong-Ah Choi, George Washington 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