• 제목/요약/키워드: optical networks

검색결과 622건 처리시간 0.028초

Implementation of Optical neural Netwoks Based on Parallel rank-One Interconnections and Time Integration

  • Jeon, Ho-In;Choi, Jin-San;Shin, Chang-Min;Kang, Yo-Sik;Jung, Nak-Hee
    • 한국광학회:학술대회논문집
    • /
    • 한국광학회 1998년도 제15회 광학 및 양자전자 학술발표회 논문집
    • /
    • pp.220-221
    • /
    • 1998
  • An optical implementation of higher order neural networks based on based principal component analysis and time integration has been described. The principal component analysis combined with time integration allows larger input size than fully spatial neural networks at the cost certain amount of time consumption. This time-integration usage actually breaks down the barrier of the maximum space-bandwidth product that optical systems can offer.

  • PDF

기가급 WDM-PON을 위한 광기술 분석 (Review on the Optical tin]k Technologies for the Gigabit-per-second Wavelength-Division-Multiplexing Passive Optical Networks (WDM-PONs))

  • 박태상;박근열;김진희;윤호성
    • 한국정보통신설비학회:학술대회논문집
    • /
    • 한국정보통신설비학회 2006년도 하계학술대회
    • /
    • pp.11-14
    • /
    • 2006
  • This paper reviews the optical link technologies which have been developed for gigabit-per-second wavelength-division-multiplexing passive optical networks (WDM-PONs). Similarly to the 100Mb/s WDM-PON systems which have been deployed for trial services by KT, the most important requirement for 1Gb/s WDM-PON is wavelength independence (colorless feature) of its ONU/ONTs, which makes possible convenient operation and cost-effective maintenance with minimum inventory cost. Among various methods to implement such colorless feature, four promising candidates for gigabit WDM-PON are analyzed with their own development issues and their expected performances are compared.

  • PDF

WDM 링망의 효율적인 광 파장 할당 알고리즘 (Efficient Optical Wavelength Allocation Algorithms for WDM Ring Networks)

  • 이동춘;신승수;조용환
    • 한국통신학회논문지
    • /
    • 제27권6B호
    • /
    • pp.645-651
    • /
    • 2002
  • 본 논문은 OMS(Optical Multiplex Section) 또는 OCh (Optical Channel) SPRING (Shared Protection Ring)에 적용되는 두 가지 광파장 할당 알고리즘을 제안하고 시뮬레이션을 통해 특성을 비교하였다. 제안한 알고리즘들은 WDM SPRING 네트워크에 적용할 수 있는 최적화 알고리즘과 넌블러킹 알고리즘이며 대부분의 비교에서 최적화 알고리즘이 넌블러킹 알고리즘에 비해 우수함을 보였다. 하지만, 넌블러킹 알고리즘도 몇몇 기존 연결을 재구성하기 위한 광파장 연결이나 할당을 필요로 하지 않는 중요한 잇점이 있다.

광학적으로 제어된 섬유를 가진 비균일 불안정성의 과도 응답의 특성 (Characteristic of Transient Response in Nonuniform Instability with Optically Controlled Fiber)

  • 판린한;박광채
    • 한국정보전자통신기술학회논문지
    • /
    • 제9권5호
    • /
    • pp.445-450
    • /
    • 2016
  • In this paper we study the effect of chaos in nonuniform instability with optical fiber based IoT networks. The transient response of optically controlled fiber has also described. Nonlinear optical fiber effects especially fiber scattering in networks has emerged as the essential means active optical devices. The paradigm instability in fiber Internet serves as a test for fundamental study of chaos and its suppression and exploitation in practical application in optical communication. This paper attempts to present a survey and some of our research findings on the nature of chaotic effect on Internet based optical communication. The transient response in optical fiber has been evaluated theoretically by calculating the variation of the scattering function. The lines has used under open ended termination containing optically induced region. The scattered optical waves in a fiber used in optic communications are temporally unstable above certain threshold intensity.

FTTH EPON 기반의 가입자 보드 설계 (A Subscriber unit design for EPON in FTTH)

  • 김도영
    • 한국광학회:학술대회논문집
    • /
    • 한국광학회 2006년도 하계학술발표회 논문집
    • /
    • pp.525-526
    • /
    • 2006
  • Ethernet Passive Optical Networks (EPON) are an emerging access network technology that provide a low-cost method of deploying optical access lines between a central office (CO) and a customer site. This paper shows that subscriber unit manages traffic data between a central office (CO) and a customer site in economic solution.

  • PDF

A Data Burst Assembly Algorithm in Optical Burst Switching Networks

  • Oh, Se-Yoon;Hong, Hyun-Ha;Kang, Min-Ho
    • ETRI Journal
    • /
    • 제24권4호
    • /
    • pp.311-322
    • /
    • 2002
  • Presently, optical burst switching (OBS) technology is under study as a promising solution for the backbone of the optical Internet in the near future because OBS eliminates the optical buffer problem at the switching node with the help of no optical/electro/optical conversion and guarantees class of service without any buffering. To implement the OBS network, there are a lot of challenging issues to be solved. The edge router, burst offset time management, and burst assembly mechanism are critical issues. In addition, the core router needs data burst and control header packet scheduling, a protection and restoration mechanism, and a contention resolution scheme. In this paper, we focus on the burst assembly mechanism. We present a novel data burst generation algorithm that uses hysteresis characteristics in the queueing model for the ingress edge node in optical burst switching networks. Simulation with Poisson and self-similar traffic models shows that this algorithm adaptively changes the data burst size according to the offered load and offers high average data burst utilization with a lower timer operation. It also reduces the possibility of a continuous blocking problem in the bandwidth reservation request, limits the maximum queueing delay, and minimizes the required burst size by lifting up data burst utilization for bursty input IP traffic.

  • PDF

Application-Centric, Energy-Efficient Network Architecture ACTION, Based on Virtual Optical Slice Core and Deterministic Optical Access Network

  • Ashizawa, Kunitaka;Okamoto, Satoru;Yamanaka, Naoaki;Oki, Eiji;Fumagalli, Andrea;Veeraraghavan, Malathi
    • Journal of the Optical Society of Korea
    • /
    • 제19권4호
    • /
    • pp.340-345
    • /
    • 2015
  • The Internet traffic is forecasted to grow at a compound annual rate of 21 % from 2013 to 2018, according to surveys carried out by Cisco [1]. Network resources are significantly over-provisioned in today's networks, and it is quite common to see link utilization in the 30-40% range [2]. Additionally, the multi-media services have widely divergent bandwidth and Quality of Experience (QoE) requirements. Unfortunately, the huge transmission capacity will increase the power consumption of network equipment [3]. Applications Coordinated with Transport, Internet Protocol and Optical Networks (ACTION) [4] has been proposed to realize a multi-QoE, application-centric, and highly energy-efficient network that leverages flexible elastic optical network technologies [5-7]. This paper provides key network technologies for realizing the ACTION, which are a virtual optical slice core network and a Time Division Multiplexing (TDM)-based deterministic active optical access network.

A Novel Shared Segment Protection Algorithm for Multicast Sessions in Mesh WDM Networks

  • Lu, Cai;Luo, Hongbin;Wang, Sheng;Li, Lemin
    • ETRI Journal
    • /
    • 제28권3호
    • /
    • pp.329-336
    • /
    • 2006
  • This paper investigates the problem of protecting multicast sessions in mesh wavelength-division multiplexing (WDM) networks against single link failures, for example, a fiber cut in optical networks. First, we study the two characteristics of multicast sessions in mesh WDM networks with sparse light splitter configuration. Traditionally, a multicast tree does not contain any circles, and the first characteristic is that a multicast tree has better performance if it contains some circles. Note that a multicast tree has several branches. If a path is added between the leave nodes on different branches, the segment between them on the multicast tree is protected. Based the two characteristics, the survivable multicast sessions routing problem is formulated into an Integer Linear Programming (ILP). Then, a heuristic algorithm, named the adaptive shared segment protection (ASSP) algorithm, is proposed for multicast sessions. The ASSP algorithm need not previously identify the segments for a multicast tree. The segments are determined during the algorithm process. Comparisons are made between the ASSP and two other reported schemes, link disjoint trees (LDT) and shared disjoint paths (SDP), in terms of blocking probability and resource cost on CERNET and USNET topologies. Simulations show that the ASSP algorithm has better performance than other existing schemes.

  • PDF

광전달망에서 최소 파장 수의 한계값을 구하는 실질적인 방법 (A practical approach for a lower bound of the number of wavelengths in WDM-based Optical transport networks)

  • 이종원;박구현;이창희
    • 한국통신학회논문지
    • /
    • 제23권5호
    • /
    • pp.1222-1228
    • /
    • 1998
  • 각 노드에서 파장별로 경로를 선정하는 광전달망에서 최소한의 파장 수를 이용하여 경로 선정 및 파장 할당 문제에서 발견적 해결 방법에 의하여 해를 구하려는 연구가 수행되고 있다. 이와 같은 연구에 기준 척도를 제공하기 위해서 본 논문에서는 광전달망에서의 경로 선정 및 파장 할당 문제에서 요구된 모든 연결(connection)을 제공하기 위하여 필요한 파장 수의 최소 한계값을 구하는 실질적인 방법을 제안하고 있다. 이 방법은 K개의 최단 경로를 이용한 경로흐름 모형에 의한 방법이다. 제안하고 있는 방법이 일반적인 링크흐름 모형에 비하여 복잡도 및 해를 구하는 시간에 있어 효율적이면서도 링크흐름 모형과 동일한 해를 제공함을 몇가지 통신망 예를 통하여 보인다.

  • PDF

OBS 네트워크의 효율적 채널 이용을 위한 그룹 스케줄링 방식 (Group Scheduling for Efficient Channel Utilization in Optical Burst Switched Networks)

  • 신종덕
    • 대한전자공학회논문지TC
    • /
    • 제40권10호
    • /
    • pp.51-58
    • /
    • 2003
  • 본 논문에서는 광 버스트 스위칭 네트워크의 코어 노드에서 네트워크 자원을 보다 효율적으로 이용할 수 있는 새로운 스케줄링 방식인 그룹 스케줄링 방식을 제안하였다. 이 방식은 헤더 패킷들을 수집한 후 해당 스케줄링 창에 속하는 버스트들의 도착 시간 및 길이 정보를 이용하여 작성된 구간 그래프로부터 최대 안정집합을 선택하여 버스트들을 스케줄링하는 방식이다. 다수 개의 버스트들을 동시에 스케줄링하기 때문에 기존의 일대일 스케줄링 방식들 보다 버스트 손실 확률을 감소시킬 수 있으며, 채널 이용률도 높일 수 있다. 버스트의 길이가 지수 분포를 갖는 경우와 일정한 길이를 갖는 경우에 대해 전산 모의 실험으로 LAUC-VF 방식인 즉시 스케줄링 방식과 비교 평가한 결과 버스트 손실 확률과 채널 이용률 모두 그룹 스케줄링방식이 즉시 스케줄링 방식보다 우수함을 확인하였다.