1 October 2003 Minimal-delay traffic grooming for WDM star networks
Author Affiliations +
Proceedings Volume 5285, OptiComm 2003: Optical Networking and Communications; (2003) https://doi.org/10.1117/12.533184
Event: OptiComm 2003: Optical Networking and Communications, 2003, Dallas, TX, United States
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.
© (2003) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Hongsik Choi, Hongsik Choi, Nikhil Garg, Nikhil Garg, Hyeong-Ah Choi, Hyeong-Ah Choi, } "Minimal-delay traffic grooming for WDM star networks", Proc. SPIE 5285, OptiComm 2003: Optical Networking and Communications, (1 October 2003); doi: 10.1117/12.533184; https://doi.org/10.1117/12.533184


Back to Top