Computer Science – Networking and Internet Architecture
Scientific paper
2006-10-27
Computer Science
Networking and Internet Architecture
16 pages; Guangxi, Guilin, Proceeding of the 10th International Conference on Intelligent Technologies, pp. 524-533
Scientific paper
Traffic grooming is widely employed to reduce the number of ADM's and wavelengths. We consider the problem of grooming of dynamic traffic in WDM tree and star networks in this paper. To achieve better results, we used the bifurcation techniques to the grooming of arbitrary dynamic traffic in a strictly non-blocking manner in networks. Three splitting methods, including Traffic-Cutting, Traffic-Dividing and Synthesized-Splitting were proposed. A genetic algorithm (GA) approach based on these methods was proposed to tackle such grooming problems in tree and star networks. The performance of these algorithms was tested under different conditions in star and tree networks. Computer simulation results showed that our algorithm is efficient in reducing both the numbers of ADM's and wavelengths.
Huang De-shuang
Liu Kun-hong
Xu Yong
No associations
LandOfFree
A Genetic Algorithm Approach to the Grooming of Dynamic Traffic in Tree and Star Networks with Bifurcation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A Genetic Algorithm Approach to the Grooming of Dynamic Traffic in Tree and Star Networks with Bifurcation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Genetic Algorithm Approach to the Grooming of Dynamic Traffic in Tree and Star Networks with Bifurcation will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-169259