• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권7호
• /
• pp.2568-2588
• /
• 2021

Shared mesh protection (SMP) protects traffic against failures occurring in a working path, as with linear protection, and allows resource sharing of protection paths with different endpoints. The SMP mechanism coordinates multiple protection paths that require shared resources when failures occur on multiple working paths. When multiple failures occur in SMP networks sharing limited resources, activation can fail because some of the resources in the protection path are already in use. In this case, a node confirming that a resource is not available has the option to wait until the resource is available or to withdraw activation of the protection path. In this study, we recognize that the protection switching time and the number of protected services can be different, depending on which option is used for SMP networks. Moreover, we propose a detailed design for the implementation of SMP by considering options and algorithms that are commonly needed for network nodes. A simulation shows the performance of an SMP system implemented with the proposed design and utilizing two options. The results demonstrate that resource utilization can be increased or protection switching time can be shortened depending on the option selected by the network administrator.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권4호
• /
• pp.1106-1127
• /
• 2012

Service oriented architecture (SOA) lends itself to model the application components to coarse-grained services in such a way that the composition of different services could be feasible. Service composition fulfills numerous service requirements by constructing composite applications with various services. As it is the case in many real-world applications, different users have diverse QoS demands issuing for composite applications. In this paper, we present a service composition framework for a typical service overlay network (SON) considering both multiple QoS constraints and load balancing factors. Moreover, a service selection algorithm based on niching technique and particle swarm optimization (PSO) is proposed for the service composition problem. It supports optimization problems with multiple constraints and objective functions, whether linear or nonlinear. Simulation results show that the proposed algorithm results in an acceptable level of efficiency regarding the service composition objective under different circumstances.

• Journal of Power Electronics
• /
• 제19권4호
• /
• pp.1034-1044
• /
• 2019

In medium-voltage and high-voltage high-power converters, the switching devices need to operate at a low switching frequency to reduce power loss and increase the power capacity. This increases the delay of the signal sampling and PWM. It also makes the cross-couplings of the d-q current components more severe. In addition, the LCL filter has three cross-coupling loops and is prone to resonance. In order to solve these problems, this paper establishes a complex vector model of an LCL type grid-connected converter. Based on this model, two multiple decoupling current control strategies with passive damping / notch damping are proposed for the LCL type grid-connected converter. The proposed strategies can effectively eliminate the cross-couplings of the converter, achieve independent control of the d-q current components, expand the stable region and suppress the resonance of the LCL filter. Simulation and experimental results verify the correctness of the theoretical analysis and the feasibility of the proposed strategies.

• 한국정보통신학회:학술대회논문집
• /
• 한국정보통신학회 2019년도 춘계학술대회
• /
• pp.398-399
• /
• 2019

본 논문에서는 최근에 디지털논리시스템의 회로 구현시에 적용되기 시작한 분할설계기법의 한가지 방법을 제안하였다. 기존의 디지털논리회로설계기법은 적용되는 개별소자를 어떻게 효과적이며 효율적으로 이용하느냐 하는 것이 큰 목적이었으나, 최근의 전자공학의 발달과 회로의 집적도가 높아짐에 따라서 디지털논리설계기법은 각각의 모듈을 구성하고 있는 소자들의 개별소자를 사용하는 것보다는 복잡하더라도 좀 더 경제적이고 다기능의 분할설계기법이 요구되고 있다. 이러한 내용을 근간으로 본 논문에서는 효과적인 분할기법을 이용한 스위칭함수구성의 한가지 방법을 제안하였다.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1996년도 Proceedings of the Korea Automatic Control Conference, 11th (KACC); Pohang, Korea; 24-26 Oct. 1996
• /
• pp.173-176
• /
• 1996

This paper deals with the problem of designing an adaptive regulator in order to improve transient performance in time-response when the linear state-space model of the plant contains unknown parameters which vary within prescribed bounds. The whole possible parameter space is divided into some subspaces and multiple models and controllers are established from the view point that each controller gives satisfactory transient behavior for systems corresponding to each parameter subspace. Based on time-response and an associated cost function, an appropriate controller is selected on-line out of multiple controllers.

• 한국산업정보학회논문지
• /
• 제7권5호
• /
• pp.67-72
• /
• 2002

출력 키수열의 사이클 수가 암호 분야에서 새로운 평가 요소로서 제안된 바 있으나 대부분의 이진 수열 발생기는 출력 사이클이 1개 뿐인 것으로 알려져 있다 본 논문에서는 다수 사이클을 갖는 발생기의 기본 함수로서 switching-tap LFSR과 이를 응용한 Rueppel 개선형 다수열 발생기를 제안하였다. 그리고 개선된 발생기에 대하여 주기, 선형 복잡도 및 출력 사이클 수에 대하여 안전성을 분석하였다.

• Industrial Engineering and Management Systems
• /
• 제6권2호
• /
• pp.106-118
• /
• 2007

This paper present a new optimization model to generate aggregate production planning by considering electric cost. The new Time Of Switching (TOS) electric type is introduced by switching over Time Of Day (TOD) and Time Of Use (TOU) electric types to minimize the electric cost. The fuzzy demand and Dynamic inventory tracking with multiple plant capacity are modeled to cover the uncertain demand of customer. The constraint for minimum hour limitation of plant running per one start up event is introduced to minimize plants idle time. Furthermore; the Optimal Weight Moving Average Factor for customer demand forecasting is introduced by monthly factors to reduce forecasting error. Application is illustrated for multiple cement mill plants. The mathematical model was formulated in spreadsheet format. Then the spreadsheet-solver technique was used as a tool to solve the model. A simulation running on part of the system in a test for six months shows the optimal solution could save 60% of the actual cost.

• 정보과학회 논문지
• /
• 제43권5호
• /
• pp.606-612
• /
• 2016

DASH(Dynamic Adaptive Streaming over HTTP) 기반의 다시점(Multi-view) 비디오 서비스는 여러 대의 카메라를 통해 획득한 다수의 영상 중에서 사용자가 선택한 영상이나 객체로 시점을 전환한다. 그러나 기존 DASH 기반의 다시점 비디오 서비스는 시점전환 이벤트가 발생하면 버퍼링 된 이전 비디오 영상의 모든 세그먼트를 소비한 후 새로운 비디오 영상을 재생하기 때문에 시점전환 시간이 오래 걸리는 문제가 있다. 본 논문에서는 DASH 기반의 다시점 비디오 서비스에서 시점전환 지연 최소화를 위한 비디오 전송 기법을 제안한다. 제안하는 기법은 시점전환 지연을 최소화하기 위해 GoP(Group of Pictures) 사이즈 조절을 통해 전환용 영상을 추가로 구성하고 대역폭 예측과 재생 버퍼 점유율을 기반으로 클라이언트 버퍼를 제어한다. 실험 결과를 통해 제안하는 기법이 시점전환 지연을 감소시키는 것을 확인하였다.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 1998년도 The Third Asian Fuzzy Systems Symposium
• /
• pp.537-542
• /
• 1998

Logic functions such as fuzzy switching functions and multiple-valued Kleenean functions, that are models of Kleene algebra have been studied as foundation of fuzzy logic. This paper deals with a new kinds of functions-fuzzy switching functions with constants-which have features of both the above two kinds of functions . In this paper, we propose new canonical forms for enumerating them. They are much useful to estimate simply the number of fuzzy switching functions with constants.

• 경영과학
• /
• 제12권2호
• /
• pp.89-103
• /
• 1995

Traditionally, the scarce and expensive resources in communication networks has been the bandwidth of transmission facilities; accordingly, the techniques used for networking and switching have been chosen so as to optimize the efficient use of that resource. One of them is the packet switching for data communications, which is much different from the circuit switching. It allows multiple users to share the data network facilities and bandwidth, rather than providing specific amounts of dedicated bandwidth to each users. One main challenge therefore has been to design and build cost-effective packet switching networks. In this paper, we develop a mathematical programming medel and heuristic algorithm for designing the packet switching networks with hop-count constraints. To develop an efficient heuristic, we apply the Lagrangian relaxation method. Some valid inequalities, which have been known as the tight constraints, are considered to improve the bound for Lagrangian sub-problem. The computational experiments show that the performance of the proposed heuristic is very satisfactory in both the speed and the quality of design solutions generated.