• 제목/요약/키워드: Dynamic lightpath establishment

검색결과 3건 처리시간 0.014초

Design of Low Power All-Optical Networks with Dynamic Lightpath Establishment

  • Hirata, Kouji;Ito, Kohei;Fukuchi, Yutaka;Muraguchi, Masahiro
    • Journal of Communications and Networks
    • /
    • 제18권4호
    • /
    • pp.551-558
    • /
    • 2016
  • In multifiber all-optical networks, optical amplifiers are used for amplifying multiple optical signals with different wavelengths in fibers. An optical amplifier operates when any of lightpaths passes through it. Therefore, it should simultaneously amplify as many lightpaths as possible for efficiently utilizing its power. This paper proposes a dynamic lightpath establishment scheme considering the use efficiency of the optical amplifiers and the depletion of the wavelength resources in multifiber all-optical networks. The proposed scheme provides a routing and wavelength assignment strategy that reduces both the power consumption of the optical amplifiers and the blocking probability of the lightpath establishment. Through simulation experiments, we demonstrate the effectiveness of the proposed scheme.

파장분할다중화방식 전광통신망에서 다중홉 연결 알고리즘 (Multihop Connection Establishment Algorithms in Wavelength-Routed Optical Networks)

  • 김상완;서승우
    • 한국통신학회논문지
    • /
    • 제25권7A호
    • /
    • pp.951-958
    • /
    • 2000
  • 파장분할다중화방식 전광통신망에서는 신호가 먼 거리를 진행할 경우, ASE(Amplified Spontaneous Emission) 잡음이나 누화(Crosstalk)와 같은 물리적 제약으로 인해 신호가 손상된다. 소낫ㅇ된 신호를 회복시키기 위해서는 광신호를 중간 노드에서 재생(signal regeneration)해야 하지만, 신호 재생은 추가의 네트워크 자원을 필요로 하기 때문에 재생 노드(Signal Regeneration Node, SRN)는 다른 광경로의 블록킹을 최소화하도록 신중히 선택해야 한다. 이 논문에서는 물리적인 제약 하에서 다중홉 방식으로 광경로를 설정하는 문제에 대해 최소비용 알고리즘(Minimal-Cost Placement Algorithm, MCPA)과 휴리스틱 알고리즘들을 제안하다. 최소비용 위치선정 알고리즘은 다이내믹 프로그래밍을 이용하여 송수신기나 파장의 부족으로 인한 다른 광경로들의 블록킹을 최소화하도록 공식화하였다.

  • PDF

SPARK: A Smart Parametric Online RWA Algorithm

  • Palmieri, Francesco;Fiore, Ugo;Ricciardi, Sergio
    • Journal of Communications and Networks
    • /
    • 제9권4호
    • /
    • pp.368-376
    • /
    • 2007
  • The large potential bandwidth available in wavelength-division multiplexed optical networks makes this technology of crucial importance for satisfying the ever increasing capacity requirements of the next-generation Internet. In this scenario, the routing and wavelength assignment(RWA) problem that concerns determining the optical paths and wavelengths to be used for connection establishment in a wavelength-routed network, is still one of the most important open issues. In this paper we propose a new online dynamic grooming-capable RWA heuristic scheme working on wavelength division multiplexing(WDM) networks as a multistage selection process. The proposed algorithm is transparent with respect to the presence of wavelength converters, achieves very low connection rejection ratios with minimal computational complexity and is appropriate for the modern multilayer optical circuit and wavelength switched networks with sparse wavelength conversion capability.