• Title/Summary/Keyword: Optical WDM Networks

Search Result 154, Processing Time 0.02 seconds

Routing with Maximum Edge Disjoint Paths and Wavelength Assignment with Path Conflict Graph (최대 EDP를 이용한 경로설정 및 경로 충돌 그래프를 이용한 파장할당 문제 해결 방안)

  • Kim Duk Hun;Chung Min Young;Lee Tae-Jin;Choo Hyunseung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.7B
    • /
    • pp.417-426
    • /
    • 2005
  • Routing and wavelength assignment problem is one of the most important issues in optical transport networks based on wavelength division multiplexing(WDM) technique. In this paper, we propose a novel approach using path conflict graphs and an algorithm for finding all edge disjoint paths. And then we compare the performance of the proposed algorithm with that of bounded greedy approach for EDP(BGAforEDP). The proposed one outperforms up to about 20$\%$ in the fixed traditional topology(NSFNET) and about 32$\%$ in random topologies over the BGA for EDP algorithm.

Recent Trends on Technology and Standardization of Next-Generation Optical Access Networks (차세대 광가입자망 기술 및 표준화 동향)

  • Lee, H.H.;Cho, S.H.;Lee, J.H.;Myong, S.I.;Lee, S.S.
    • Electronics and Telecommunications Trends
    • /
    • v.27 no.2
    • /
    • pp.89-98
    • /
    • 2012
  • 광통신 기술의 발달과 인터넷 서비스 수요의 급격한 증가로 2000년대 초반부터 광가입자망 연구 및 상용화가 이루어졌다. 최근에는 스마트폰 등 모바일 단말의 확산과 IPTV의 수요 증대에 따른 폭발적 트래픽 증가에 대처하기 위하여 친환경, 에너지 절감형 차세대 초고속 대용량 광가입자망 기술에 대한 요구가 증대되고 있다. 차세대 광가입자망은 국내뿐 아니라 국외에서도 다양한 프로젝트를 통해 전송 거리, 분기 수 및 전송 용량을 늘리는 방향으로 연구개발이 진행되고 있으며 기존의 TDM, WDM(Wavelength Division Multiplexing) 기술뿐만 아니라 무선 통신에서 사용되던 OFDM(Orthogonal Frequency-Division Multiplexing) 등의 신호변조 기법들을 광가입망 기술에 접목하려는 시도들이 진행되고 있다. 이와 같은 광가입자망 기술들은 ITU-T, IEEE, IEC뿐만 아니라 FSAN(Full Service Access Network), BBF(Broadband Forum), MSF(Multi-service Forum) 등의 표준화 단체에서 활발히 국제표준화가 진행 중이다. 본고에서는 현재 진행되고 있는 차세대 광가입자망 기술에 대한 국내 외 기술개발 현황 및 표준화 현황을 살펴보고자 한다.

  • PDF

WDMA protocol with collision avidance for high speed optical networks (고속 광통신망에서 충돌 회피를 위한 파장 분할 다중 액세스 프로토콜)

  • 이호숙;최형원;박성우;김영천
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.21 no.3
    • /
    • pp.664-674
    • /
    • 1996
  • In high speed multi-wavelength networks, retransmission overhead due to desination conflict or control packet collision is one factor of performance degration because signal prpagation delay is much larger than the transmission time of data packet. In this paper, an efficient WDMA protocol with a collision avoidance mechanism is proposed for high speed WDM single-hop network with a passive star topology. In proposed protocol, each node has cource queues and routing table to store souting informatio. This architecture makes is possible to avoid any kind of collision when a node reserves the channel to transmit a data packet. High system thoughput and channel utilization can be achieved by proposed protocol since there are no discarded packets caused by any collision at transmission time. The performance of proposed protocol is evaluated in term of throughput and delay with variations in offered load. Simulation results show that the proposed protocol has superior performance to convertional protocols under nonuniform traffic as well as uniform traffic.

  • PDF

A Practical RWA Algorithm-based on Lookup Table for Edge Disjoint Paths (EDP들의 참조 테이블을 이용한 실용적 인 경로 설정 및 파장 할당 알고리즘)

  • 김명희;방영철;정민영;이태진;추현승
    • Journal of KIISE:Information Networking
    • /
    • v.31 no.2
    • /
    • pp.123-130
    • /
    • 2004
  • Routing and wavelength assignment(RWA) problem is an important issue in optical transport networks based on wavelength division multiplexing(WDM) technique. It is typically solved using a combination of linear programming and graph coloring, or path selection based graph algorithms. Such methods are either complex or make extensive use of heuristics. In this paper we propose a novel and efficient approach which basically obtains the maximum edge disjoint paths (EDPs) for each source-destination demand pair. And those EDPs obtained are stored in Lookup Table and used for the update of weight matrix. Routes are determined in order by the weight matrix for the demand set. The comprehensive computer simulation shows that the Proposed algorithm uses similar or fewer wavelengths with significantly less execution time than bounded greedy approach (BGA) for EDP which is currently known to be effective in practice.