• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.8A
• /
• pp.1085-1095
• /
• 2000

In this paper, we have defined the rules and the algorithm for diagnosis and recovery of routing configuration fault on a system. By using them, we have implemented the Java-based system that can manage routing configuration fault automatically. To manage routing configuration fault, the production rule for network configuration management, the production rule for routing configuration fault diagnosis, and the production rule for routing configuration fault recovery have been proposed. Rule-based routing configuration fault management system has been implemented on the basis of backward chaining algorithm and applied for meta rules for the purpose of interconnecting the production rules. We have derived the experimental result from transition process of the rules, the Blackboard, the goals based on scenarios. Through the implementation of dynamically applicable system in heterogeneous and rapidly changing network environments, we have proposed the methodology for network configuration fault management. Also, we expect that network configuration manager can reduce time and cost wasted for routing configuration fault management.

• Nuclear Engineering and Technology
• /
• v.33 no.1
• /
• pp.1-11
• /
• 2001

In contrast with conventional fieldbus researches which are focused merely on real-time performance, this study aims to evaluate the real-time performance of the communication system including fault-tolerant mechanisms Maintaining performance in presence of recoverable faults is very important in case that the communication network is applied to a highly reliable system such as next generation Nuclear. Power. Plant (NPP). If the tie characteristics meet the requirements of the system, the faults will be recovered by fieldbus recovery mechanisms and the system will be safe. If the time characteristics can not meet the requirements, the faults in the fieldbus can propagate to the system failure. In this study, for the purpose of investigating the time characteristics of fieldbus, the recoverable faults are classified and then the formulas that represent delays including recovery mechanisms are developed. In order to validate the proposed approach, we have developed a simulation model that represents the Korea Next Generation Reactor (KNGR) NSSS Process Control System (NPCS). The results of the simulation show us the reasonable delay characteristics of the fault cases with recovery mechanisms. Using the simulation results and the system requirements, we also can calculate the failure propagation probability from fieldbus to outer system.

• The KIPS Transactions:PartC
• /
• v.9C no.5
• /
• pp.655-664
• /
• 2002

The focus of quality-of-service routing has been on the routing of a single path satisfying specified QoS constraints. However upon failure of a node or link on the path, a new path (backup path) satisfying the constraints has to be established. This paper proposed the fault recovery QoS Rerouting algorithms to recovery the service of applications under fault environment of network. For this, we describes the generation method of PFC (Protection Fundamental Cycle) protecting all of network nodes and suggests path selection algorithms using minimization rerouting cost problem and analyzes the performances of these.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.11B
• /
• pp.956-966
• /
• 2004

Nowadays, NGN(Next Generation Network) is evolving into network with packet based QoS.\ulcorner This paper presents the recovery method as a selecting way of more efficient path in MPLS network that reduces the service interruption time. In order to increase the efficiency of usage of recovering resource which is one of major functions of disorder recovering, it opens the state information of each Node both to fault detector and bandwidth broker so that it reduces message transmission time for recovery when functional disorder occurs. in addition, by effective management and adjustment of required bandwidth of entire network depending on the changes of traffic load, it improves the efficiency of bandwidth usage. and in MPLS network supporting priority selection function, it allocates domains depending on the traffic relating to priority order to the entire network so that\ulcorner it efficiently allocates proper resources to the restoring process between the entry and the end for the traffic of high priority and for low priority traffic, it restores path oかy inside disordered domain. by doing this, it reduces resetting time and unnecessary massage transmission.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37C no.11
• /
• pp.1036-1044
• /
• 2012

Thanks to progressive development of IT technology, the number of intelligent devices communicating each other through an In-Vehicle Network(IVN) has been steadily increasing. It is expected that the required network bandwidth and network nodes for vehicle control in 2015 will be increased by two times and one and half times as compared to in 2010, respectively. As a result, many researchers in automotive industry has showed a significant interest on industrial Ethernets, such as EtherCAT and TTEthernet. This paper addresses an analysis on transmission delay and fault recovery performance with an EtherCAT network which is being considered as an IVN. A mathematical model based on the analysis is verified through a set of experiments using an experimental network setup.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.3
• /
• pp.735-748
• /
• 2014

The fault-tolerance routing problem is one of the most important issues in the application of the Internet of Things, and has been attracting growing research interests. In order to maintain the communication paths from source sensors to the macronodes, we present a hybrid routing scheme and model, in which alternate paths are created once the previous routing is broken. Then, we propose an improved efficient and intelligent fault-tolerance algorithm (IEIFTA) to provide the fast routing recovery and reconstruct the network topology for path failure in the Internet of Things. In the IEIFTA, mutation direction of the particle is determined by multi-swarm evolution equation, and its diversity is improved by the immune mechanism, which can improve the ability of global search and improve the converging rate of the algorithm. The simulation results indicate that the IEIFTA-based fault-tolerance algorithm outperforms the EARQ algorithm and the SPSOA algorithm due to its ability of fast routing recovery mechanism and prolonging the lifetime of the Internet of Things.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.4
• /
• pp.1178-1191
• /
• 2014

The fault-tolerance routing problem is one of the most important issues in the application of the Internet of Things, and has been attracting growing research interests. In order to maintain the communication paths from source sensors to the macronodes, we present a hybrid routing scheme and model, in which alternate paths are created once the previous routing is broken. Then, we propose an improved efficient and intelligent fault-tolerance algorithm (IEIFTA) to provide the fast routing recovery and reconstruct the network topology for path failure in the Internet of Things. In the IEIFTA, mutation direction of the particle is determined by multi-swarm evolution equation, and its diversity is improved by the immune mechanism, which can improve the ability of global search and improve the converging rate of the algorithm. The simulation results indicate that the IEIFTA-based fault-tolerance algorithm outperforms the EARQ algorithm and the SPSOA algorithm due to its ability of fast routing recovery mechanism and prolonging the lifetime of the Internet of Things.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.14 no.11
• /
• pp.5885-5889
• /
• 2013

In general, the network survivability means that The user do not know the network faults and the recovery of those. For this, we use the dual(multi) routes between each two nodes. It is important that the each dual routes have efficient costs(or minimum). Even if one route is the minimum cost in case of no fault, another route of dual may be very large cost in case of fault case. Therefore we need the dual routes of each two nodes having the efficient(or minimum) costs. In this paper we find the network design method for the dual routes of each two node having the efficient costs. Although the design method is very simple and heuristic and it may be not useful for some networks, we will use it in various network environment.. Because this design method can be used very easy. A sample design will proof this usefulness.

• KEPCO Journal on Electric Power and Energy
• /
• v.6 no.3
• /
• pp.259-269
• /
• 2020

With the proposal-agreement procedure, RSTP can reduce the network recovery time to 400 ms or less in the case of 40 bridges. While the legacy RSTP reverts the previous agreement at the bridge with the alternate port role in the ring during the fault recovery, a new position based fast fault recovery procedure is proposed in this paper to guarantee a single proposal-agreement transaction which can provide more faster recovery. By knowing the relative position of the faulty link or bridge in hops, the bridge on the middle of the ring can complete the recovery procedure without revert. The performance of proposed procedure is numerically calculated and verified by simulation and the result shows that the recovery time can be reduced up to 100 ms, which is 1/4 times of the legacy RSTP.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.2
• /
• pp.371-388
• /
• 2014

Cognitive Radio (CR) has been recently proposed as a promising technology to remedy the problems of spectrum scarcity and spectrum underutilization by enabling unlicensed users to opportunistically utilize temporally unused licensed spectrums in a cautious manner. In Cognitive Radio Ad Hoc Networks (CRAHNs), data routing is one of the most challenging tasks since the channel availability and node mobility are unpredictable. Moreover, the network performance is severely degraded due to large numbers of path failures. In this paper, we propose the Fault-Tolerant Cognitive Ad-hoc Routing Protocol (FTCARP) to provide fast and efficient route recovery in presence of path failures during data delivery in CRAHNs. The protocol exploits the joint path and spectrum diversity to offer reliable communication and efficient spectrum usage over the networks. In the proposed protocol, a backup path is utilized in case a failure occurs over a primary transmission route. Different cause of a path failure will be handled by different route recovery mechanism. The protocol performance is compared with that of the Dual Diversity Cognitive Ad-hoc Routing Protocol (D2CARP). The simulation results obviously prove that FTCARP outperforms D2CARP in terms of throughput, packet loss, end-to-end delay and jitter in the high path-failure rate CRAHNs.