• Convergence Security Journal
• /
• v.13 no.4
• /
• pp.19-25
• /
• 2013

The increasing demand for fast, flexible and guaranteed Quality of Service (QoS) in core networks has caused to deploy MultiProtocol Label Switching (MPLS) and Generalized MPLS (GMPLS) control plane. In GMPLS control plane, path computation and cooperation processes are one of the crucial element to maintain an acceptable level of service. The Internet Engineering Task Force (IETF) has proposed the Path Computation Element (PCE) architecture. The PCE is a dedicated network element devoted to path computation process and communications between Path Computation Clients (PCC) and PCEs is realized through the PCE Protocol (PCEP). This paper examines the PCE-based path computation architecture to include the design and implementation of PCEP. The functional modules including Finite State Machine (FSM) and related key design issues of each state are presented. In particular we also discuss internal/external protocol interfaces that efficiently control the communication channels.

• Convergence Security Journal
• /
• v.13 no.6
• /
• pp.3-9
• /
• 2013

With the rapidly changing information communication environment and development of technologies, the informati on networks are evolved from traditional fixed form to an active variable network that flexible large variety of data can be transferred. To reflect the needs of users, the next generation using DWDM (Dense Wavelength Division M ultiplexing) transmission system and OXC (Optical Cross Connect) form a dynamic network. After that GMPLS (Ge neralized Multi-Protocol Label Switching) can be introduced to dynamically manage and control the Reconfigurable Optical Add-drop Multiplexer (ROADM)/Photonic Cross Connect (PXC) based network. This paper propose a softw are architecture of Path Computation Element (PCE) protocol that has proposed by Internet Engineering Task Force (IETF) to path computation. The functional blocks and Application Programming Interface (API) of the PCE protoco l implementation are also presented.

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

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.2
• /
• pp.678-690
• /
• 2014

The current networks do not disclose information about a management domain due to scalability, manageability and commercial reasons. Therefore, it is very hard to calculate an optimal path to the destination. Also, due to poor information sharing, if an error occurs in the intermediate path, it is very difficult to re-search the path and find the best path. Hence, to manage each domain more efficiently, an architecture with top-level path computation node which can obtain information of separate nodes are highly needed This study aims to investigate a federation of a united network around NRN(National Research Network) that could allow resource sharing between countries and also independent resource management for each country. Considering first the aspects that can be accessed from the perspective of a national research network, ICE(Information Control Element) and GFO(Global Federation Organizer)-based architecture is designed as a top-level path computation element to support traffic engineering and applied to the multi-domain network. Then, the federation for the independent management of resources and resource information sharing among national research networks have been examined.

• ETRI Journal
• /
• v.32 no.4
• /
• pp.622-625
• /
• 2010

In this letter, we assess the scalability of a path computation flooding (PCF) approach to compute optimal end-to-end inter-domain paths in a path computation element-based multi-domain network. PCF yields a drastically reduced network blocking probability compared to a blind per-domain path computation but introduces significant network control overhead and path computation complexity. In view of this, we introduce and compare an alternative low overhead PCF (LoPCF) solution. From the obtained results, LoPCF leads to similar blocking probabilities to PCF while exhibiting around 50% path computation complexity and network control overhead reduction.

• Electronics and Telecommunications Trends
• /
• v.31 no.5
• /
• pp.99-109
• /
• 2016

IETF Path Computation Element(PCE) 그룹에서는 데이터 전송을 위한 전달 경로를 찾는 엔진 기능을 중심으로 표준화를 진행하고 있다. 망의 상태, 위상, 자원 가용성, 정책을 기반으로 최적의 자원을 할당하는 경로 계산 기능과 구조, 프로토콜 등을 정의하는데 MPLS/GMPLS 망의 제어 평면 프로토콜 기반 전송을 위주로 출발하여 광, 회선 망에서의 적용과 서비스 표준이 실제 사례를 뒷받침하여 발전되었고 현재는 데이터 센터 네트워크, SDN, IoT 분야에서의 활용이 활발하게 논의되고 있다. 본고에서는 경로 계산 기능의 분산을 주요 목적으로 하여 이제는 범용의 전달망 관리 분야로 확대 적용되는 추세의 active stateful PCE와 Traffic Engineering Database (TED), Label Switched Path DB(LSP-DB), PCE Protocol(PCEP) 등을 포함한 관련 표준 현황을 살펴보고 향후 통합 전달망 제어 관리 진화 방향을 소개하고자 한다.

• Structural Engineering and Mechanics
• /
• v.5 no.5
• /
• pp.577-586
• /
• 1997

In nonlinear finite element stability analysis of structures, the foremost necessary procedure is the computation to precisely locate a singular equilibrium point, at which the instability occurs. The present study describes global and local procedures for the computation of stability points including bifurcation points and limit points. The starting point, at which the procedure will be initiated, may be close to or arbitrarily far away from the target point. It may also be an equilibrium point or non-equilibrium point. Apart from the usual equilibrium path, bypass and homotopy path are proposed as the global path to the stability point. A local iterative method is necessary, when it is inspected that the computed path point is sufficiently close to the stability point.

• Korean Journal of Computational Design and Engineering
• /
• v.16 no.4
• /
• pp.300-304
• /
• 2011

This paper proposes an approach to generate tool-path for laser pattern machining. Considering the mechanical structure of a laser pattern machine, it is quite similar to that of a 2D milling machine. Based on the observation, one may try to utilize the tool-path generation methodologies of 2D milling for the laser pattern machining. However, it is not possible to generate tool-path without considering the technological requirements of laser pattern machining which are different from those of 2D milling. In this paper, we identify the technological requirement of laser pattern machining, and propose a proper tool-path generation methodology to satisfy the technological requirements. For the efficient generation of tool-path, this paper proposes a tool-path element computation method, which is based on the concept of a monotone chain.

• Journal of Institute of Control, Robotics and Systems
• /
• v.12 no.5
• /
• pp.444-449
• /
• 2006

Path planning is a key element in navigation of a mobile robot. Several algorithms such as a gradient method have been successfully implemented so for. Although the gradient method can provide the global optimal path, it computes the navigation function over the whole environment at all times, which result in high computational cost. This paper proposes a high-speed path planning scheme, called a gradient method with topological information, in which the search space for computation of a navigation function can be remarkably reduced by exploiting the characteristics of the topological information reflecting the topology of the navigation path. The computing time of the gradient method with topological information can therefore be significantly decreased without losing the global optimality. This reduced path update period allows the mobile robot to find a collision-free path even in the dynamic environment.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37C no.12
• /
• pp.1195-1210
• /
• 2012

In this paper, we propose a new signaling protocol as an extension of Generalized Multi-Protocol Label Switching (GMPLS) based PCE protocol for control carrier ethernet. The proposed protocol is not only compatible with the GMPLS PCE standard protocol, but also provides the topology discovery and configuration. In order to verify interoperability, we implement the proposed protocol as well as the system integrating functions including commercial system for testbed. In addition, we have simulated topology discovery test for proposed protocol performance.