• Title/Summary/Keyword: network recovery

Search Result 595, Processing Time 0.024 seconds

Mastership Passing Algorithm for Train Communication Network Protocol (철도 제어통신 네트워크 프로토콜에서 마스터권한 진달 기법)

  • Seo, Min-Ho;Park, Jae-Hyun;Choi, Young-Joon
    • Journal of the Korean Society for Railway
    • /
    • v.10 no.1 s.38
    • /
    • pp.88-95
    • /
    • 2007
  • TCN(Train Communication Network) adopts the master/slave protocol to implement real-time communication. In this network, a fault on the master node, cased by either hardware or software failure, makes the entire communication impossible over TCN. To reduce fault detection and recovery time, this paper propose the contention based mastership transfer algorithm. Slave nodes detect the fault of master node and search next master node using the proposed algorithm. This paper also shows the implementation results of a SoC-based Fault-Tolerant MVB Controller(FT-MVBC) which includes the fault-detect-logic as well as the MVB network logic to verify this algorithm.

Design of A Faulty Data Recovery System based on Sensor Network (센서 네트워크 기반 이상 데이터 복원 시스템 개발)

  • Kim, Sung-Ho;Lee, Young-Sam;Youk, Yui-Su
    • The Transactions of the Korean Institute of Electrical Engineers P
    • /
    • v.56 no.1
    • /
    • pp.28-36
    • /
    • 2007
  • Sensor networks are usually composed of tens or thousands of tiny devices with limited resources. Because of their limited resources, many researchers have studied on the energy management in the WSNs(Wireless Sensor Networks), especially taking into account communications efficiency. For effective data transmission and sensor fault detection in sensor network environment, a new remote monitoring system based on PCA(Principle Component Analysis) and AANN(Auto Associative Neural Network) is proposed. PCA and AANN have emerged as a useful tool for data compression and identification of abnormal data. Proposed system can be effectively applied to sensor network working in LEA2C(Low Energy Adaptive Connectionist Clustering) routing algorithms. To verify its applicability, some simulation studies on the data obtained from real WSNs are executed.

Fault Location Technique of 154 kV Substation using Neural Network (신경회로망을 이용한 154kV 변전소의 고장 위치 판별 기법)

  • Ahn, Jong-Bok;Kang, Tae-Won;Park, Chul-Won
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.67 no.9
    • /
    • pp.1146-1151
    • /
    • 2018
  • Recently, researches on the intelligence of electric power facilities have been trying to apply artificial intelligence techniques as computer platforms have improved. In particular, faults occurring in substation should be able to quickly identify possible faults and minimize power fault recovery time. This paper presents fault location technique for 154kV substation using neural network. We constructed a training matrix based on the operating conditions of the circuit breaker and IED to identify the fault location of each component of the target 154kV substation, such as line, bus, and transformer. After performing the training to identify the fault location by the neural network using Weka software, the performance of fault location discrimination of the designed neural network was confirmed.

Design of resource efficient network reprogramming protocol (자원 효율적인 네트워크 리프로그래밍 프로토콜 설계)

  • Choi, Rock-Hyun;Hong, Won-Kee
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.15 no.3
    • /
    • pp.67-75
    • /
    • 2010
  • Network reprogramming is a technology that allows several sensor nodes deployed in sensor field to be repaired remotely. Unlike general communication in sensor network where small amount of data is transferred, network reprogramming requires reliable transfer of large amount of data. The existing network reprogramming techniques suffers high cost and large energy consumption to recover data loss in node communication. In this paper, a cluster based network reporgramming scheme is proposed for sensor network. It divides sensor field into several clusters and chooses a cluster header in charge of data relay to minimize duplicated transmission and unnecessary competition. It increases reliability by effective error recovery through status table.

CTaG: An Innovative Approach for Optimizing Recovery Time in Cloud Environment

  • Hung, Pham Phuoc;Aazam, Mohammad;Huh, Eui-Nam
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.4
    • /
    • pp.1282-1301
    • /
    • 2015
  • Traditional infrastructure has been superseded by cloud computing, due to its cost-effective and ubiquitous computing model. Cloud computing not only brings multitude of opportunities, but it also bears some challenges. One of the key challenges it faces is recovery of computing nodes, when an Information Technology (IT) failure occurs. Since cloud computing mainly depends upon its nodes, physical servers, that makes it very crucial to recover a failed node in time and seamlessly, so that the customer gets an expected level of service. Work has already been done in this regard, but it has still proved to be trivial. In this study, we present a Cost-Time aware Genetic scheduling algorithm, referred to as CTaG, not only to globally optimize the performance of the cloud system, but also perform recovery of failed nodes efficiently. While modeling our work, we have particularly taken into account the factors of network bandwidth and customer's monetary cost. We have implemented our algorithm and justify it through extensive simulations and comparison with similar existing studies. The results show performance gain of our work over the others, in some particular scenarios.

A Fast-Recovery Algorithm for Scatternet Reformation in Bluetooth Networks (블루투스 네트워크에서 스캐터넷 재구성을 위한 Fast-Recovery 알고리즘)

  • Zhang, Fan;Gu, Myeong-Mo;Kim, Sang-Bok
    • Journal of the Korea Society of Computer and Information
    • /
    • v.12 no.6
    • /
    • pp.251-259
    • /
    • 2007
  • A Bluetooth ad hoc network can be formed by interconnecting piconets into scatternet. Many algorithms of scatternet formation have been proposed so far. However, these have a problem that takes a long time to reform scatternet, especially for the case of master moving out. In this paper we propose a Fast-Recovery algorithm. which aims at reducing the time of scatternet reformation owing to master moving out. In the algorithm, we select a slave with the weigh similar to its master as Sub-Master from a piconet device table created by the master When a master leaves its piconet is detected by its slaves, the Sub-Master becomes the new master of the piconet instead of the old and directly connect to other slaves and bridge(s) through piconet device table in page state.

  • PDF

Replicated Chaeckpointing Failure Recovery Schemes for Mobile Hosts and Mobile Support Station in Cellular Networks (셀룰라 네트워크 환경에서의 이중화 체크포인팅을 이용한 이동 호스트 및 기지국 결함 복구 기법)

  • Byun, Kyue-Sub;Kim, Jai-Hoon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.1B
    • /
    • pp.13-23
    • /
    • 2002
  • A mobile host is prone to failure due to lack of stable storage, low bandwidth of wireless channel, high mobility, and limited battery life on the wireless network. Many researchers have studied to overcome these problems. For high level Availability in the cellular networks, it is necessary to consider recovery from the failures of mobile support stations as well as mobile as mobile hosts. In this paper, we present modified trickle scheme for recovery from failures of Mobile Support Station based on checkpointing scheme and analyze and compare the performance. We propose and analyze the performance of two schemes : one is waiting recovery scheme for the mobile support station having the last checkpoint and the other is searching the new path to the another mobile support station having the checkpoint.

High-availability Seamless Redundancy(HSR) Protocol for Automobile Networks (차세대 차량 네트워크를 위한 HSR (High-availability seamless Redundancy) 프로토콜 적용 연구)

  • Park, Jin-Pyo;Nsaif, Saad Allawi;Rhee, Jong-Myung
    • Journal of Satellite, Information and Communications
    • /
    • v.9 no.3
    • /
    • pp.33-40
    • /
    • 2014
  • One of the most important requirements for the Ethernet-based automobile is the reliability. In order to achieve this goal, we propose using the High-availability Seamless Redundancy (HSR) protocol (IEC 62439-3 clause 5) in these networks. The HSR protocol provides duplicated frame copies for each sent frame, which means that the destination node will receive at least one copy in case the second copy is lost due to a failure. In other words, there will be no network stoppage even if failure occurs. Moreover, the destination node will receive at least one frame copy with zero-recovery time (seamless) and it will not need to wait to receive the other copy if the first one is lost, which occurs it in the Ethernet standard, as a result of reconfiguration of the network paths. However, the main drawback of the HSR protocol is the unnecessary redundant traffic that is caused by the duplicated frames. Several solutions, including QR, VRing, RURT, and DVP, have already been proposed to improve the traffic performance of the HSR protocol. In this paper, we propose three automobile network topologies. each of which has pros and cons depending on the automobile requirements. Then we applied the HSR protocol with and without the QR and VRing approaches to each scenario. The comparison among these topologies depend on the traffic performance result for each of them. The QR and VRing approaches give a better traffic reduction percentage, ranging from 48% to 75% compared to the standard HSR protocol. Therefore they could limit the redundant traffic in automobile networks when the HSR protocol is used instead of the Ethernet network, which does not provide any seamless recovery if a failure occurs.

A Robust Recovery Method of Reference Clock against Random Delay Jitter for Satellite Multimedia System (위성 멀티미디어 시스템을 위한 랜덤 지연지터에 강인한 기준 클럭 복원)

  • Kim Won-Ho
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.6 no.2
    • /
    • pp.95-99
    • /
    • 2005
  • This paper presents an accurate recovery method of the reference clock which is needed for network synchronization in two-way satellite multimedia systems compliant with DVB-RCS specification and which use closed loop method for burst synchronization. In these systems, the remote station transmits TDMA burst via return link. For burst synchronization, it obtains reference clock from program clock reference (PCR) defined by MPEG-2 system specification. The PCR is generated periodically at the hub system by sampling system clock which runs at 27MHz $\pm$ 30ppm. Since the reference clock is recovered by means of digital PLL(DPLL) using imprecise PCR values due to variable random jitter, the recovered clock frequency of remote station doesn't exactly match reference clock of hub station. We propose a robust recovery method of reference clock against random delay jitter The simulation results show that the recovery error is remarkably decreased from 5 clocks to 1 clock of 27MHz relative to the general DPLL recovery method.

  • PDF

Design of Effective Subscriber Network Based on Interation network (음성 데이타 통합을 위한 가입자 망설계와 전송 성능 평가)

  • Chung, Jun-Ho;Eom, Ki-Bok;Yoe, Hyun
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2001.10a
    • /
    • pp.142-145
    • /
    • 2001
  • I did research or design technology of(integration) network of PSTN and PSDN in this paper. Network structure model in association with soft switching and access gateway can create various services based on web and live time and service fee at the rate of bandwidth which can't be provided by existing network based on SONET. Also, interns of capability(function) of each area and construction of local network subscribers, it has great recovery capability by separating each network as local areas. It indicates that it can additionally maximize the application of its own communication network and drastic reduction of communication cost because it is alternated to exclusive usage cost.

  • PDF