• Title/Summary/Keyword: 복구만족

Search Result 104, Processing Time 0.025 seconds

Methodology of Resilient Dynamic Path Management in GMPLS Network under Multiple Link Failures (GMPLS 네트워크에서 다중 경로 장애 발생시 Resilience를 만족하는 동적 경로 관리 방법)

  • Park Jong-Tae;Lee Wee-Hyuk;Kwon Jung-Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.5B
    • /
    • pp.397-404
    • /
    • 2006
  • As an increase in recent optical network-based IP services, GMPLS management framework becomes more important than ever before. In this paper, we propose the dynamic GMPLS path management algorithm, which can satisfy the users with their traffic engineering recovery requirements and find out the best backup service path under multiple link failures. To be more specific, we are deriving the soluble conditions of a backup path which is satisfied in a GMPLS network. In addition, through proposing the fast backup path selection algorithm, we can sufficiently satisfy a user's recovery requirement and minimally protect the suspension of the service against a link failure.

A Study on Service Recovery QoS Rerouting Algorithm Based on PFC (PFC 기반의 서비스 복구 QoS 재라우팅 알고리즘에 관한 연구)

  • Han, Jeong-Soo;Chung, Jin-Wook
    • The KIPS Transactions:PartC
    • /
    • v.9C no.5
    • /
    • pp.655-664
    • /
    • 2002
  • The focus of quality-of-service routing has been on the routing of a single path satisfying specified QoS constraints. However upon failure of a node or link on the path, a new path (backup path) satisfying the constraints has to be established. This paper proposed the fault recovery QoS Rerouting algorithms to recovery the service of applications under fault environment of network. For this, we describes the generation method of PFC (Protection Fundamental Cycle) protecting all of network nodes and suggests path selection algorithms using minimization rerouting cost problem and analyzes the performances of these.

A Study on the Design Model of the Key Escrow System (키 위탁 시스템 설계 모델에 관한 연구)

  • 채승철
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.10 no.1
    • /
    • pp.99-110
    • /
    • 2000
  • 암호 시스템에서 가장 중요한 정보는 키 정보이다. 키가 손상되거나 유실되면 모든정보가 유실되기 때문이다. 키 위탁 시스템이란 유사시의 상황에 대비해서 키를 특정한 위탁기관에 위탁함으로써 정보를 암호의 오용이나 키의 분실로부터 보호 할 수 있는 시스템이다. 키 위탁 시스템은 유사시에 확실하게 키를 복원할 수 있어야 하며, 동시에 복구 정보의 안전한 보관이 이루어져야 한다. 그리고 위탁 시스템으로 인해 사생활이 침해되지 않는 것 또한 중요하다. 이러한 요구사항들은 서로 상충되는 점이 있기 때문에 모든 요구사항을 만족시키는 키 위탁 시스템을 설계하기는 매우 어렵다. 본 논문에서는 키 위탁 시스템 설계시에 고려해야 할 요소를 도출하고, 키 위탁 시스템 설계 및 분석을 위한 모델을 제안한다. 이 모델은 정의된 요구사항을 만족시키는 키 복구 시스템을 설계할 때 유용하게 사용될 수 있으며, 이미 제안된 키 복구 시스템을 분석하는 도구로 활용될 수 있다.

A Service Restoration of distribution network using Genetic algorithm and Tabu search (유전 알고리즘과 Tabu Search를 이용한 배전계통 사고복구)

  • Cho, Chul-Hee;Shin, Dong-Joon;Jung, Hyeon-Soo;Kim, Jin-O
    • Proceedings of the KIEE Conference
    • /
    • 2000.07a
    • /
    • pp.382-384
    • /
    • 2000
  • 산업의 발달에 따라 배전계통의 자동화가 서서히 자리 매김하고 있다. 이에 따라 배전계통에서 발생하는 사고를 계통의 상태와 신뢰도를 동시에 만족시키고, 빠른 시간 내에 복구하는 문제는 매우 중요한 문제로 대두되고 있다. 배전계통 사고복구 문제는 많은 개폐기들의 조합에 의해 구성되어 있고, 계통의 구성상태 와 연계선로의 예비력 등 많은 제약조건들로 인하여 사고복구에 많은 시간이 걸린다. 본 논문에서는 유전 알고리즘과 Tabu Search (TS) 기법을 이용하여 계통의 사고 후 선로손실과 신뢰도손실을 최소로하는 배전계통 사고복구 알고리즘을 제안하고자 한다. 전역 최적해 탐색 및 여러 해의 동시 탐색이 가능한 유전알고리즘과 전역적 탐색은 약하지만 빠른 시간 내의 국부적 탐색(local search)이 우수한 TS를 서로 연계한 알고리즘의 우수성을 계통의 모의실험을 통하여 증명하였다.

  • PDF

Service Restoration In Distribution Networks Using Cyclic Best-First Search (순환적 최적우선탐색을 이용한 배전계통의 정전복구)

  • Choi, Sang-Yule
    • Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
    • /
    • v.18 no.5
    • /
    • pp.162-168
    • /
    • 2004
  • Service restoration is an emergency control in distribution control centers to restore out-of-service area as soon as possible when a fault occurs in distribution networks. Therefore, it requires fast computation time and high quality solutions for load balancing. In this paper, a load balance index and heuristic guided best-first search are proposed for these problem. The proposed algorithm consists of two parts. One is to set up a decision tree to represent the various switching operations available. Another is to identify the most effective the set of switches using proposed search technique and a feeder load balance index. Test results on the KEPCO's 108 bus distribution system show that the performance is efficient and robust.

Analysis of Hotel Customer Complaint and Recovery Strategy Using Critical Incident Technique (결정적 사건기법을 이용한 호텔 고객불평과 복구전략 분석)

  • Yoon, Sung-Wook;Seo, Mi-Ok
    • Journal of Global Scholars of Marketing Science
    • /
    • v.15 no.1
    • /
    • pp.61-79
    • /
    • 2005
  • A critical incident technique(CIT) was employed to show the results of empirical findings regarding hotel services. The major purpose of this study was to describe and analyze service failures from the customers' point of view and thus suggest strategic implications for hotel service providers. Four-hundred sixteen service failure anecdotes from hotel customers were classified using Hoffman et al.'s(1995) approach. The CIT data showed the three major categories and eleven sub-categories and revealed that, in general, tangible recovery(e.g., upgrade, free meal, discount) was more effective than intangible one(e.g., explanation, canned apology, manager's apology). Interestingly, however, sincere apology seemed to be a better recovery strategy than other types of tangible recovery. Furthermore, the results showed that severity of service failure had its own impact on customers' perception regarding hotel's service recovery efforts. In particular, irrespective of service recovery, severity of service problem was negatively related to intention to repurchase. Managerial implications and future research agenda was also discussed.

  • PDF

GMPLS-based Recovery Scheme Handling the Requirements for Various Service Types (다양한 서비스들의 요구사항을 만족하는 GMPLS 기반 복구 기법)

  • Lee, Yonggyu
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.26 no.5
    • /
    • pp.714-724
    • /
    • 2022
  • The spread of mobile devices comes to increase explosive data traffic and then results in various types of service demands. In order to satisfy the increment of traffic and the requirements for various services, optical internet technologies that transmit several Tbps through only a single optical fiber have been actively studied. Because of the large bandwidth, an optical link can accommodate a large number of service types. Therefore, new technologies are required to guarantee the survivability of optical internet and handle the requirements of each service. So, in this article, a new scheme based on GMPLS technologies is proposed to deal with the various service demands and survivability issues in IP over WDM networks.

Binary Locally Repairable Codes from Complete Multipartite Graphs (완전다분할그래프 기반 이진 부분접속복구 부호)

  • Kim, Jung-Hyun;Nam, Mi-Young;Song, Hong-Yeop
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.9
    • /
    • pp.1734-1740
    • /
    • 2015
  • This paper introduces a generalized notion, referred to as joint locality, of the usual locality in distributed storage systems and proposes a code construction of binary locally repairable codes with joint locality ($r_1$=2, $r_2$=3 or 4). Joint locality is a set of numbers of nodes for repairing various failure patterns of nodes. The proposed scheme simplifies the code design problem utilizing complete multipartite graphs. Moreover, our construction can generate binary locally repairable codes achieving (2,t)-availability for any positive integer t. It means that each node can be repaired by t disjoint repair sets of cardinality 2. This property is useful for distributed storage systems since it permits parallel access to hot data.

Protection Scheme Guaranteeing the Recovery Time Defined in Service Level Agreement in WDM Mesh Networks (WDM Mesh 네트워크에서 SLA 복구시간을 만족시키는 보호기법)

  • Hong, Kiwon;Yim, Taihyong;Kyung, Yeonwoong;Park, Jinwoo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39B no.1
    • /
    • pp.41-43
    • /
    • 2014
  • In this paper, we proposed a new protection scheme of the WDM mesh networks that can utilize the network resources efficiently while satisfying with the recovery time defined in the SLA (service level agreement). The protection scheme and the backup path are selected based on the comparison of the expected protection time with the SLA recovery time. The superior performance of the proposed protection scheme was demonstrated by comparing with ones of the existing protection schemes.

Development of high performance patching repair mortars with light weight and sulfuric acid resistance properties (경량 및 내황산 특성을 가진 고성능 단면복구 모르타르의 개발)

  • Kim, Kyoungmin;Park, Junhui;Ahn, Tae-ho
    • Journal of the Korean Crystal Growth and Crystal Technology
    • /
    • v.27 no.4
    • /
    • pp.167-172
    • /
    • 2017
  • In this study, high performance patching repair mortars with light weight and sulfuric acid resistance properties were suggested. Their performance estimation were investigated based on KS F 4042 using patching repair mortar with light weight aggregate and soluble polymer of Type I and sulfuric acid resistance mortar of Type II, From these results, it was confirmed that these motors were satisficed and improved by all standard tests of KS F 4042.