• Title/Summary/Keyword: Optical Routing

Search Result 124, Processing Time 0.026 seconds

Priority-based Minimum Interference Path Multicast RWA Algorithm in Optical Virtual Private Network (광 가상사설망에서 우선순위기반 최소간섭 경로 멀티캐스트 라우팅 알고리즘 연구)

  • Seo, Sang-Bo;Song, Seung-Mi;Lee, Jong-Geun;Kim, Sung-Un
    • Proceedings of the IEEK Conference
    • /
    • 2007.07a
    • /
    • pp.11-12
    • /
    • 2007
  • OVPN(Optical Virtual Private Network) based on DWDM(Dense Wavelength Division Multiplexing) backbone framework is considered as a promising approach for the future VPN. This paper proposes a new routing algorithm, called PMIPMR (Priority-based Minium Interference Path Multicast Routing) algorithm which finds an alternate route considering node priorities when the congestion is occurred in a network. The PMIPMR algorithm tries to improve blocking probability and wavelength utilization by avoiding congested path for potential future connection requests.

  • PDF

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.

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.

Dynamic Routing Algorithm based on Minimum Path-Cost in Optical Burst Switching Networks (광 버스트 스위칭 망에서 최소 경로비용 기반의 동적 경로배정 기법)

  • Lee Hae joung;Song Kyu yeop;Yoo Kyoung min;Yoo Wan;Kim Young chon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.3B
    • /
    • pp.72-84
    • /
    • 2005
  • Optical burst switching networks usually employ one-way reservation by sending a burst control packet with a specific offset time, before transmitting each data burst Same. Due to such a Property, burst-contentions occur when multiple bursts contend for the same wavelength in the same output link simultaneously in a node, leading to burst losses, eventually degrading the quality of service. Therefore, in this paper, we propose a dynamic routing algorithm using minimum local state information in order to decrease burst-contentions. In this proposed scheme, if burst loss rate exceeds a threshold value at a certain node, a new alternative routing path is chosen according to burst priority and location of burst generation, which enables the contending bursts to detour around the congested link. Moreover, for reducing the effect of sending bursts on the primary path due to the alternative path, we also apply a minimum path-cost based routing on link-cost concept. Our simulation results show that proposed scheme improves the network performance in terms of burst loss probability and throughput by comparing with conventional one.

Performance Evaluation of the WDM Ring Network Based on Photonic Slot Routing (광-슬롯 경로 배정 방식을 기반으로 한 WDM 링의 성능 평가)

  • 한상현;이호숙;소원호;은지숙;김영천
    • Proceedings of the IEEK Conference
    • /
    • 1999.06a
    • /
    • pp.154-157
    • /
    • 1999
  • Photonic Slot Routing(PSR) is a promising approach to solve the fundamental scalability problem of all-optical packet switched WDM networks. In photonic slot routing, packets destined for the same subnetwork are aggregated to form a photonic slot which is jointly routed as a single unit of information through the network. The relative location of the nodes from bridge may cause to fairness problem in the unidirectional WDM ring network based on PSR. As photonic slots from different subnetworks can originate contentions at the bridge, packets may be dropped and retransmitted. Thus we evaluated the performance of PSR based WDM ring network in the point of fairness for each node and slot contentions at the bridge. Simulation results show that the PSR based WDM ring requires a slot access mechanism to guarantee the transmission fairness and efficient switch architecture to resolve slot contention at the bridge.

  • PDF

A Study on Modeling and Algorithm for WDM VWP Network Design (WDM VWP 네트워크 설계 모형 및 알고리즘 연구)

  • Lee, Hee-Sang;Hong, Sung-Pil;Song, Hae-Goo
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.26 no.4
    • /
    • pp.296-305
    • /
    • 2000
  • Virtual wavelength path (VWP) is the optical path when a wavelength conversion is possible in a wavelength division multiplexing (WDM) network that is transmission infrastructure for the next generation high speed backbone networks. To achieve efficient design for VWP networks, we must consider VWP routing, wavelength assignment, and wavelength conversion while satisfying many technical constraints of the WDM networks. In this study we propose an integrated model for efficient VWP design in WDM networks. We also develope a 3-phase algorithm, each of which deals with routing, wavelength assignment and route and wavelength reassignment, respectively. In our computational experiments, phase 1 algorithm can solve the problem to the optimality for medium size test networks. Phase 2 algorithm is an efficient heuristic based on a reduced layered network and can give us an effective wavelength assignment. Finally, phase 3 algorithm reconfigure VWP routing and its wavelength assignment to concentrate wavelength conversion nodes in the suggested VWP network.

  • PDF

Routing with Maximum Edge Disjoint Paths and Wavelength Assignment with Path Conflict Graph (최대 EDP를 이용한 경로설정 및 경로 충돌 그래프를 이용한 파장할당 문제 해결 방안)

  • Kim Duk Hun;Chung Min Young;Lee Tae-Jin;Choo Hyunseung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.7B
    • /
    • pp.417-426
    • /
    • 2005
  • Routing and wavelength assignment problem is one of the most important issues in optical transport networks based on wavelength division multiplexing(WDM) technique. In this paper, we propose a novel approach using path conflict graphs and an algorithm for finding all edge disjoint paths. And then we compare the performance of the proposed algorithm with that of bounded greedy approach for EDP(BGAforEDP). The proposed one outperforms up to about 20$\%$ in the fixed traditional topology(NSFNET) and about 32$\%$ in random topologies over the BGA for EDP algorithm.

Genetic Algorithms Based Routing for LightPath In Mesh-Like Optical Communication Networks (메쉬형 광통신 네트워크에서의 광경로를 위한 유전자 알고리즘 기반의 라우팅)

  • 박용규;위규범;홍만표;예홍진
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2000.04a
    • /
    • pp.707-709
    • /
    • 2000
  • 본 논문은 광네트워크(optical network)에서 정보의 송/수신에 필요한 광경로를 설정하기 위한 방법으로 유전자 알고리즘을 이용한 라우팅 전략을 제시하고 있다. 논문에서 제시하는 유전자 알고리즘(genetic algorithms)은 메쉬형(mesh-like)광 네트워크의 각 링크에 적은 수의 광경로(lightpath)가 통과하도록 하여 네트워크 전체 링크의 사용빈도를 감소시키고 광경로들이 특정 링크로 집중되는 현상을 감소시켜 네트워크의 효율을 증가시키는 라우팅 전략을 제시할 수 있음을 보이고 있다.

  • PDF

Design of ONU for EPON Based Access Network (EPON 액세스 망 기반의 ONU 설계)

  • 김용태;신동범;이형섭
    • Proceedings of the IEEK Conference
    • /
    • 2003.07a
    • /
    • pp.633-636
    • /
    • 2003
  • An Ethernet passive optical network(EPON) is a point-to-multipoint optical network. EPONs leverage the low cost, high performance curve of Ethernet systems to provide reliable data, voice and video to end user at bandwidths far exceeding current access technologies. In this paper, we propose the economical and flexible structure of optical network unit(ONU) converting optical format traffic to the customer's desired format(Ethernet, VDSL, T1, IP multicast, etc.). A unique feature of EPONs is that in addition to terminating and converting the optical signal the ONU provide Layer 2-3 switching functionality, which allows internal routing of enterprise traffic at the ONU.

  • PDF