Share Email Print

Proceedings Paper

Minimal-delay traffic grooming for WDM star networks
Author(s): Hongsik Choi; Nikhil Garg; Hyeong-Ah Choi
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

All-optical networks face the challenge of reducing slower opto-electronic conversions by managing assignment of traffic streams to wavelengths in an intelligent manner, while at the same time utilizing bandwidth resources to the maximum. This challenge becomes harder in networks closer to the end users that have insufficient data to saturate single wavelengths as well as traffic streams outnumbering the usable wavelengths, resulting in traffic grooming which requires costly traffic analysis at access nodes. We study the problem of traffic grooming that reduces the need to analyze traffic, for a class of network architecture most used by Metropolitan Area Networks; the star network. The problem being NP-complete, we provide an efficient twice-optimal-bound greedy heuristic for the same, that can be used to intelligently groom traffic at the LANs to reduce latency at the access nodes. Simulation results show that our greedy heuristic achieves a near-optimal solution.

Paper Details

Date Published: 1 October 2003
PDF: 9 pages
Proc. SPIE 5285, OptiComm 2003: Optical Networking and Communications, (1 October 2003); doi: 10.1117/12.533184
Show Author Affiliations
Hongsik Choi, Virginia Commonwealth Univ. (United States)
Nikhil Garg, 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