• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.11
• /
• pp.2634-2639
• /
• 2014

The idea of redundancy is used in order to improve the availability of networks and systems and there are various methods for implementing redundancy. To perform the availability analysis various stochastic models have been used. In this paper, 2N redundancy with one active service unit and one standby service unit is considered. To evaluate the expected availability, we model 2N redundancy using Stochastic Reward Nets. This model can be solved using the SPNP package.

• Journal of Korean Institute of Industrial Engineers
• /
• v.39 no.2
• /
• pp.90-98
• /
• 2013

The k-out-of-n system with mixed redundancy is defined as k-out-of-n system which both includes warm-standby and cold-standby components. In case that operating components in the system fail and the system needs quick transition of standby components to operation state, the k-out-of-n system with mixed redundancy is useful for decreasing system failure rate and operational cost. Reliability-Redundancy Optimization Problem (RROP) involves selection of components with multiple choices and redundancy levels for maximizing system reliability with constraints such as cost, weight, etc. A solution methodology by using harmony search algorithm for RROP of the k-out-of-n system with mixed redundancy to maximize system reliability was suggested in this study.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.39 no.12
• /
• pp.1022-1032
• /
• 2002

A multibit DRAM BIST methodology reducing redundancy programming overhead has been proposed. It is capable of counting and locating faulty bits simultaneously with the test. If DRAM cells are composed of n blocks generally, the proposed BIST can detect the state of no error, the location of faulty bit block if there is one error and the existence of errors in more than two blocks, which are n + 2 states totally, with only n comparators and an 3 state encoder. Based on the proposed BIST methodology, the testing scheme which can detect the number and locations of faulty bits with the errors in two or more blocks, can be easily implemented. Based on performance evaluation, the test and redundancy programming time of 64MEG DRAM with 8 blocks is reduced by 1/750 times with 0.115% circuit overhead.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.9
• /
• pp.1717-1722
• /
• 2016

Availability, one of the important metrics used to assess the performance of network system, is defined as the probability that a system is operational at a given point in time under a given set of environmental conditions. To improve the availability of the network service, the redundancy models and the rejuvenation schemes are the effective schemes to be typically used. In this paper, we analyse the effect of 2N redundancy model and/or rejuvenation scheme on the availability of network service. The 2N redundancy model consists of one active and one standby component and the performance of time-based rejuvenation scheme mainly depends on its rejuvenation period. We design stochastic reward net model for the 2N redundancy model with time-based rejuvenation scheme and analyse the service availability of the model using stochastic Petri net package. We provide some numerical examples of the service availability, which shows that the system with rejuvenation has higher availability than the system without rejuvenation.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.12
• /
• pp.2828-2835
• /
• 2015

In this paper, we analyse the effect of redundancy types and non-stop forwarding scheme on network service availability. We use stochastic reward net models as enabling modeling approach for the analytical evaluation. We first design stochastic reward nets for redundancy models with or without non-stop forwarding and then evaluate their availability using Stochastic Petri Net Package.

• Journal of applied mathematics & informatics
• /
• v.5 no.1
• /
• pp.41-50
• /
• 1998

There are various notions of partial ordering between life-times of systems; stochastic ordering failure rate ordering and likeli-hood ration ordering. In this paper we show that for series systems with non i.i.d. exponential lifetimes of components standby redundancy at component level is better than that at system level in failure rate or-dering and likelihood ratio ordering. We also demonstrate that for 2-component parallel systems with i.i.d. exponential lifetimes of com-ponents standby system redundancy is better than standby component redundancy in failure rate ordering and likelihood ratio ordering.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.10 no.2
• /
• pp.38-44
• /
• 1985

Systems reliability can be improved by using redundancy and/or developing more reliable components. This papaer considers a joint optimization of both alternatives for a series system. It is shown that the n-stage optimization problem can be decomposed into n single stage subproblem. Each subproblem is further transformed into a univariate optimization problem for which a simple and efficient solution method is developed.

• ETRI Journal
• /
• v.41 no.4
• /
• pp.473-482
• /
• 2019

High availability and reliability have been considered promising requirements for the support of seamless network services such as real-time video streaming, gaming, and virtual and augmented reality. Increased availability can be achieved within a local area network with the use of the virtual router redundancy protocol that utilizes backup routers to provide a backup path in the case of a master router failure. However, the network may still lose a large number of packets during a failover owing to a late failure detections and lazy responses. To achieve an efficient failover, we propose the implementation of fast detection with virtual router redundancy protocol (FDVRRP) in which the backup router quickly detects a link failure and immediately serves as the master router. We implemented the FDVRRP using open neutralized network operating system (OpenN2OS), which is an open-source-based network operating system. Based on the failover performance test of OpenN2OS, we verified that the FDVRRP exhibits a very fast failure detection and a failover with low-overhead packets.

• Journal of Digital Contents Society
• /
• v.19 no.4
• /
• pp.693-700
• /
• 2018

Virtual router redundancy protocol (VRRP) was designed as a solution to support fast fail-over in case of network failure. There exists virtual router which acts as default gateway in LAN, and the virtual router is dynamically elected between master and backup router. Through this protocol, end-hosts can be provided seamless network service. However, it needs expensive license fees and maintenance costs to adopt current commercial network operating systems. Furthermore, they are commonly enterprise proprietary software and inherently closed source. In order to tackle these problem, Open N2OS which is open source based open network software platform was developed. It has no dependency on hardware equipment, and provides high availability, scalability, various networking functions. In this paper, we handle VRRP operation and mechanism with related command line interface (CLI).

• Journal of KIISE:Databases
• /
• v.33 no.1
• /
• pp.12-31
• /
• 2006

The n-gram inverted index has two major advantages: language-neutral and error-tolerant. Due to these advantages, it has been widely used in information retrieval or in similar sequence matching for DNA and Protein databases. Nevertheless, the n-gram inverted index also has drawbacks: the size tends to be very large, and the performance of queries tends to be bad. In this paper, we propose the two-level n-gram inverted index (simply, the n-gram/2L index) that significantly reduces the size and improves the query performance while preserving the advantages of the n-gram inverted index. The proposed index eliminates the redundancy of the position information that exists in the n-gram inverted index. The proposed index is constructed in two steps: 1) extracting subsequences of length m from documents and 2) extracting n-grams from those subsequences. We formally prove that this two-step construction is identical to the relational normalization process that removes the redundancy caused by a non-trivial multivalued dependency. The n-gram/2L index has excellent properties: 1) it significantly reduces the size and improves the Performance compared with the n-gram inverted index with these improvements becoming more marked as the database size gets larger; 2) the query processing time increases only very slightly as the query length gets longer. Experimental results using databases of 1 GBytes show that the size of the n-gram/2L index is reduced by up to 1.9${\~}$2.7 times and, at the same time, the query performance is improved by up to 13.1 times compared with those of the n-gram inverted index.