서지주요정보
An optimal cost and high efficient traffic grooming algorithm for large WDM networks
서명 / 저자 An optimal cost and high efficient traffic grooming algorithm for large WDM networks / Nguyen Thi Thanh Thao.
저자명 Nguyen Thi Thanh Thao
발행사항 [대전 : 한국정보통신대학교, 2006].
Online Access 원문보기 원문인쇄

소장정보

등록번호

DM0000761

소장위치/청구기호

문지도서관2층 학위논문

ICU/MS06-75 2006

휴대폰 전송 소장위치

도서상태

이용가능

대출가능

반납예정일

초록정보

Wavelength division multiplexing (WDM) is a key technology that makes a massive increase in optical network bandwidth. The emerging problem is how to optimize the optical network capacity efficiently. Traffic grooming is an efficient technique to utilize network resources by packing low speed traffic streams onto a high-speed lightpath, using cross-connections of conversions between different transport systems or layers within the same system [1]. Most existing traffic grooming algorithms have high complexities and do not consider costs paid for the systems. To improve these limitations, this thesis introduces a simple but very effective traffic grooming approach called time and cost efficient traffic grooming algorithm (TCGA). The proposed algorithm spends two stages. First, I reduce the complexity of an algorithm by removing redundant nodes in the process of building reachability graph. Then I propose the cost functions to determine the optimal grooming path for the new connection request. The simulation results show that my algorithm has a lower complexity compared with existing ones, an optimal cost and an acceptable blocking performance.

서지기타정보

서지기타정보
청구기호 {ICU/MS06-75 2006
형태사항 v, 54 p. : 삽도 ; 26 cm
언어 영어
일반주기 지도교수의 영문표기 : Man-Seop Lee
지도교수의 한글표기 : 이만섭
학위논문 학위논문(석사) - 한국정보통신대학교 : 공학부,
서지주기 References : p. 48-50
QR CODE qr code