• Title/Summary/Keyword: Backup protection

Search Result 55, Processing Time 0.032 seconds

The Design of Active Storage Virtualization System for Information Protection (정보보호를 위한 능동적 스토리지 가상화 시스템 설계)

  • Cho, Kyoung-Ok;Han, Seung-Jo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.14 no.9
    • /
    • pp.2040-2048
    • /
    • 2010
  • In contemporary society, though convenience and efficiency of work using information system is growing high, adverse effect problems of malignant code, system hacking, information leak by insiders due to the development of the network are raising their head daily. Because of this, enormous work forces and expenses for the recovery and management of system is needed. The existing system can be divided into two aspects: security solution which surveils and treats virus and malignant codes, and network management solution which observes the system of computer, and practices maintenance and repair such as management, recovery, backup. This treatise applied Active Write Filter mechanism and the technology based on NFS and complemented the maintenance problems of user data of the existing system and designed the system which enables solving problems of intellectual property right such as information protection and illegal work.

Adaptation of p-Cycle considering QoS Constraints in WDM Networks (WDM 망에서 QoS 제약 조건을 고려한 p-Cycle 적용 방안)

  • Shin, Sang-Heon;Shin, Hae-Joon;Kim, Young-Tak
    • Journal of KIISE:Information Networking
    • /
    • v.30 no.5
    • /
    • pp.668-675
    • /
    • 2003
  • In this paper, we propose an enhanced p-cycle (preconfigured protection cycle) scheme for WDM mesh networks with QoS constraints. In the previous researches on p-cycle, it is assumed that user's connection has a hi-directional connectivity and the same bandwidth on both direction. Therefore it is difficult to apply p-cycle based link protection to uni-directional connections for multicasting or asymmetric broadband multimedia communications with hi-directional connectivity. And it didn't consider QoS of backup path. We enhanced the p-cycles to accomodate uni-directional connections for multicasting or asymmetric bandwidth communications with hi-directional connectivity. And we propose a selection procedure of p-cycle to assure QoS of backup path. We were able to reduce a required backup bandwidth by applying a uni-directional p-cycle concept to asymmetric broadband multimedia communication environment. The proposed p-cycle selection procedure is applied to the U.S. sample network to evaluate whether the configured p-cycles can support QoS constraint of working path and backup path.

Real-time Environmental Radiation Monitoring System with Automatic Restoration of Backup Data in Site Detector via Communication using Radio Frequency (현장검출기에 저장된 백업데이터를 무선통신방식으로 자동 복원하는 실시간 환경선량 감시 시스템)

  • Lee, Wan-No;Kim, Eun-Han;Chung, Kun-Ho;Cho, Young-Hyun;Choi, Geun-Sik;Lee, Chang-Woo;Park, Ki-Hyun;Kim, Yun-Goo
    • Journal of Radiation Protection and Research
    • /
    • v.28 no.3
    • /
    • pp.255-261
    • /
    • 2003
  • An environmental radiation monitoring system based on high pressurized ionization chamber has been used for on-line gamma monitoring surrounding the KAERI (Korea Atomic Energy Research Institute), which transmits the dose data measured from ion chamber on the site via radio frequency to a central processing computer and stores the transmitted real-time data. Although communication using radio frequency has several advantages such as effective and economical transmission, storage, and data process, there is one main disadvantage that data loss during transmission often happens because of unexpected communication problems. It is possible to restore the loss data by off-line such as floppy disk but the simultaneous process and display of current data as well as the backup data are very difficult in the present on-line system. In this work, a new electronic circuit board and the operation software applicable to the conventional environmental radiation monitoring system are developed and the automatical synchronization of the ion chamber unit and the central processing computer is carried out every day. This system is automatically able to restore the backup data within 34 hours without additional equipments and also display together the current data as well as the transmitted backup data after checking time flag.

Schemes to Overcome ATM VC Switch Failures using Backup Virtual Paths (예비 가상 경로를 이용한 ATM VC 교환기 고장 우회 방법)

  • Yoo, Young-Hwan;Ahn, Sang-Hyun;Kim, Chong-Sang
    • Journal of KIISE:Information Networking
    • /
    • v.27 no.2
    • /
    • pp.187-196
    • /
    • 2000
  • Failures in ATM networks can occur at virtual path (VP) links, virtual path switches, and virtual channel (VC) switches. Restoration schemes have been proposed for VP link and VP switch failures, however, none for VC switch failures. In general, VC switches are used for edge nodes in protection domains. Since even only one VC switch failure can cause a critical problem, new restoration schemes for VC switch failures are highly required. Restoration schemes at the VP level proposed so far can be categorized into those using the flooding algorithm and those using the backup virtual path (BVP) concept. Even though the latter cannot handle unpredictable failures, it has some advantages such as fast restoration and low spare capacity requirement. In this paper, we propose new restoration schemes using a new type of BVPs to handle VC switch failures. The simulation results show that the proposed schemes can restore virtual connection failures due to VC switch failures without degrading restorability for VP failures.

  • PDF

Design of optimum criterion for opportunistic multi-hop routing in cognitive radio networks

  • Yousofi, Ahmad;Sabaei, Masoud;Hosseinzadeh, Mehdi
    • ETRI Journal
    • /
    • v.40 no.5
    • /
    • pp.613-623
    • /
    • 2018
  • The instability of operational channels on cognitive radio networks (CRNs), which is due to the stochastic behavior of primary users (PUs), has increased the complexity of the design of the optimal routing criterion (ORC) in CRNs. The exploitation of available opportunities in CRNs, such as the channel diversity, as well as alternative routes provided by the intermediate nodes belonging to routes (internal backup routes) in the route-cost (or weight) determination, complicate the ORC design. In this paper, to cover the channel diversity, the CRN is modeled as a multigraph in which the weight of each edge is determined according to the behavior of PU senders and the protection of PU receivers. Then, an ORC for CRNs, which is referred to as the stability probability of communication between the source node and the destination node (SPC_SD), is proposed. SPC_SD, which is based on the obtained model, internal backup routes, and probability theory, calculates the precise probability of communication stability between the source and destination. The performance evaluation is conducted using simulations, and the results show that the end-to-end performance improved significantly.

Design of Remote Control System for Data Protection and Backup in Mobile Devices (이동통신 단말기에서 데이터 보호 및 백업을 위한 원격 제어 시스템 설계)

  • Joe, In-Whee
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.1B
    • /
    • pp.37-42
    • /
    • 2011
  • The change in performance of the mobile communication field took place due to jumping development of technology, so high performance terminals that anyone can directly search and amend desired information anywhere and anytime, namely, the mobile communication terminals called Smartphone were released to the market. The terminal can store informations that an individual stored, for example, call log, where to make contact and address of acquaintances, transmit/receive message and mail, photographs and videos, etc., but there are worries on surreptitious use of other people due to leaking of personal information through loss or theft of these terminals because of several reasons, so the present thesis aims to realize a method that remotely control information inside a terminal in case of loss of a mobile communication terminal.

MPLS Alternate Path Rerouting and Restoration (MPLS 대체 경로 재설정과 복구)

  • Lee Kil-Hung
    • The KIPS Transactions:PartC
    • /
    • v.12C no.3 s.99
    • /
    • pp.401-408
    • /
    • 2005
  • We propose a new MPLS restoration scheme that uses network resources more efficiently and minimizes the backup path cost effectively. Contrary to other restoration strategies, the proposed restoration scheme starts the recovery action at the selected node of a working LSP. At LSP setup, the working and backup path cost is evaluated and the starting node of restoration is designated. By doing so, the restoration speed could be further increased and resource utilization could be maximized. We simulated the proposed scheme and compared with other restoration and protection schemes. The result shows that our scheme can provide fast restoration with acceptable delay and loss characteristics.

A Study on the Protective Coordination and Automatic Setting Method using Agents in Distribution System with Loop (루프 배전계통에서 Agent를 이용한 보호협조 및 자동정정 방법에 관한 연구)

  • Jin, Young-Taek;Lee, Seung-Jae;Choi, Myeon-Song;Lim, Seong-Il;Kim, Wan-Tae
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.61 no.8
    • /
    • pp.1107-1114
    • /
    • 2012
  • In this paper, we propose protective coordination and automatic setting method using agents for distribution system with loop. The proposed protection scheme adopts an agent technology assuming communication among protection agents and auto-switch agents. Having exchanged fault-related information with each other, protection agents and auto-switch agents perform the primary and backup protection and fault section isolation, respectively. this proposed scheme using agents for distribution system with loop is implemented by matlab. Because of the various configuration of distribution system, It's difficult to find cooperative agents for each agent. This paper develops a program to automatically set the cooperative route for the agents.

A Novel Heuristic Mechanism for Highly Utilizable Survivability on WDM Mesh Networks

  • Jeong Hong-Kyu;Kim Byung-Jae;Kang Min-Ho;Lee Yong-Gi
    • 한국정보통신설비학회:학술대회논문집
    • /
    • 2003.08a
    • /
    • pp.159-162
    • /
    • 2003
  • This paper presents a novel heuristic mechanism, Dynamic-network Adapted Cost selection (DAC-selection), which has higher backup path sharing rate, lower number of blocked channel requests and number of used wavelengths fer reservation of working path and backup path by using unique cost function than that of widely used random selection (R-selection) mechanism and Combined Min-cost selection (CMC-selection) mechanism proposed by Lo, while maintaining 100% restoration capability.

  • PDF

Reliability-aware service chaining mapping in NFV-enabled networks

  • Liu, Yicen;Lu, Yu;Qiao, Wenxin;Chen, Xingkai
    • ETRI Journal
    • /
    • v.41 no.2
    • /
    • pp.207-223
    • /
    • 2019
  • Network function virtualization can significantly improve the flexibility and effectiveness of network appliances via a mapping process called service function chaining. However, the failure of any single virtualized network function causes the breakdown of the entire chain, which results in resource wastage, delays, and significant data loss. Redundancy can be used to protect network appliances; however, when failures occur, it may significantly degrade network efficiency. In addition, it is difficult to efficiently map the primary and backups to optimize the management cost and service reliability without violating the capacity, delay, and reliability constraints, which is referred to as the reliability-aware service chaining mapping problem. In this paper, a mixed integer linear programming formulation is provided to address this problem along with a novel online algorithm that adopts the joint protection redundancy model and novel backup selection scheme. The results show that the proposed algorithm can significantly improve the request acceptance ratio and reduce the consumption of physical resources compared to existing backup algorithms.