Grooming of Dynamic Traffic in WDM Star and Tree Networks Using Genetic Algorithm

Simple item page
dc.creatorLiu, Kun-hong
dc.creatorXu, Yong
dc.creatorHuang, De-shuang
dc.creatorCheng, Min
dc.date2006-10-26
dc.date.accessioned2026-07-07T09:33:18Z
dc.date.available2026-07-07T09:33:18Z
dc.descriptionThe 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.
dc.description15 pages
dc.identifierhttps://arxiv.org/abs/cs/0610147
dc.identifierhttp://arxiv.org/abs/cs/0610147
dc.identifierPhotonic Network Communications,Volume 15, Number 2, 2008
dc.identifierdoi:10.1007/s11107-007-0103-0
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/159089
dc.subjectNetworking and Internet Architecture
dc.titleGrooming of Dynamic Traffic in WDM Star and Tree Networks Using Genetic Algorithm
dc.typetext

Files

Collections

arXiv