• Proceedings of the Korea Information Processing Society Conference
• /
• 2000.04a
• /
• pp.643-648
• /
• 2000

본 논문에서는 광 네트워크에서 방송(broadcasting)을 위해 유전자 알고리즘을 이용한 라우팅 전략(routing strategy)을 제시하고 있다. 논문에서 제시하는 유전자 알고리즘(genetic algorithms)은 메쉬형(mesh-like) 광 네트워크의 각 링크에 적은 수의 광경로(lightpath)가 통과하도록 하여 네트워크 전체 링크의 사용빈도를 감소시키고 광경로들이 특정 링크로 집중되는 현상을 감소시켜 파장의 수가 고른 노드들을 네트워크에 위치시키므로 네트워크의 효율을 증가시키는 라우팅 전략을 제시할 수 있음을 보이고 있다.

• 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.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.1338-1341
• /
• 2004

In this paper, we have proposed a new approach of routing and wavelength assignment algorithms, called Possible Available Wavelength (PAW) algorithm. The weight of a link is used as the main factor for routing decision in PAW algorithm. The weight of a link is defined as a function of hop count and available wavelengths. This function includes a determination factor of the number of wavelengths that are being used currently and are supposed to be available after a certain time. The session requests from users will be routed on the links that has the greatest number of link weight by using Dijkstra's shortest path algorithm. This means that the selected lightpath will has the least hop count and the greatest number of possible available wavelengths. The impact of proposed link weight computing function on the blocking probability and link utilization is investigated by means of computer simulation and comparing with the traditional mechanism. The results show that the proposed PAW algorithm can achieve the better performance in terms of the blocking probability and link utilization.

• Journal of Communications and Networks
• /
• v.8 no.2
• /
• pp.228-233
• /
• 2006

Survivability is a very important requirement for the deployment of broadband networks because out of service links can affect volumes of traffic even if it is a very short time. And the data paths of broadband networks, which are critical for traffic engineering, are always necessary to be well protected. The procedure of protection or restoration for a path is initiated when failure is detected within the working path. In order to minimize the influence on transmission quality caused by the failure of links and to provide a definite time for the recovery from the failure, the protection switching time (PST) should be carefully considered in the path arrangement. Several researches have been devoted to construct the protection and restoration schemes of data paths over dense wavelength division multiplexing (DWDM) networks, however, there was rare research on the design of data paths with guaranteed protection switching time. In this paper, the PST-guaranteed scheme, which is based on the concept of short leap shared protection (SLSP), for the arrangement of data paths in DWDM networks is proposed. The proposed scheme provides an efficient procedure to determine a just-enough PST-guaranteed backup paths for a working path. In addition to selecting the PST-guaranteed path, the network cost is also considered in a heuristic manner. The experimental results demonstrate that the paths arranged by the proposed scheme can fully meet the desired PST and the required cost of the selected path is competitive with which of the shared path scheme.

• Journal of Communications and Networks
• /
• v.9 no.4
• /
• pp.394-401
• /
• 2007

High speed all optical network is a viable option to satisfy the exponential growth of internet usage in the recent years. Optical networks offer very high bit rates and, by employing technologies like internet protocol over wavelength division multiplexing(IP-over-WDM), these high bit rates can be effectively utilized. However, failure of a network component, carrying such high speed data traffic can result in enormous loss of data in a few seconds and persistence of a failure can severely degrade the performance of the entire network. Designing IP-over-WDM networks, which can withstand failures, has been subject of considerable interest in the research community recently. Most of the research is focused on the failure of optical links in the network. This paper addresses the problem of designing IP-over-WDM networks that do not suffer service degradation in case of a single link failure. The paper proposes an approach based on the framework provided by a recent paper by M. Kurant and P. Thiran. The proposed approach can be used to design large survivable IP-over-WDM networks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.8
• /
• pp.1883-1892
• /
• 1998

This paper considers the efficient design of routing path and wavelength assignment asignment in the sigle-hop WDM optical transport networks. The connecton demands between node-pairs are given and a connection must be made by only one lightpath. It is assumed that no wavelength conversion is allowed and the physical topology of the network is given. This paper proposes a method to find the routes of lightpaths and assign wavelengths to the routes, which minimizes the number of total wavelength to satisfy all connection demands. We establish a new optimization model that finds the minimum number of wavelengths. A heuristic algorithm with polynomial iterations is developed for the problem. The algorithm is implemented and applied to the netowrks with real problem size. The results of the application are compared with the commericial optimization solver, GAMS/OSL and Wauters & Demeester [8].

• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.04b
• /
• pp.1381-1384
• /
• 2002

최근 인터넷 서비스는 최선형 서비스 제공 위주에서 실시간 멀티미디어 서비스들의 QoS 보장을 함께 지원하는 차등화된 서비스 형태로 발전하고 있다. 또한, 기존의 SONET/SDH 전송망에서 다중 기가비트 파장을 제공하는 WDM 기술이 차세대 인터넷의 중심 기술로 부상하고 있다. WDM 백본망은 Ingress와 Egress 쌍 간에 여러 lightpath를 제공하므로 각각의 광 품질에 따라 각기 다른 광 경로를 설정하여 차등화된 광 서비스를 제공할 수 있으나, 현재의 WDM 백본망은 종단간 QoS 서비스 보장을 위한 어떠한 지원도 제공하지 못하고 있는 실정이다. 본 논문에서는 다양한 실시간 멀티미디어 서비스들을 IP over WDM 백본망에 적용하기 위해, 파장을 레이블로 사용하여 QoS 제공 기능과 트래픽 분산 기능을 용이하게 수행하는 GMPLS 기술을 차등화 서비스 기술과 같이 접목하여 새로운 형태의 차등화된 광 QoS 서비스(DOS) 제공 방안을 기술 한다.

• Convergence Security Journal
• /
• v.12 no.1
• /
• pp.35-42
• /
• 2012

Increase of data traffic and the advent of new real-time services require to change from the traditional TDM-based (Time Division Multiplexing) networks to the optical networks that soft and dynamic configuration. Voice and lease line services are main service area of the traditional TDM-based networks. This optical network became main infrastructure that offer many channel that can convey data, video, and voice. To provide high resilience against failures, Packet-optical networks must have an ability to maintain an acceptable level of service during network failures. Fast and resource optimized lightpath restoration strategies are urgent requirements for the near future Packet-optical networks with a Generalized Multi-Protocol Label Switching(GMPLS) control plane. The goal of this paper is to provide packet-optical network with a hierarchical multi-layer recovery in order to fast and coordinated restoration in packet-optical network/GMPLS, focusing on new implementation information. The proposed schemes do not need an extension of optical network signaling (routing) protocols for support.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.2
• /
• pp.1-5
• /
• 2007

Wavelength-division multiplexed (WDM) networks are emerging to be the right choice for the future transport networks. In WDM networks, the optical layer provides circuit-switched lightpath services to the client layer such as IP, SONET and ATM. The set of lightpaths in the optical layer defines the virtual topology. Since the optical switches are reconfigurable, the virtual topology can be reconfigured in accordance with the changing traffic demand pattern at theclient layer in order to optimize the network performance. We present a new approach to the virtual topology reconfiguration and loadbalancing problem for wavelength-routed, optical wide-area networks under dynamic traffic demand. By utilizing the measured Internet backbone traffic characteristics, our approach follows the changes in traffic without assuming that the future traffic pattern is known. For the simulation traffic modeling, we collected the data from real backbone traffic. Experiments show that the standard deviation compared to previous technique is reduced.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.6
• /
• pp.2711-2733
• /
• 2018

Minimizing power consumption in bandwidth limited optical traffic grooming networks is presented as a two-objective optimization problem. Since the main objective is to route a connection, the network throughput is maximized first, and then the minimum power consumption solution is found for this maximized throughput. Both transparent IP over WDM (Tp-IPoWDM) and translucent IP over WDM (Tl-IPoWDM) network may be applied to examine such bi-objective algorithms. Simulations show that the bi-objective algorithms are more energy-efficient than the single objective algorithms where only the throughput is optimized. For a Tp-IPoWDM network, both link based ILP (LB-ILP) and path based ILP (PB-ILP) methods are formulated and solved. Simulation results show that PB-ILP can save more power than LB-ILP because PB-ILP has more path selections when lightpath lengths are limited. For a Tl-IPoWDM network, only PB-ILP is formulated and we show that the Tl-IPoWDM network consumes less energy than the Tp-IPoWDM network, especially under a sparse network topology. For both kinds of networks, it is shown that network energy efficiency can be improved by over-provisioning wavelengths, which gives the network more path choices.