• Title/Summary/Keyword: Wavelength Routing

Search Result 85, Processing Time 0.022 seconds

Routing and Wavelength Assignment in Survivable WDM Networks without Wavelength Conversion

  • Lee, Tae-Han;Park, Sung-Soo;Lee, Kyung-Sik
    • Management Science and Financial Engineering
    • /
    • v.11 no.2
    • /
    • pp.85-103
    • /
    • 2005
  • In this paper, we consider the routing and wavelength assignment problem in survivable WDM transport network without wavelength conversion. We assume the single-link failure and a path protection scheme in optical layer. When a physical network and a set of working paths are given, the problem is to select a link-disjoint protection path for each working path and assign a wavelength for each working and protection path. We give an integer programming formulation of the problem and propose an algorithm to solve it. Though the formulation has exponentially many variables, we solve the linear programming relaxation of it by using column generation technique. We devise a branch-and price algorithm to solve the column generation problem. After solving the linear programming relaxation, we apply a variable fixing procedure combined with the column generation to get an integral solution. We test the proposed algorithm on some randomly generated data and test results show that the algorithm gives very good solutions.

Routing and Wavelength Assignment in Survivable WDM Networks (생존도를 고려한 WDM 망의 경로설정 및 파장할당)

  • Lee, Taehan;Park, Sungsoo
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2001.10a
    • /
    • pp.124-127
    • /
    • 2001
  • We consider the routing and wavelength assignment problem in survivable WDM transport network without wavelength conversion. We assume the single-link failure and a path protection scheme in optical layer. When a physical network and a set of working paths are given, the problem is to select a link-disjoint protection path for each working path and assign a wavelength for each working and protection path. We give an integer programming formulation of the problem and propose an algorithm to solve it based on column generation technique and variable fixing. We devise a branch-and-price algorithm to solve the column generation problem. We test the proposed algorithm on some randomly generated data and test results show that the algorithm gives very good solutions.

  • PDF

A Design of Routing Path and Wavelength Assignment with Fairness in WDM Optical Transport Network (WDM 광전달망에서 공정성을 갖는 경로설계 및 파장할당)

  • 박구현;우재현
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.22 no.4
    • /
    • pp.17-35
    • /
    • 1997
  • This paper considers the efficient design of routing path and wavelength assignment in the single-hop WDM optical transport networks. The connection demands between node-pairs are given and a connection between a pair of nodes must be made by only one lightpath. It is assumed that no wavelength conversion is allowed and the physical topology of the network and the number of available wavelengths of a physical link are also given. This paper proposes the method to route a path and assign a wavelength to the path, which guarantees fairness to every node pair. In order to guarantee fairness and maximize connections, an optimization model is established, which successively maximizes minimum connection ratio to the demand of each node pair. A heuristic algorithm with polynomial iterations is developed for the problem since the problem is NP-hard. The heuristic algorithm is implemented and applied to the networks with real problem sizes. The results of the application are compared with GAMS/OSL.

  • PDF

QoS-based Routing, Wavelength and Time-slot Assignment schemes (WDM/TDM 네트워크에서 차별화된 서비스 제공을 위한 파장 및 시간 슬롯 할당방식)

  • 임재복;이현태
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2003.11a
    • /
    • pp.171-176
    • /
    • 2003
  • 광 파장 경로 네트워크에서 시간슬롯을 도입한 RWTA(Routing, Wavelength and Time-slot Assignment)에서는 시간슬롯의 할당이 제공하는 연결의 대역폭을 결정한다. 본 논문에서는RWTA 방식에서 요구되는 트래픽에 따라 시간슬롯을 제공하고 자원을 효율적으로 사용 할 수 있는 GBTA(Guaranteed-bandwidth Time-slot allocation) 알고리즘을 제안한다. GBTA는 보장된 시간슬롯을 할당함으로서 세션이 블록킹 되지 않고 연결될 확률을 높여 세션의 연결성을 보장하여 QoS의 요구사항을 만족시킨다.

  • PDF

Protocol Design for Wavelength Routing in Optical Ring Access Networks (광링액세스네트워크에서의 파장 라우팅을 위한 프로토콜 설계)

  • Lee, Sang-Wha
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.15 no.4
    • /
    • pp.2382-2392
    • /
    • 2014
  • In this paper, a new data frame structure for wavelength routing in optical ring access network(ORAN) is designed and the functions of each field in the frame are defined. In addition, the IP packet transmission to the network layer corresponding to the newly proposed structure of the protocol stack is newly presented. Tha data transmission protocol design techniques of ORAN was proposed. IP packet and broadcasting packet transmission within the sub-network, and the IP packet transmission to other sub-network was shown through the process illustration. In the process, the encapsulation and framing process of the wavelength information to routing has been described in detail. And each step takes place in a packet transfer process is demonstrated. A ring type optical access network protocol is not yet research field. ORAN data transfer protocol to send/receive module structure of a subscriber node and a control node of the two rings which analyzed the results are shown. The high-speed Internet solution is proposed that by using wavelength routing the packet transport protocol for ORAN is designed.

Joint routing, link capacity dimensioning, and switch port optimization for dynamic traffic in optical networks

  • Khan, Akhtar Nawaz;Khan, Zawar H.;Khattak, Khurram S.;Hafeez, Abdul
    • ETRI Journal
    • /
    • v.43 no.5
    • /
    • pp.799-811
    • /
    • 2021
  • This paper considers a challenging problem: to simultaneously optimize the cost and the quality of service in opaque wavelength division multiplexing (WDM) networks. An optimization problem is proposed that takes the information including network topology, traffic between end nodes, and the target level of congestion at each link/ node in WDM networks. The outputs of this problem include routing, link channel capacities, and the optimum number of switch ports locally added/dropped at all switch nodes. The total network cost is reduced to maintain a minimum congestion level on all links, which provides an efficient trade-off solution for the network design problem. The optimal information is utilized for dynamic traffic in WDM networks, which is shown to achieve the desired performance with the guaranteed quality of service in different networks. It was found that for an average link blocking probability equal to 0.015, the proposed model achieves a net channel gain in terms of wavelength channels (𝛾w) equal to 35.72 %, 39.09 %, and 36.93 % compared to shortest path first routing and 𝛾w equal to 29.41 %, 37.35 %, and 27.47 % compared to alternate routing in three different networks.

RWA Algorithm for Differentiated Service in Next Generation Optical Internet Backbone Networks (차세대 광인터넷 백본망에서 차등화 서비스 제공을 위한 RWA 알고리즘)

  • 송현수;배정현;김성운;김영부;이현진;이재동
    • Journal of KIISE:Information Networking
    • /
    • v.31 no.2
    • /
    • pp.196-206
    • /
    • 2004
  • In the Next Generation Internet(NGI) backbone network, a Dense Wavelength Division Multiplexing (DWDM) technology has been more and more highlighted to cover the increasing subscribers and bandwidth requirement. For such a DWDM network, Routine and Wavelength Assignment (RWA) is the essential problem to establish the optimal path and assign a wavelength efficiently to the selected path in resource utilization. However, the existing RWA algorithms do not consider the congestion in the network so that the performance of then is so limited. To solve this problem, in this paper, we introduce a new RWA algorithm, called Multi Wavelength-Minimum Interference path Routing (MW-MIPR) that establishes a routing path to minimize the interference for many potential future connection setup request. And then, we also propose a wavelength-routed QoS routing scheme based on differentiated QoS classes with applying MW-MIPR algorithm. Simulation results are also given to prove the efficiency of the proposed algorithms.

A New Model of a Routing and Wavelength Assignment Problem on WDM Ring Networks (WDM 환형 망에서 경의 실정 및 파장 할당 문제의 새로운 모형)

  • Gang Dong Han;Gang Jang Ha;Park Seong Su
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2002.05a
    • /
    • pp.397-401
    • /
    • 2002
  • We consider a routing and wavelength assignment (RWA) problem on wavelength division multiplexing (WDM) ring networks, which is to maximize the established connections between nodes, given a set of usable wavelengths. We propose two new mathematical formulations of it and efficient algorithms based on branch-and-price method. Computational experiments on random instances show that cue of the proposed formulations yields optimal solutions in much shorter time on the average than the previous formulation due to Lee (1998).

  • PDF

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

  • Hirata, Kouji;Ito, Kohei;Fukuchi, Yutaka;Muraguchi, Masahiro
    • Journal of Communications and Networks
    • /
    • v.18 no.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.

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.