• Title/Summary/Keyword: Optical Routing

Search Result 124, Processing Time 0.027 seconds

Phenyl modified silica sol-gel films for photonics (Photonic 재로로서 페닐실리카 코팅막의 특성)

  • Ahn, Bok-Yeop;Seok, Sang-Il;Kim, Joo-Hyeun;Lim, Mi-Ae
    • Proceedings of the Materials Research Society of Korea Conference
    • /
    • 2003.11a
    • /
    • pp.131-131
    • /
    • 2003
  • The advent of photonic technologies in the field of communications and data transmission has been heavily increasing the demand in integrated optical (IO) circuits capable of accomplishing not only simple tasks like signal, but also more sophisticated functions like all-optical signal routing or active multiplexing/demultiplexing. In the last decade, sol-gel technology has been widely used to prepare optical materials. Sol-gel processes show many promises for the development of low-loss, high-performance glass integrated optical circuits. However, crack formation is likely to occur during heat treatment in thick gel films. In order to overcome the critical thickness limitation, the organic-modified silicate has been widely used. In this case coating matrices have been prepared from the organo-silanes of T structures, acidic catalyst and the as-prepared gel films have been heat-treated below 200$^{\circ}C$ to avoid the crack formation and the degradation of organic components. However, the films prepared in the acidic condition and the low heat temperature make the films contain high OH groups which is the major optical loss function. In this work, C$\sub$6/H$\sub$5/SiO$\sub$1.5/ films were prepared on silicon substrate by sol-gel method using base catalyst in a PTMS/NH$_4$OH/H$_2$O/C$_2$H$\sub$5/OH system. The sol showed spinable viscosity at 50 wt% of solid content, and neglectable viscosity change with time. The films were crack-free and transparent after curing at 450 $^{\circ}C$, and highly condensed to minimize OH content in C$\sub$6/H$\sub$5/SiO$\sub$1.5/ networks. The effects of heat treatment of the films are characterized on the critical thickness, the chemical composition and the refractive indices by means of SEM, FT-IR, TGA, prism coupler, respectively.

  • PDF

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

  • Lu, Cai;Luo, Hongbin;Wang, Sheng;Li, Lemin
    • ETRI Journal
    • /
    • v.28 no.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

Match Field based Algorithm Selection Approach in Hybrid SDN and PCE Based Optical Networks

  • Selvaraj, P.;Nagarajan, V.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.12
    • /
    • pp.5723-5743
    • /
    • 2018
  • The evolving internet-based services demand high-speed data transmission in conjunction with scalability. The next generation optical network has to exploit artificial intelligence and cognitive techniques to cope with the emerging requirements. This work proposes a novel way to solve the dynamic provisioning problem in optical network. The provisioning in optical network involves the computation of routes and the reservation of wavelenghs (Routing and Wavelength assignment-RWA). This is an extensively studied multi-objective optimization problem and its complexity is known to be NP-Complete. As the exact algorithms incurs more running time, the heuristic based approaches have been widely preferred to solve this problem. Recently the software-defined networking has impacted the way the optical pipes are configured and monitored. This work proposes the dynamic selection of path computation algorithms in response to the changing service requirements and network scenarios. A software-defined controller mechanism with a novel packet matching feature was proposed to dynamically match the traffic demands with the appropriate algorithm. A software-defined controller with Path Computation Element-PCE was created in the ONOS tool. A simulation study was performed with the case study of dynamic path establishment in ONOS-Open Network Operating System based software defined controller environment. A java based NOX controller was configured with a parent path computation element. The child path computation elements were configured with different path computation algorithms under the control of the parent path computation element. The use case of dynamic bulk path creation was considered. The algorithm selection method is compared with the existing single algorithm based method and the results are analyzed.

Buffer-based Service Differentiation Scheme in Optical Burst Switching Networks (광 버스트 스위칭 네트워크에서 버퍼 기반의 서비스 차별화 방식)

  • Paik, Jung-Hoon;Lee, Kyou-Ho
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.12
    • /
    • pp.2835-2842
    • /
    • 2013
  • In this paper, service differentiation scheme using optical buffer that is reduced in size with slow-light technology in optical burst switching networks is presented. In suggested scheme, each outport has buffer to store high-class burst only in case that all its wavelengths are occupied. When all wavelengths are being used, a new arriving high-class burst goes into the buffer and waits until a burst is serviced. As soon as a burst is serviced with a wavelength, the high-class burst at buffer is allocated to the free wavelength. In case that low-class burst is arriving under the same situation, it is not stored at the buffer but discarded. An analytical model is derived to analyze the performance of the suggested scheme and compare its performance with the conventional scheme such as preemption and deflection as well as no service differentiations.

Energy-efficient Multicast Algorithm for Survivable WDM Networks

  • Pu, Xiaojuan;Kim, Young-Chon
    • Current Optics and Photonics
    • /
    • v.1 no.4
    • /
    • pp.315-324
    • /
    • 2017
  • In recent years, multicast services such as high-definition television (HDTV), video conferencing, interactive distance learning, and distributed games have increased exponentially, and wavelength-division multiplexing (WDM) networks are considered to be a promising technology due to their support for multicast applications. Multicast survivability in WDM networks has been the focus of extensive attention since a single-link failure in an optical network may result in a massive loss of data. But the improvement of network survivability increases energy consumption due to more resource allocation for protection. In this paper, an energy-efficient multicast algorithm (EEMA) is proposed to reduce energy consumption in WDM networks. Two cost functions are defined based on the link state to determine both working and protection paths for a multicast request in WDM networks. To increase the number of sleeping links, the link cost function of the working path aims to integrate new working path into the links with more working paths. Sleeping links indicate the links in sleep mode, which do not have any working path. To increase bandwidth utilization by sharing spare capacity, the cost function of the protection path is defined to use sleeping fibers for establishing new protection paths. Finally, the performance of the proposed algorithm is evaluated in terms of energy consumption, and also the blocking probability is evaluated under various traffic environments through OPNET. Simulation results show that our algorithm reduces energy consumption while maintaining the quality of service.

A Fast and Scalable Inter-Domain MPLS Protection Mechanism

  • Huang, Chang-Cheng;Messier, Donald
    • Journal of Communications and Networks
    • /
    • v.6 no.1
    • /
    • pp.60-67
    • /
    • 2004
  • With the fast growth of Internet and a new widespread interest in optical networks, the unparalleled potential of Multi-Protocol Label Switching (MPLS) is leading to further research and development efforts. One of those areas of research is Path Protection Mechanism. It is widely accepted that layer three protection and recovery mechanisms are too slow for today’s reliability requirements. Failure recovery latencies ranging from several seconds to minutes, for layer three routing protocols, have been widely reported. For this reason, a recovery mechanism at the MPLS layer capable of recovering from failed paths in 10’s of milliseconds has been sought. In light of this, several MPLS based protection mechanisms have been proposed, such as end-to-end path protection and local repair mechanism. Those mechanisms are designed for intra-domain recoveries and little or no attention has been given to the case of non-homogenous independent inter-domains. This paper presents a novel solution for the setup and maintenance of independent protection mechanisms within individual domains and merged at the domain boundaries. This innovative solution offers significant advantages including fast recovery across multiple nonhomogeneous domains and high scalability. Detailed setup and operation procedures are described. Finally, simulation results using OPNET are presented showing recovery times of a few milliseconds.

Scheduling Algorithm using DAG Leveling in Optical Grid Environment (옵티컬 그리드 환경에서 DAG 계층화를 통한 스케줄링 알고리즘)

  • Yoon, Wan-Oh;Lim, Hyun-Soo;Song, In-Seong;Kim, Ji-Won;Choi, Sang-Bang
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.47 no.4
    • /
    • pp.71-81
    • /
    • 2010
  • In grid system, Task scheduling based on list scheduling models has showed low complexity and high efficiency in fully connected processor set environment. However, earlier schemes did not consider sufficiently the communication cost among tasks and the composition process of lightpath for communication in optical gird environment. In this thesis, we propose LSOG (Leveling Selection in Optical Grid) which sets task priority after forming a hierarchical directed acyclic graph (DAG) that is optimized in optical grid environment. To determine priorities of task assignment in the same level, proposed algorithm executes the task with biggest communication cost between itself and its predecessor. Then, it considers the shortest route for communication between tasks. This process improves communication cost in scheduling process through optimizing link resource usage in optical grid environment. We compared LSOG algorithm with conventional ELSA (Extended List Scheduling Algorithm) and SCP (Scheduled Critical Path) algorithm. We could see the enhancement in overall scheduling performance through increment in CCR value and smoothing network environment.

Wavelength Assignment Algorithms fora Multihop Lightwave Network

  • Seo, Jun-Bae;Seo, Hyun-Hwa;Lee, Hyong-Woo;Cho, Choong-Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.6B
    • /
    • pp.523-532
    • /
    • 2003
  • GENMET(GEneralized Multihop Network) which is based on Wavelength-Division Multiplexsing(WDM) and can be used in order to construct the next generation lightwave network is a logical(virtual), packet-switched and multihop topology network. GENMET is a regular multihop network which is a generalization of Shuffle network and do Bruijn network As such, it has the advantage of simple routing which is critical in a high speed network Given a physical topology, different logical topologies can be derived for assigning wavelengths to the UserNodes. By appropriately assigning wavelengths, performance of the network, such as mean hop count, maximum throughput and mean packet delay can be improved. In this paper, we propose heuristic algorithms for effectively assigning a limited number of wavelengths to the given UserNodes. The Performance of proposed algorithm is compared with the random assignment and the lower bounds.

Some Results on the Multi-Fiber Optical Networks with Wavelength Routing (파장경로주기를 이용하는 다중광섬유 광 통신망에서의 몇가지 결과들)

  • Kim, Eun-Saeng
    • Journal of KIISE:Information Networking
    • /
    • v.28 no.1
    • /
    • pp.1-10
    • /
    • 2001
  • 파장경로주가 통신망은 근원지에서 목적지까지 정보가 빛의 형태로 전달되는 전광 통신망이다. 정보는 빛의 길을 통해 전달되어 지는데 이는 광 채널들을 교환 연결방식을 이용하여 연결함으로써 만들어진다. 링크간의 연결이 복수개의 광섬유로 이루어진 파장 경로주기 통신망에서는 광섬유간의 교환능력을 통해 더욱 효율적으로 채널들을 이용할 수 있다. 이논문에서는 주어진 연결 요구들을 충족시키는 오프라인 채널 지정문제를 통하여 링이나 트리 구조를 갖는 통신망에서 광섬유간의 교환 능력이 미치는 영향을 조사해 보았다. 주어진 연결 요구들은 하나의 변수인 부하로 나타내 진다. 링의 형태를 갖는 통신망에서 부하를 교환기의 크기에 대한 함수로 나타냄으로써 교환기의 크기가 미치는 영향을 수량화했고 트리의 형태를 가는 통신망에서는 일반적으로 부하가 L일 때 하나의 링크에 L개의 채널을 사용하여 채널 지정을 얻기에는 광섬유간의 교환이 충분하지 않다는 반증을 보였다.

  • PDF

The Method of Stepped Optical Routing Information Management Development in Sea-Side Removed Station (해상 이동형 기지국에서 단계별 최적 라우팅 정보 관리 방법)

  • Lim, Na-Rae
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2013.05a
    • /
    • pp.435-437
    • /
    • 2013
  • 본 논문은 육상 기지국(상용 기지국)과 해안 기지국(UC-2), 해상 이동형 기지국(UE-2-N, 예: 선박)과의 무선 통신 라우팅 정보 산출을 위한 ad-hoc 통신과 관련한 것이다. 육상 기지국(상용기지국)과 해안 기지국(UE-2)과의 연결 경로, 해안 기지국(UE-2)와 해상 이동형 기지국(UE-3-N)과의 연결 경로를 확보하기 위하여 각각의 기지국(UE-2/UE-3-N)들의 출력 정보와 위치정보(벡터 값으로 표현)를 이용한 최적 라우팅 정보 산출 확대 관리 방법에 관한 것이다.