Name
Abstract | ||
|---|---|---|
In this paper, a genetic algorithm is proposed for grooming of arbitrary traffic in optical mesh networks. Traffic streams are routed in the wavelength division multiplexing ( WDM) grooming networks that comprise both fiber links and established light-paths. Chromosomes are split into multiple versions when multiple shortest routes are found. The selection strategy is based on a comparison between chromosomes. A variety of cost functions are proposed for the routing algorithm and two comparison methods are considered in the selection procedure. Computer simulations are performed with randomly generated traffic patterns. The results show that the algorithm is effective for traffic grooming ( TG) problems, and also for routing and wavelength assignment problems. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/s11107-005-2483-3 | PHOTONIC NETWORK COMMUNICATIONS |
Keywords | Field | DocType |
traffic grooming,genetic algorithm,WDM,mesh network | Wavelength-division multiplexing,Mesh networking,Wdm mesh networks,Optical mesh network,Computer science,Routing and wavelength assignment,Computer network,Genetic algorithm,Distributed computing,Traffic grooming,Routing algorithm | Journal |
Volume | Issue | ISSN |
10 | 2 | 1387-974X |
Citations | PageRank | References |
2 | 0.38 | 4 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yueguang Jiao | 1 | 4 | 0.74 |
| Bingkun Zhou | 2 | 12 | 6.22 |
| Hanyi Zhang | 3 | 72 | 16.35 |
| Yili Guo | 4 | 21 | 5.01 |