• Title/Summary/Keyword: Service failure and recovery

Search Result 139, Processing Time 0.024 seconds

The Cost Analysis of Network by The Function of Automatic Link Recovery (자동링크복구 기능에 따른 네트워크 비용분석)

  • Song, Myeong-Kyu
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.8 no.6
    • /
    • pp.439-444
    • /
    • 2015
  • The Social infrastructure systems such as communication, transportation, power and water supply systems are now facing various types of threats including component failures, security attacks and natural disasters, etc. Whenever such undesirable events occur, it is crucial to recover the system as quickly as possible because the downtime of social infrastructure causes catastrophic consequences in the society. Especially when there is a network link-failure, we need an automatic link-recovery method. This means that customers are aware of network failures that can be recovered before you say that service. In this paper, we analysis the relation between Auto-recovery performance and cost.

Design and Analysis of Fault-Tolerant Object Group Framework for Effective Object Management and Load Distribution (효율적 객체 관리 및 부하 분산을 위한 고장포용 객체그룹 프레임워크 설계)

  • Kang, Myung-Seok;Jung, Jae-Yun;Kim, Hag-Bae
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.1B
    • /
    • pp.22-30
    • /
    • 2007
  • In this paper, to achieve consistency maintenance as well as stable service execution, we build a Fault-Tolerant Object Group framework that provides both of the group management service and the load scheduling service. The group management service supports the object management such as registration and authentication, and provides two schemes for failure recovery using the service priority and the checkpointing. In the load scheduling servile, we improve the effectiveness of service execution through the reasoning process of object loads based on the ANFIS architecture. The effectiveness in the performance of the developed framework is validated through a virtual home-network simulation based on the FTOG framework.

A study for improving database recovery ratio of Disaster Recovery System in financial industry (금융권 재해복구 시스템의 DB 데이터 복구율 향상을 위한 연구)

  • Kim, Jin-Ho;Seo, Dong-Kyun;Lee, Kyung-Ho
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.24 no.4
    • /
    • pp.655-667
    • /
    • 2014
  • A disaster is the time-excess case that computerized service can tolerate a failure and financial industry is being set up the disaster recovery system based on the disaster recovery plan and the business continuity plan for preparing these disasters. However, existing system can not guarantee the business continuity when it comes to cyber terror. This paper analyzes the building type and building technology of disaster recovery system for the financial fields. Also this paper explain the type of data backup using online redo log and type of archive log backup using WORM storage. And this paper proposes the model of improved data recovery combining above two types. Lastly this paper confirm the effectiveness and reliability for proposal rocovery model through the implementation of the test environment.

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.

On-box Container-based Switch Configuration Automation Technology to Minimize Network Interruption (네트워크 중단 최소화를 위한 On-Box 컨테이너 기반 스위치 설정 자동화 기술)

  • Gyoung-Hwan Yoo;Taehong Kim
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.19 no.3
    • /
    • pp.141-149
    • /
    • 2024
  • This paper proposes a configuration automation technique to minimize service interruption time in the event of a corporate network access layer switch failure. The automation is achieved without the need for a separate external system, as the network setting information is stored in a container inside the switch, enabling rapid recovery without requiring separate storage. This approach ensures the continuity of network services and demonstrates the efficiency of configuration automation. The proposed technique improves corporate network stability by providing a quick response in the event of a failure.

TCP Session Recovery Technique for High Availability in Smart On-Devices (스마트 온디바이스의 고가용성을 위한 TCP 세션 복구 기술)

  • Hong, Seungtae;Kim, Beob-Kyun;Lee, Kwang-Yong;Kim, Jeong-Si;Lim, Chae-Deok
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.6 no.6
    • /
    • pp.261-270
    • /
    • 2017
  • With the development of smart on-devices and communication technology, demand for non-stop services is increasing. Therefore, the high availability for continuously providing services in the event of system failure has been spotlighted. Meanwhile, because most internet-based services are provided by using TCP, an efficient TCP session recovery technique for providing non-stop services is required. However, the existing TCP session recovery techniques are inefficient because it has a high recovery cost or does not support failover operation, To solve these problems, in this paper, we propose a TCP session recovery technique for high availability in smart on-devices. For this, we first recover the TCP session without re-establish the TCP session by correcting a sequence number and a acknowledgment number. Second, we synchronize the TCP session recovery data between the master and the server, and then we operate the failover operation when master server fails. Finally, we provide the non-stop service to peer by using the virtual IP number and the transmission of GARP (Gratuitous ARP) packet.

On the Handling of Node Failures: Energy-Efficient Job Allocation Algorithm for Real-time Sensor Networks

  • Karimi, Hamid;Kargahi, Mehdi;Yazdani, Nasser
    • Journal of Information Processing Systems
    • /
    • v.6 no.3
    • /
    • pp.413-434
    • /
    • 2010
  • Wireless sensor networks are usually characterized by dense deployment of energy constrained nodes. Due to the usage of a large number of sensor nodes in uncontrolled hostile or harsh environments, node failure is a common event in these systems. Another common reason for node failure is the exhaustion of their energy resources and node inactivation. Such failures can have adverse effects on the quality of the real-time services in Wireless Sensor Networks (WSNs). To avoid such degradations, it is necessary that the failures be recovered in a proper manner to sustain network operation. In this paper we present a dynamic Energy efficient Real-Time Job Allocation (ERTJA) algorithm for handling node failures in a cluster of sensor nodes with the consideration of communication energy and time overheads besides the nodes' characteristics. ERTJA relies on the computation power of cluster members for handling a node failure. It also tries to minimize the energy consumption of the cluster by minimum activation of the sleeping nodes. The resulting system can then guarantee the Quality of Service (QoS) of the cluster application. Further, when the number of sleeping nodes is limited, the proposed algorithm uses the idle times of the active nodes to engage a graceful QoS degradation in the cluster. Simulation results show significant performance improvements of ERTJA in terms of the energy conservation and the probability of meeting deadlines compared with the other studied algorithms.

Robust Web Server System Using Virtual Machine Against DOS Attack (가상머신을 이용한 DoS 공격에 강건한 웹 서버 시스템)

  • Park, Seung Kyu;Yang, Hawan Seok;Kim, Bae Hyun
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.9 no.1
    • /
    • pp.1-7
    • /
    • 2013
  • The cloud computing is technology which gives flexible and solid infrastructure to IT environment. With this technology multiple computing environment can be consolidated in to a single server so that maximize system resource utilization. Better processing power can be achieved with less system resource. IT manager can cope with increasing unnecessary cost for additional server and management cost as well. This means a enterprise is able to provide services with better quality and create new services with surplus resource. The time required for recovery from system failure will be reduced from days to minutes. Enhanced availability and continuity of enterprise business minimize the codt and the risk produced by service discontinuity. In this paper, we propose framework architecture that is strong against denial-of-service attack.

Haw Clothing Stores Response to Customer Complaints Affects Future Purchase Intention (유형별 의류 점포의 소비자 불평처리 만족도에 따른 반복 구매 의도)

  • Park Kun-Hee;Hwang Choon-Sup
    • The Research Journal of the Costume Culture
    • /
    • v.13 no.6 s.59
    • /
    • pp.910-918
    • /
    • 2005
  • This study compares consumer satisfaction levels in clothing stores based on, consumer complaint behavior. This study investigates the relationship between future purchase intention and consumer satisfaction with the response of clothing stores to complaints. The study was implemented through a normative-descriptive survey using self-administered questionnaires. The samples consisted of 509 female consumers residing in Seoul and its suburbs. Data were analyzed by following statistical methods: frequency analysis, t-test, ANOVA, regression analysis, and Duncan's multiple range test. Results are as follows: The satisfaction with response to complaints were different according to types of clothing stores. A significant relationship between the degree of satisfaction with service recovery and future purchase intension was found in all types of clothing stores. The future purchase intention increases, when consumers are fully satisfied with the way that a service failure was recovered.

  • PDF

Shared Protection of Lightpath with Guaranteed Switching Time over DWDM Networks

  • Chen Yen-Wen;Peng I-Hsuan
    • 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.