• Title/Summary/Keyword: fault tolerance information

Search Result 328, Processing Time 0.028 seconds

Transient Multipath routing protocol for low power and lossy networks

  • Lodhi, Muhammad Ali;Rehman, Abdul;Khan, Meer Muhammad;Asfand-e-yar, Muhammad;Hussain, Faisal Bashir
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.4
    • /
    • pp.2002-2019
    • /
    • 2017
  • RPL routing protocol for low-power and lossy networks is an Internet Engineering Task Force (IETF) recommended IPv6 based protocol for routing over Low power Lossy Networks (LLNs). RPL is proposed for networks with characteristics like small packet size, low bandwidth, low data rate, lossy wireless links and low power. RPL is a proactive routing protocol that creates a Directed Acyclic Graph (DAG) of the network topology. RPL is increasingly used for Internet of Things (IoT) which comprises of heterogeneous networks and applications. RPL proposes a single path routing strategy. The forwarding technique of RPL does not support multiple paths between source and destination. Multipath routing is an important strategy used in both sensor and ad-hoc network for performance enhancement. Multipath routing is also used to achieve multi-fold objectives including higher reliability, increase in throughput, fault tolerance, congestion mitigation and hole avoidance. In this paper, M-RPL (Multi-path extension of RPL) is proposed, which aims to provide temporary multiple paths during congestion over a single routing path. Congestion is primarily detected using buffer size and packet delivery ratio at forwarding nodes. Congestion is mitigated by creating partially disjoint multiple paths and by avoiding forwarding of packets through the congested node. Detailed simulation analysis of M-RPL against RPL in both grid and random topologies shows that M-RPL successfully mitigates congestion and it enhances overall network throughput.

Connector for Dynamic Composition of Aspects Based on AOSD (AOSD기반에서 Aspect의 동적결합을 위한 Connector)

  • Kim Tae-Woong;Kim Tae-Gong
    • The KIPS Transactions:PartD
    • /
    • v.13D no.2 s.105
    • /
    • pp.251-258
    • /
    • 2006
  • Aspect-Oriented Software Development is new software development method. It has many advantages related to software performance, maintenance and repair. Also it offers modularization method to a existing programming language for secondary function such as security and fault tolerance. But the present problem is that we have to use new aspect-oriented programming language. Further more when we apply Aspect to legacy system, we have to recompile the source code in order to build software system based on AOSD. In this paper, we propose and design Connector that can be composed with Aspect in legacy system dynamically. To elaborate this work, we use the information of operations about Core and Aspect, and the information of pointcut described with XML. We validate that the proposed Connector has features such as no need of new compiler, no recompilation and no modification of legacy system through case study.

Low-Cost Causal Message Logging based Recovery Algorithm Considering Asynchronous Checkpointing (비동기적 검사점 기록을 고려한 저 비용 인과적 메시지 로깅 기반 회복 알고리즘)

  • Ahn, Jin-Ho;Bang, Seong-Jun
    • The KIPS Transactions:PartA
    • /
    • v.13A no.6 s.103
    • /
    • pp.525-532
    • /
    • 2006
  • Compared with the previous recovery algorithms for causal message logging, Elnozahy's recovery algerian considerably reduces the number of stable storage accesses and enables live processes to execute their computations continuously while performing its recovery procedure. However, if causal message logging is used with asynchronous checkpointing, the state of the system may be inconsistent after having executed this algorithm in case of concurrent failures. In this paper, we show these inconsistent cases and propose a low-cost recovery algorithm for causal message logging to solve the problem. To ensure the system consistency, this algorithm allows the recovery leader to obtain recovery information from not only the live processes, but also the other recovering processes. Also, the proposed algorithm requires no extra message compared with Elnozahy's one and its additional overhead incurred by message piggybacking is significantly low. To demonstrate this, simulation results show that the first only increases about 1.0%$\sim$2.1% of the recovery information collection time compared with the latter.

A System Design for Real-Time Monitoring of Patient Waiting Time based on Open-Source Platform (오픈소스 플랫폼 기반의 실시간 환자 대기시간 모니터링 시스템 설계)

  • Ryu, Wooseok
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.22 no.4
    • /
    • pp.575-580
    • /
    • 2018
  • This paper discusses system for real-time monitoring of patient waiting time in hospitals based on open-source platform. It is necessary to make use of open-source projects to develop a high-performance stream processing system, which analyzes and processes stream data in real time, with less cost. The Hadoop ecosystem is a well-known big data processing platform consisting of numerous open-source subprojects. This paper first defines several requirements for the monitoring system, and selects a few projects from the Hadoop ecosystem that are suited to meet the requirements. Then, the paper proposes system architecture and a detailed module design using Apache Spark, Apache Kafka, and so on. The proposed system can reduce development costs by using open-source projects and by acquiring data from legacy hospital information system. High-performance and fault-tolerance of the system can also be achieved through distributed processing.

Method for Group Communication Support in CORBA using OCI (OCI를 이용한 CORBA에서의 그룹 통신 지원 방법)

  • Nam, Duk-Yun;Lee, Dong-Man
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.8 no.4
    • /
    • pp.399-410
    • /
    • 2002
  • Group communication is one of key components supporting object replication. CORBA provides little support for fault tolerance and high availability that can be supported by means of object replication. The existing approaches do not allow transparent plug-in of group communication protocols into CORBA with which CORBA application programmers are able to directly exploit group communication protocols. They either require modification of CORBA or OS, or provide no room for incorporating group communication transport protocols into CORBA. In this paper, we propose a generic group communication framework that allows transparent plug-in of various group communication protocols with no modification of standard CORBA. For this, we extend the Open Communications Interface(OCI) to support interoperability, reusability of existing group communication, and independency on ORB and OS. The proposed approach can also be applied to various group communication protocols.

Study on the efficient consensus process of PBFT

  • Min, Youn-A
    • Journal of the Korea Society of Computer and Information
    • /
    • v.25 no.4
    • /
    • pp.47-53
    • /
    • 2020
  • Blockchain is a distributed shared ledger that transparently manages information through verification and agreement between nodes connected to a distributed network. Recently, cases of data management among authorized agencies based on private blockchain are increasing. In this paper, we investigated the application cases and technical processes of PBFT, the representative consensus algorithm of private blockchain, and proposed a modified PBFT algorithm that enables efficient consensus by simplifying duplicate verification and consensus processes that occur during PBFT processing. The algorithm proposed in this paper goes through the process of selecting a delegation node through an authoritative node and can increase the safety of the delegation node selection process by considering an efficient re-election algorithm for candidate nodes. By utilizing this research, it is possible to reduce the burden on the network communication cost of the consensus process and effectively process the final consensus process between nodes.

A Fault Tolerant ATM Switch using a Fully Adaptive Self-routing Algorithm - The Cyclic Banyan Network (실내 무선 통신로에서 파일럿 심볼을 삽입한 Concatenated FEC 부호에 의한 WATM의 성능 개선)

  • 박기식;강영흥;김종원;정해원;양해권;조성준
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.24 no.9A
    • /
    • pp.1276-1284
    • /
    • 1999
  • We have evaluated the BER's and CLP's of Wireless ATM (WATM) cells employing the concatenated FEC code with pilot symbols for fading compensation through the simulation in indoor wireless channel modeled as a Rayleigh and a Rician fading channel, respectively. The results of the performance evaluation are compared with those obtained by employing the convolutional code in the same condition. In Rayleigh fading channel, considering the maximum tolerance BER ( $10^-3$) as a criterion of the voice service, it is blown that the performance improvement of about 4 dB is obtained in terms of $E_b/N_o$ by employing the concatenated FEC code with pilot symbols rather than the convolutional code with pilot symbols.When the values of K parameter which means the ratio of the direct signal to scattered signal power in Rician fading channel are 6 and 10, it is shown that the performance improvement of about 4 dB and 2 dB is obtained, respectively, in terms of $E_b/N_o$ by employing the concatenated FEC code with pilot symbols considering the maximum tolerance BER of the voice service. Also in Rician fading channel of K=6 and K= 10, considering CLP = $10^-3$ as a criterion, it is observed that the performance improvement of about 3.5 dB and1.5 dB is obtained, respectively, in terms of $E_b/N_o$ by employing the concatenated FEC code with pilot symbols.

  • PDF

A Monitoring Scheme Based on Artificial Intelligence in Mobile Edge Cloud Computing Environments (모바일 엣지 클라우드 환경에서 인공지능 기반 모니터링 기법)

  • Lim, JongBeom;Choi, HeeSeok;Yu, HeonChang
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.7 no.2
    • /
    • pp.27-32
    • /
    • 2018
  • One of the crucial issues in mobile edge cloud computing environments is to monitor mobile devices. Due to the inherit properties of mobile devices, they are prone to unstable behavior that leads to failures. In order to satisfy the service level agreement (SLA), the mobile edge cloud administrators should take appropriate measures through a monitoring scheme. In this paper, we propose a monitoring scheme of mobile devices based on artificial intelligence in mobile edge cloud computing environments. The proposed monitoring scheme is able to measure faults of mobile devices based on previous and current monitoring information. To this end, we adapt the hidden markov chain model, one of the artificial intelligence technologies, to monitor mobile devices. We validate our monitoring scheme based on the hidden markov chain model. The proposed monitoring scheme can also be used in general cloud computing environments to monitor virtual machines.

Load-balanced Topology Maintenance with Partial Topology Reconstruction (부분 토폴로지 재구성 기법을 적용한 부하 균형 토폴로지 유지)

  • Hong, Youn-Sik;Lim, Hwa-Seok
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.12A
    • /
    • pp.1188-1197
    • /
    • 2010
  • A most important thing in a connected dominating set(CDS)-based routing in a wireless ad-hoc network is to select a minimum number of dominating nodes and then build a backbone network which is made of them. Node failure in a CDS is an event of non-negligible probability. For applications where fault tolerance is critical, a traditional dominating-set based routing may not be a desirable form of clustering. It is necessary to minimize the frequency of reconstruction of a CDS to reduce message overhead due to message flooding. The idea is that by finding alternative nodes within a restricted range and locally reconstructing a CDS to include them, instead of totally reconstructing a new CDS. With the proposed algorithm, the resulting number of dominating nodes after partial reconstruction of CDS is not changed and also its execution time is faster than well-known algorithm of construction of CDS by 20~40%. In the case of high mobility situation, the proposed algorithm gives better results for the performance metrics, packet receive ratio and energy consumption.

The Hybrid Fault Tolerant Technique for Embedded System (임베디드 시스템을 위한 복합 결함 허용 기법)

  • Kook, Joong-Jin;Hong, Ji-Man
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2007.06b
    • /
    • pp.273-278
    • /
    • 2007
  • 검사점 및 복구 도구(Checkpointing & Recovery Facility)를 이용하여 임베디드 시스템에서 결함 허용(Fault Tolerance) 기법을 적용할 경우 쓰기 작업의 오버헤드로 인해 실용성이 크게 떨어지게 된다. 실시간 운영체제와 함께 어떠한 한계 상황에서 결함 허용 및 복구 도구가 오히려 시스템의 성능을 저하시키는 요인으로 작용하게 되면 이는 결국 쓸모없는 도구가 되어 사용되지 않을 것이다. 따라서 프로세스의 복구를 위해 저장하는 프로세스 이미지의 기록에 소요되는 시간을 크게 낮추어야만 비로소 검사점 도구가 그 진가를 발휘하게 될 수 있다. 본 논문에서는 NVSRAM(Non Volatile SRAM)을 검사점 및 복구 도구의 저장 장치로 활용함으로써 기존의 검사점 도구에서 성능을 저하시키는 주원인이었던 검사점 기록의 오버헤드를 개선하기 위한 연구를 수행하였다. 검사점 기록 시간을 줄이기 위한 방법으로 주 메모리에 저장된 프로세스의 복구와 관련된 데이터를 SRAM 특성을 갖는 비휘발성 저장 장치인 NVSRAM에 저장하여 디스크 접근에 소요되는 시간을 최소화시킴으로써 임베디드 시스템에서 실용적으로 사용 가능한 검사점 도구를 구현하였고, 이러한 연구의 결과를 검증하기 위해 기존 시스템에서 저장 장치로 사용되던 플래시 메모리, 주 메모리, 원격 메모리를 사용하는 경우의 성능과 NVSRAM을 활용할 때의 성능을 비교해 보았다. 본 연구에서 제안하는 결함 허용 도구는 실제 시스템에 적용하여 효과적인 성능을 발휘할 수 있을 것이며, 차세대 메모리를 이용한 결함 허용 도구의 연구에 기여를 할 수 있을 것으로 기대된다.ate첨가배지(添加培地)에서 가장 저조(低調)하였다. vitamin중(中)에서는 niacin과 thiamine첨가배지(添加培地)에서 근소(僅少)한 증가(增加)를 나타내었다.소시켜 항이뇨 및 Na 배설 감소를 초래하는 작용과, 둘째는 신경 경로를 통하지 않고, 아마도 humoral factor를 통하여 신세뇨관에서 Na 재흡수를 억제하는 작용이 복합적으로 나타내는 것을 알 수 있었다.으로 초래되는 복합적인 기전으로 추정되었다., 소형과와 기형과는 S-3에서 많이 나왔다. 이상 연구결과에서 입도분포가 1.2-5mm인 것이 바람직한 것으로 나타났다.omopolysaccharides로 확인되었다. EPS 생성량이 가장 좋은 Leu. kimchii GJ2의 평균 분자량은 360,606 Da이었으며, 나머지 두 균주에 대해서는 생성 EPS 형태와 점도의 차이로 미루어 보아 생성 EPS의 분자구조와 분자량이 서로 다른 것으로 판단하였다.TEX>개로 통계학적으로 유의한 차이가 없었다. Heat shock protein-70 (HSP70)과 neuronal nitric oxide synthase (nNOS)에 대한 면역조직화학검사에서 실험군 Cs2군의 신경세포가 대조군 12군에 비해 HSP70과 nNOS의 과발현을 보였으며, 이는 통계학적으로 유의한 차이를 보였다(p<0.05). nNOS와 HSP70의 발현은 강한 연관성을 보였고(상관계수 0.91, p=0.000), nNOS를 발현하는 세포가 동시에 HSP70도 발현함을 확인할 수 있었다. 결론: 우리는 cyclosporin A가 토끼의 25분간의 척수허혈에 대해 척수보호 효과가 있었으며 이는 HSP70의

  • PDF