• Title/Summary/Keyword: wavelength assignment

Search Result 79, Processing Time 0.033 seconds

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.

Traffic Grooming and Wavelength Routing for All Optical WDM-Ring Network (전광 WDM 링 통신망에서 수요집적 및 광파장 경로설정)

  • 윤문길
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.26 no.1
    • /
    • pp.33-44
    • /
    • 2001
  • In this paper, we address a problem of traffic grooming and wavelength routing in all optical WDM ring networks. Given a traffic demand for each node pair, we should aggregate the traffic onto lightpaths between pairs of nodes to transport the demand, and set up the routing path for each lightpath with minimum number of wavelengths to be assigned to lightpaths. In this paper, we formulate our problem as a mixed Integer Programming model. Owing to the problem complexity, it is hard to find an optimal solution for our problem. hence, we develop a heuristic algorithm to solve our problem efficiently. From the computational experiments, we can find the proposed heuristic is very satisfactory in both the computation time and the solution quality generated.

  • PDF

Differentiated RWA Algorithm Providing QoS Recovery in the Next Generation Backbone Network based on DWDM (DWDM 기반의 차세대 백본망에서 QoS Recovery를 제공하는 차등적인 RWA 알고리즘)

  • Bae, Jung-Hyun;Song, Hyun-Su;Lee, Hyun-Jin;Kim, Young-Boo;Kim, Sung-Un
    • Proceedings of the IEEK Conference
    • /
    • 2003.11c
    • /
    • pp.105-108
    • /
    • 2003
  • In the next generation backbone networks based on dense-wavelength division multiplexing (DWDM), the routing and wavelength assignment with quality-of-service (QoS) recovery is essentially needed to support a wide range of communication-intensive and real-time multimedia services. This paper proposes a new dpmic routing method called as MW-MIPR (MultiWavelength-Minimum Interference Path Routing), which chooses a route that does not interfere too much with many potential future connection requests. This paper also proposes a differentiated RWA mechanisms combined with MW-MIPR algorithm to provide QoS recovery for various multimedia applications in the next generation backbone networks based on DWDM.

  • PDF

A Priority- based Minimum Interference Path Multicast Routing Algorithm in NGOI based DWDM (고밀도 파장 분할 다중화 방식 기반 차세대 광 인터넷망에서 우선순위 기반 최소간섭 경로 멀티캐스트 라우팅 알고리즘)

  • Jo, Chan-Hyo;Seo, Sang-Bo;Lee, Jun-Won;Kim, Sung-Un
    • Journal of KIISE:Information Networking
    • /
    • v.36 no.4
    • /
    • pp.286-296
    • /
    • 2009
  • A major challenge in next generation optical Internet (NGOI) networks based on dense-wavelength division multiplexing (DWDM) is the provision of guaranteed quality-of-service (QoS) for a wide variety of multimedia applications. One of the critical issues in NGOI is the routing and wavelength assignment problem that is embossed as very important and plays a key role in improving the global efficiency for capacity utilization. But the previous researches had the delay problem, and the path routed by higher priority nodes may be congested and interfere with potential future multicast session requests. To overcome these problems, in this research we suggest a Priority-based Minimum Interference Path Multicast Routing (PMIPMR) algorithm, a new routing algorithm which finds alternative routes based on node priorities and Virtual Source (VS) nodes that has both splitting and wavelength conversion, and then chooses a path that does not interfere with potential future multicast session requests when congestions occur in the network. The PMIPMR algorithm reduces blocking rate significantly and increases the wavelength utilization by avoiding congestion in future multicast session requests.

Fault/Attack Management Framework for Network Survivability in Next Generation Optical Internet Backbone (차세대 광 인터넷 백본망에서 망생존성을 위한 Fault/Attack Management 프레임워크)

  • 김성운;이준원
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.40 no.10
    • /
    • pp.67-78
    • /
    • 2003
  • As optical network technology advances and high bandwidth Internet is demanded for the exponential growth of internet traffic volumes, the Dense-Wavelength Division Multiplexing (DWDM) networks have been widely accepted as a promising approach to the Next Generation Optical Internet (NGOI) backbone networks for nation wide or global coverage. Important issues in the NGOI based on DWDM networks are the Routing and Wavelength Assignment(RWA) problem and survivability. Especially, fault/attack detection, localization and recovery schemes in All Optical Transport Network(AOTN) is one of the most important issues because a short service disruption in DWDM networks carrying extremely high data rates causes loss of vast traffic volumes. In this paper, we suggest a fault/attack management model for NGOI through analyzing fault/attack vulnerability of various optical backbone network devices and propose fault/attack recovery procedure considering Extended-LMP(Link Management Protocol) and RSVP-TE+(Resource Reservation Protocol-Traffic Engineering) as control protocols in IP/GMPLS over DWDM.

Design and Implementation of MPλS Simulator based on ns-2 Network Simulator (ns-2 네트워크 시뮬레이터 기반의 MPλS 시뮬레이터의 설계 및 구현)

  • 서선영;이봉환;황선태;윤찬현
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.40 no.10
    • /
    • pp.119-128
    • /
    • 2003
  • The rapid increase of Internet users, diversity of application services, high speed data transmission, and extension of application areas have resulted in exponential growth of Internet traffic. In order to satisfy the increasing demand of bandwidth, the MPλS protocol, which is based on MPLS for efficient integration of WDM and IP protocols, has been suggested by IETF. In this paper, we present an MPλS simulator which enables to simulate various MPλS function such as optical crossconnect (OXC), multi-wavelength links, routing and wavelength assignment(RWA), and MPλS signaling and control. The simulator is developed based on the ns-2, an widely used multi-protocol network simulator. The function of the simulator is validated by running many simulation based on various scenarios and performance measures such as throughput and blocking probability. The simulator could be widely utilized for validation of proposed protocols before developing real optical network systems.

Distributed Virtual Topology Adaptation Method to Support IP Traffic in WDM Mesh Networks (WDM Mesh 네트워크에서 IP 트래픽을 수용하기 위한 분산형 가상토폴로지 적응 기법)

  • Kim, Eal-Lae;Lee, Sung-Kuen;Lee, Yong-Won;Chang, Sun-Hyok;Lee, Myung-Moon;Park, Jin-Woo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.1B
    • /
    • pp.1-10
    • /
    • 2007
  • We propose a new approach to accommodate bidirectional asymmetric traffic demands as well as unexpected dynamic internet traffic variation in the WDM mesh network by using optical networking technologies. In the proposed scheme, an intermediate node determines the optical path based on the switching statistics of IP router of the node which characterizes the Internet traffic variation, which in effect provides a dynamic and distributed traffic control over the network. It is expected to reduce the efficiency deterioration of RWA(Routing and Wavelength Assignment) due to the real-time variation of Internet traffic so that expandability and flexibility of the network can be enhanced. In this paper, we describe a methodology for traffic behavior analysis at a node, and the decision policy of the establishment/release of optical path. In addition, we evaluate the performance of the proposed scheme through the computer simulations.

Dynamic Routing and Wavelength Assignment Algorithm to Improve Energy Efficiency in IP over WDM Network with Multifiber (다중 광섬유 링크를 갖는 IP over WDM 망에서 에너지 효율 향상을 위한 동적 경로 배정 및 파장 할당 알고리즘)

  • Lee, Ki-Beom;Kang, Keun-Young;Kim, Do Young;Kim, Young-Chon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39C no.4
    • /
    • pp.370-379
    • /
    • 2014
  • Recently, the interest in optical network with multifiber link is continuing to rise since the network traffic has been growing exponentially. However, growing traffic in network leads to increasing the energy consumption of the network equipment. In this paper, we propose a dynamic routing and wavelength assignment (RWA) algorithm based on V-like cost function and layered graph to improve energy efficiency in IP over WDM network with multifiber link. The V-like cost function is used to decide the fiber cost according to the number of used wavelengths. The layered graph with multifiber link is used to select the energy efficient route and wavelength. The proposed RWA algorithm is compared and analyzed with conventional algorithm in view of average power consumption and blocking probability through OPNET modeler.

A Minimum Wavelength Assignment Technique for Wavelength-routed Optical Network-on-Chip (파장 라우팅 광학 네트워크-온-칩에서의 최소 개수 파장 할당 기법)

  • Kim, Youngseok;Lee, Jae Hun;Cui, Di;Han, Tae Hee
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.10
    • /
    • pp.82-90
    • /
    • 2013
  • An Optical Network-on-Chip(ONoC) based on silicon photonics is one of promising technology for next generation exascale computing architectures. Recent active researches on ONoC focus on improving bandwidth further and avoiding path collisions by using wavelength division multiplexing (WDM). However, the number of wavelengths used for the WDM increases linearly as the number of Processing Element (PE) increases in existing ONoCs which adopt centralized routing architecture. The problem will also arises growing cost of optical devices such as light switches and light sources and limits the scalability of ONoC due to the sinal loss caused by interference of distinct light sources. In this paper, we proposes a distributed routing architecture for ONoC which is based on 2D-mesh structure using WDM technique and present a method that minimize the required number of wavelengths exploiting the connectivity of communication. In comparison with existing centralized routing architectures, results show reduction by 56% of the number of wavelengths and 21% of the number of optical switches in $8{\times}8$ networks.