• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2001.10a
• /
• pp.65-69
• /
• 2001

Network Management become more and more important issue in the network environment in which many applications such as Mail, teleconferencing, WWW and database software are operated. It can be possible for The Bridge and flouter forwarding data to select next hop device which results in routing incorrect path from the viewpoint of network design. In this paper we address the problem of finding the detour routing path due to incorrect setting on routing devices. We propose the new algorithm for finding detour routing path based on hierarchical network structure analysis using information from SNMP MIB. To prove the correctness of the proposed algorithm we have done simulation with predefined data. Simulation results show that the algorithm finds detour path correctly

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.7
• /
• pp.1442-1448
• /
• 2003

Network Management become more and more important issue in the network environment in which many applications such as Mail, teleconferencing, WWW and database software are operated. It can be possible for The Bridge and Router forwarding data to select next hop device which results in routing incorrect path from the viewpoint of network design. In this paper we address the problem of finding the detour routing path due to incorrect setting on routing devices. We propose the new algorithm for finding detour muting path based on hierarchical network structure analysis using information from SNMP MIB. To prove the correctness of the unposed algorithm we have done simulation with predefined data. Simulation results show that the algorithm finds detour path correctly.

• International Journal of Highway Engineering
• /
• v.13 no.3
• /
• pp.167-176
• /
• 2011

This study's purpose is to analyse factors of determination about detouring for makinga standard model in regard of unfavorableness and uncertainty when unspecified individual recipients make a decision at the time of course detour. In order to achieve this, we surveyed SP investigation whether making a detour or not for drivers as a target who take a high way and National highway. Based on this result, we analysed detour determination factors of drivers, establishing a combination model of Decision Tree and Neural Network model. The result demonstrates the effected factors on drivers' detour determination are in ordering of the recognition of alternative routevs, reliable and frequency of using traffic information, frequency of transition routes and age. Moreover, from the outcome in comparison with an existing model and prediction through undistributed data, the rate of combination model 8.7% illustrates the most predictable way in contrast with logit model 12.8%, and Individual Model of Decision Tree 13.8% which are existed. This reveals that the analysis of drivers' detour determination factors is valid to apply. Hence, overall study considers as a practical foundation to make effective detour strategies for increasing the utility of route networking and dispersion in the volume of traffic from now on.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.26 no.3
• /
• pp.655-659
• /
• 2016

In this paper, we propose new detection and detour methods against packet drop attacks for availability in the Internet of Things (IoT) based on the IEEE 802.15.4e and RPL protocol standards that employ IPv6. We consider the rank value of RPL and the consecutive packet drops to improve the detection metrics, and also take into account the use of both sibling and child nodes on a RPL routing path to construct the detour method. Our simulation results show that the proposed detection method is faster than the previous result, and the detour method improves the detour success rate.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.12C
• /
• pp.1123-1130
• /
• 2009

The advances in networking technology and importance of multimedia communication require real time transaction. In many applications, high reliable real-time communications are required more frequently. In this paper, we propose a reliable communication in cube-based multi -computer using the safety vector. Each node in a cube-based n dimensional multi-computer is associated with a safety vector of n bits, which is an approximated measure of the number and distribution of faults in the neighborhood. We propose an algorithm that can establish detour paths using the safety vector. The established detour paths are disjoint with the primary real-time channel. Therefore, our algorithm is more efficient than earlier proposed algorithms.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.41 no.3
• /
• pp.120-128
• /
• 2018

OLED Display fabrication system is one of the most complicated discrete processing systems in the world. As the glass size grows from $550{\times}650mm$ to $1,500{\times}1,850mm$ in recent years, the efficiency of Automated Material Handling System (AMHS) has become very important and OLED glass manufacturers are trying to improve the overall efficiency of AMHS. Aiming to meet the demand for high efficiency of transportation, various kind of approaches have been applied for improving dispatching rules and facility layout, while simultaneously considering the system parameters such as glass cassettes due date, waiting time, and stocker buffer status. However, these works did not suggest the operational policy and conditions of distribution systems, especially for handling unnecessary material flows such as detour. Based on this motivation, in this paper, we proposed an efficient algorithm for improving detour transportation in OLED FAB. Specifically, we considered an OLED FAB simplifying OLED production environment in a Korean company, where four stockers are constructed for the delivery of Lot in a bay and linked to processing equipments. We developed a simulation model using Automod and performed a numerical experiment using real operational data to test the performance of three operation policies under considerations. We showed that a competitive policy for assigning alternative stocker in case of detour was superior to the current dedicated policy using a specified stocker and other considered policies.

• Journal of Institute of Control, Robotics and Systems
• /
• v.8 no.9
• /
• pp.795-802
• /
• 2002

We present a new dynamic routing scheme for multiple autonomous guided vehicles (AGVs) systems. There have been so many results concerned with scheduling and routing of multiple AGV systems; however, most of them are only applicable to systems with a small number of AGVs under a low degree of concurrency. With an increased number of AGVs in recent applications, these AGV systems are faced with another problem that has never been occurred in a system with a small number AGVs. This is the stop propagation problem. That is, if a leading AGV stops then all the following AGVs must stop to avoid any collision. In order to resolve this problem, we propose a nonstop preferential detour (NPD) algorithm which is a new dynamic routing scheme employing an election algorithm. For real time computation, we introduce two stage control scheme and propose a new path searching scheme, k-via shortest path scheme for an efficient dynamic routing algorithm. Finally, the proposed new dynamic routing scheme is illustrated by an example.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.1
• /
• pp.43-54
• /
• 1996

This paper presents new heuristic search algorithms for searching rectilinear r(L1), link metric, and combined shortest paths in the presence of orthogonal obstacles. The GMD(GuidedMinimum Detour) algorithm combines the best features of maze-running algorithms and line-search algorithms. The SGMD(Line-by-Line GuidedMinimum Detour)algorithm is a modiffication of the GMD algorithm that improves efficiency using line-by-line extensions. Our GMD and LGMD algorithms always find a rectilinear shortest path using the guided A search method without constructing a connection graph that contains a shortest path. The GMD and the LGMD algorithms can be implemented in O(m＋eloge＋NlogN) and O(eloge＋NlogN) time, respectively, and O(e＋N) space, where m is the total number of searched nodes, is the number of boundary sides of obstacles, and N is the total number of searched line segment. Based on the LGMD algorithm, we consider not only the problems of finding a link metric shortest path in terms of the number of bends, but also the combined L1 metric and Link Metric shortest path in terms of the length and the number of bands.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.11a
• /
• pp.60-66
• /
• 2006

This paper presents a new algorithm for the K shortest path problem in a directed network. After a shortest path is produced with Dijkstra algorithm, detouring paths through inward arcs to every vertex of the shortest path are generated. A length of a detouring path is the sum of both the length of the inward arc and the difference between the shortest distance from the origin to the head vertex and that to the tail vertex. K-1 shorter paths are selected among the detouring paths and put into the set of K paths. Then detouring paths through inward arcs to every vertex of the second shortest path are generated. If there is a shorter path than the current Kth path in the set, this path is placed in the set and the Kth path is removed from the set, and the paths in the set is rearranged in the ascending order of lengths. This procedure of generating the detouring paths and rearranging the set is repeated for the K-1 st path of the set. This algorithm can be applied to a problem of generating the detouring paths in the navigation system for ITS and also for vehicle routing problems.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38C no.1
• /
• pp.33-42
• /
• 2013

This paper presents a multihop range-free localization algorithm to estimate the physical location of a normal node with local connectivity information in anisotropic sensor networks. In the proposed algorithm, a normal node captures the detour degree of the shortest path connecting an anchor pair and itself by comparing the measured hop count and the expected hop count, and the node estimates the distances to the anchors based on the detour degree. The normal node repeats this procedure with all anchor combinations and pinpoints its location using the obtained distance estimates. The proposed algorithm requires fewer anchors and less communication overhead compared to existing range-free algorithms. We showed the superiority of the proposed algorithm over existing range-free algorithms through MATLA simulations.