Traffic grooming based on shortest path in optical WDM mesh networks

  • Authors:
  • Yeo-Ran Yoon;Tae-Jin Lee;Min Young Chung;Hyunseung Choo

  • Affiliations:
  • Lambda Networking Center, School of Information and Communication Engineering, Sungkyunkwan University, Korea;Lambda Networking Center, School of Information and Communication Engineering, Sungkyunkwan University, Korea;Lambda Networking Center, School of Information and Communication Engineering, Sungkyunkwan University, Korea;Lambda Networking Center, School of Information and Communication Engineering, Sungkyunkwan University, Korea

  • Venue:
  • ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part III
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper investigates the static traffic grooming in WDM optical mesh networks. Our objective is to improve the network throughput and to minimize the blocking probability. As take care of this problem efficiently, we propose Shortest-path First Traffic grooming(SFT) algorithm. The comprehensive computer simulation shows that our proposed algorithm is up to about 14% superior to the existing one known to be effective.