• Title/Summary/Keyword: Optical WDM Networks

Search Result 154, Processing Time 0.024 seconds

List Schedulin on WDM Optical Interconnection Networks using Genetic Algorithms (유전자 알고리즘을 이용한 광상호 연결망에서 파장분할다중방식의 리스트 스케쥴링)

  • Jung, Hea-Jin;Wee, Kyu-Bum;Yeh, Hong-Jin;Hong, Man-Pyo;Byeon, Kwang-June
    • The Transactions of the Korea Information Processing Society
    • /
    • v.5 no.9
    • /
    • pp.2302-2311
    • /
    • 1998
  • The problem of scheduling general packet traffic on WDM optical interconnection networks is NP-complete, It is known that the list scheduling is a good approximation algurithm fur this problem, The resulting list schedules vary depending on the order of transmitters considered to be placed on each time slot We propose an improvement of the list scheduling that tries different orders of transmitters to obtain shorter schedule lengths, Genetic algorithms are used to explore various orders of transmitters.

  • PDF

Relationships between optimal number of wavelenghs and tuning time in WDM/TDM passive star network (WDM 수동성형성망에서의 TDM 스케쥴링시 최적파장수와 파장조정시간과의 관계)

  • 신홍섭;신용식;박구현
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.23 no.7
    • /
    • pp.1785-1796
    • /
    • 1998
  • This paper is concerned with the relationships between optimal number of wavelengths and tuning time in time division multiplexing(TDM) scheduling on wavelength division multiplexing(WDM) optical passive star networks. We assume that the traffic is nonuniform and each node has a tunable transmitter and a fixed receiver. Each node transmits spckets to all other nodes. Most of the earlier protocols on TDM based scheduling for WDM star networks [7, 8, etc.] use whold given wavelength chnnels. But in this paper, we investigate the optimal number of wavelengths that yidels minimum frame length when tuning time exists. It appears within the availble number of wavelengths that yields minimum frame length when tuning time exists. It appears within the available number of wavelengths. We analyze the relationships between optimal number of wavelengths and tuning time by experiments. We analyze the reationships between optimal number of wavelengths and tuning time by experiments. We also discuss on the possibility of reduction of frame length by increasing the number of nodes trans-mitters and receivers.

  • PDF

An introduction of FTTH Passive Optical Network and Deployment Strategy (FTTH 수동 광가입자망 기술 소개 및 진화 방안)

  • Kim, Chong-Ahn;Kim, Dae-Young
    • Proceedings of the IEEK Conference
    • /
    • 2005.11a
    • /
    • pp.253-256
    • /
    • 2005
  • In this paper, we explain a various fiber to the home technology and give some important standardization status. And, passive optical networks which are WDM-PON, Ethernet PON and/or Gigabit-PON will be mainly deployed in populated subscriber area and multiple dwelling units with taking great advantage of OPEX. And finally we discuss FTTH deployment strategy with low capital cost.

  • PDF

On Transmission Scheduling with Tuning-Limited Transmitters in WDM Star Networks (파장 분할 방식 성형 통신망에서 조정 제약을 갖는 전송기를 이용한 전송 스케줄링)

  • Choi, Hong-Sik;Lee, Kyung-Joon;Kim, Jin
    • Journal of KIISE:Information Networking
    • /
    • v.29 no.2
    • /
    • pp.129-140
    • /
    • 2002
  • In this paper, we consider the problem of packet transmission in a wavelength division multiplexed(WDM) optical network. Our network model assumes that receivers are fixed-tuned and transmitters are tunable such that optical lasers assigned to transmitters have limited access to the network bandwidth: hence each node must be equipped with multiple optical lasers and/or multiple optical filters in order to maintain a single-hop network. We first analyze scheduling all-to-all packet transmissions and present optimum scheduling for all-to-all packet transmissions. We then extend the analysis to the case of arbitrary traffic demands. We show that the scheduling with arbitrary traffic demand is NP-hard. A heuristic algorithm based on list scheduling is presented. The upper bound so obtained is compared with the lower bound and provides performance guarantees with arbitrary demands. The result are applicable to arbitrary tuning delay, arbitrary number of wavelength channels and optical lasers of arbitrary tuning ranges.

Analysis on the optimal 2-dimensional code generation algorithm for high-speed optical CDMA network (초고속 광 코드분할 다원접속 네트웍용 최적 2차 코드 생성 알고리즘 제안 및 연구)

  • 신종윤;박남규
    • Korean Journal of Optics and Photonics
    • /
    • v.13 no.5
    • /
    • pp.435-441
    • /
    • 2002
  • In this paper, we propose an optimal 2-dimensional construction algorithm of a code family for a high-speed optical code division multiple access network. The optimal 2-D code family generated by search algorithm has better spectrum efficiency than previous codes, having relatively many code sets with short code length and the same or lower BER. Using the optimal 2-D code, OCDMA systems make it possible to utilize the spectrum more efficiently than WDM systems. The probability of bit error for high-speed OCDMA transmissions is calculated as a function of the number of users in the presence of receiver and shot noise(additive white Gaussian noise).

A Study on Algorithm for the Wavelength and Routing Assignment Problem on All-optical Tree Networks (전광 트리 네트워크에서 파장 및 경로설정 문제를 해결하는 알고리즘에 관한 연구)

  • Kim, Soon-Seok;Yeo, Sang-Su;Kim, Sung-Kwon
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.12
    • /
    • pp.3952-3963
    • /
    • 2000
  • This paper considers the WRA(Wavelength and Houting Assignment) problem on all-optical tree networks using WDM(Wavelength Division Multiplexing). Each link between a pair of request nodes on all optical networks is assigned different wavelengths because of technical constraint. On the basis of this, we give an polynomial time algorithm to assign wavelengths to the all patbs of a arbitrary tree network using divide and conquer method. The time complexity of this algorithm is O(Q. R), in which Q is the request nodes for all to'all communication in a tree topology and U is the maximum number of wavelength. Also we implemented our algorithm using C in Pentium II 233MHz and analyzed performance results.

  • PDF

Simultaneous Burst and Burst Control Packet Transmission Protocol for Optical Burst Switching Ring Networks

  • Park, Joon-Pyo;Lee, Man-Seop
    • ETRI Journal
    • /
    • v.29 no.1
    • /
    • pp.116-119
    • /
    • 2007
  • In this letter, we design a collision resolution protocol for optical burst switching ring networks to avoid burst collision. We define the offset time condition for no burst transmission collision and manage the free time list of nodes for no burst reception collision. In order to improve the throughput, we use a fiber delay line, void-filling, and void-compression. This protocol does not require any additional procedures for bandwidth reservation such as centralized assignment of bandwidth, lightpath setup of WDM ring networks, or token capturing for the burst transmission. The simulation results show that the proposed protocol can achieve high throughput while saving 70% of wavelengths when compared to round robin with random selection, round robin with persistent, and round robin with non-persistent with only destination delay.

  • PDF

Adaptive Differentiated Integrated Routing Scheme for GMPLS-based Optical Internet

  • Wei, Wei;Zeng, Qingji;Ye, Tong;Lomone, David
    • Journal of Communications and Networks
    • /
    • v.6 no.3
    • /
    • pp.269-279
    • /
    • 2004
  • A new online multi-layer integrated routing (MLIR) scheme that combines IP (electrical) layer routing with WDM (optical) layer routing is investigated. It is a highly efficient and cost-effective routing scheme viable for the next generation integrated optical Internet. A new simplified weighted graph model for the integrated optical Internet consisted of optical routers with multi-granularity optical-electrical hybrid switching capability is firstly proposed. Then, based on the proposed graph model, we develop an online integrated routing scheme called differentiated weighted fair algorithm (DWFA) employing adaptive admission control (routing) strategies with the motivation of service/bandwidth differentiation, which can jointly solve multi-layer routing problem by simply applying the minimal weighted path computation algorithm. The major objective of DWFA is fourfold: 1) Quality of service (QoS) routing for traffic requests with various priorities; 2) blocking fairness for traffic requests with various bandwidth granularities; 3) adaptive routing according to the policy parameters from service provider; 4) lower computational complexity. Simulation results show that DWFA performs better than traditional overlay routing schemes such as optical-first-routing (OFR) and electrical-first-routing (EFR), in terms of traffic blocking ratio, traffic blocking fairness, average traffic logical hop counts, and global network resource utilization. It has been proved that the DWFA is a simple, comprehensive, and practical scheme of integrated routing in optical Internet for service providers.

Performance Analysis and Channel Sharing of Asymmetric Bilayered ShffleNet WDM Network (비대칭 이중층 셔플넷 구조를 갖는 WDM 네트워크의 성능분석 및 채널 공유)

  • 여인영;이승원;신서용
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.6A
    • /
    • pp.802-812
    • /
    • 2000
  • Multihop lightwave networks are the optical-fiber based local communication systems that employ WDM(Wavelength Division Multiplexing) technology to fully use the enormous fiber bandwidth without requiring any tunable tranceives. In this paper, we introduce a novel ShuffleNet topology, asymmetric bilayered ShuffleNet(ABS) topology as a multihop WDM network technique. For 1Gb/s transmission system, we compared ABS topology with previously reported ones in terms of common network parameters such as average number of hops, throughput, time delay, and network power function. Through the analysis, the performance of ABS topology was proven to be superior to the existing ones. To decrease the amount of hardware required for implementing ABS system, we also proposed a new WDM channel sharing scheme. For (2, 3) ShuffleNet topology system, the number of wavelengths needed in the system can be reduced dramatically from 96 to 4 by using new scheme.

  • PDF