Novel algorithm of finding good candidate pre-configuration cycles in survivable WDM mesh network
Tai-fei Zhao , Hong-fang Yu , Le-min Li
Optoelectronics Letters ›› 2006, Vol. 2 ›› Issue (6) : 445 -448.
Novel algorithm of finding good candidate pre-configuration cycles in survivable WDM mesh network
We present a novel algorithm of finding cycles, called the Fast Cycles Mining Algorithm (FCMA), for efficient p-cycle network design in WDM networks. The algorithm is also flexible in that the number and the length of cycles generated are controlled by several input parameters. The problem of wavelength assignment on p-cycle is considered in the algorithm. This algorithm is scalable and especially suitable for survivable WDM mesh networks. Finally, the performance of the algorithm is gauged by running on some real world network topologies.
| [1] |
W. D. Grover and D. Stamatelakis,In Proc. of IEEE ICC, 1998, 537. |
| [2] |
D. B. Johnson,Proc. of IEEE ICC, 2002, 2756. |
| [3] |
Chang Liu and Lu Ruan,ICCCN 2004.Chicago. IEEE. 2004, 321. |
| [4] |
J. Doucette, D. He, W. D. Grover, and O. Yang,Proceedings of the Fourth International Workshop on the Design of Reliable Communication Networks (DRCN 2003), 2003, 212. |
| [5] |
|
| [6] |
W. D. Grover and J. E. Doucette,Proceedings of the IEEE-LEOS Summer Topical Meeting on All Optical Networking, 2002, WA 2-49-WA2-50. |
| [7] |
M. Listanti, M. Berdusco, and R. Sabella, inProc., IEEE GLOBECOM"97, 1997, S16.7. |
| [8] |
P. Batchelor, Ultra high capacity optical transmission networks:Final report of action COST 239, http://web.cnlab.ch/cost239/,1999. |
/
| 〈 |
|
〉 |
PDF
