期刊名称：International Journal of Advanced Research in Computer Engineering & Technology (IJARCET)
印刷版ISSN：2278-1323
出版年度：2014
卷号：3
期号：11
页码：3905-3909
出版社：Shri Pannalal Research Institute of Technolgy
摘要：Wavelength division multiplexing (WDM) optical networks with traffic grooming routes and consolidates sub-wavelength Connections onto light paths, to improve network usage and to reduce its Cost. It can be classified into dynamic or static depending on its connections that are given in advance or randomly arrive in/depart out. In this paper, an analytical model is developed for dynamic traffic groo ming, allowing asymmetric data rates for sub-wavelength connections, arbitrary alternate routing in both physical and dynamic topologies, and arbitrary wavelength conversion. We propose Max Connectivity grooming in WDM mesh networks under Dynamic traffic light path connection requests. The wavelength and grooming conversion resources are placed at the nodes having maximum connections which are most cost effective compared to other grooming. We propose a heuristic genetic algorithm (GA) model which has to solve groo ming problems with routing and wavelength assignment. To optimize the cost of grooming and wavelength conversion resources the G A algorithm has been used. The blocking probability was investigated under different light path co nnections. The performance of Max Connectivity grooming has been co mpared with other groo ming policies. Our results in this paper indicate the improvement in resource utilization which has minimum blocking probability.
关键词：wavelength division multiplexing (WDM); ; static and dynamic traffic grooming; genetic algorithm ; (GA); Max Connectivity grooming
