Grooming of Dynamic Traffic in WDM Star and Tree Networks Using Genetic Algorithm
Kun-hong Liu, Yong Xu, De-shuang Huang, Min Cheng
Abstract
The advances in WDM technology lead to the great interest in traffic grooming problems. As traffic often changes from time to time, the problem of grooming dynamic traffic is of great practical value. In this paper, we discuss dynamic grooming of traffic in star and tree networks. A genetic algorithm (GA) based approach is proposed to support arbitrary dynamic traffic patterns, which minimizes the number of ADM's and wavelengths. To evaluate the algorithm, tighter bounds are derived. Computer simulation results show that our algorithm is efficient in reducing both the numbers of ADM's and wavelengths in tree and star networks.
Create a lesson
Related papers
FaulT-Bench: Towards Benchmarking Network Troubleshooting LLM Agents under Unreliable User Tickets
Kuan-Hao Tseng, Niruth Bogahawatta, Yasod Ginige et al.
Claude Code Complete User Handbook
David Soldani
Extending Low Latency Service Across the Internet
Harkirat Singh, Fatih Berkay Sarpkaya, Hakan Gulec et al.
SFC-Aware Online Aggregated Data-Link Orchestration for SDN/NFV-Enabled SAGINs
Ziyang Guo, Bing Du
PRO-RAN: Processor-Level Characterization of Open RAN Centralized and Distributed Units
Moojan Kamalzadeh, Larry Horner, Linqi Xiao et al.
SlimTCP: It's fast, but not because it's slim
Mihai Drosi Caju, Costin Raiciu