• Proceedings of the KIEE Conference
• /
• 1996.07b
• /
• pp.686-688
• /
• 1996

Network reconfiguration is performed by opening/closing two types of switches, tie and sectionalizing switches. A whole feeder, or part of a feeder, may be served from another feeder by closing a tie switch linking the two while an appropriate sectionalizing switch must be opened to maintain radial structures. In loss reduction, the problem is to identify tie and sectionalizing switches that should be closed and opened, respectively, to achieve a maximum loss reduction. In this paper, it is introduced to propose the reconfiguration plan for loss reduction by using the Civanlar's loss reduction formular.

• Journal of Industrial Technology
• /
• v.28 no.B
• /
• pp.15-25
• /
• 2008

This paper is to develop a network reorganization method to consider the constraints which are turn restrictions, U-turns, and P-turns in two way traffic network for Intelligent Transport System(ITS). Several kinds of traffic constraints can be represented in reorganized network using virtual nodes and arc values. The evolution program is also developed to search the multiple shortest paths in this reorganized traffic network within limited time.

• Proceedings of the KIEE Conference
• /
• 1999.07c
• /
• pp.1245-1247
• /
• 1999

This paper describes the optimal reconfiguration of distribution network. The optimal routing of distribution network should provide electricity to customers with quality, and this paper shows that optimal routing of distribution network can be obtained by Neural-Tabu algorithm while keeping constraints such as line power capacity, voltage drop and reliability indices. The Neural-Tabu algorithm is a Tabu algorithm combined with Neural network to find neighborhood solutions. This paper shows that not only the loss cost but also the reliability cost should be considered in distribution network reconfiguration to achieve the optimal routing.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.273-274
• /
• 2008

According to current RRC procedures, network does not know either how long it will take the RRC reconfiguration message (such as Physical Channel Reconfiguration (PCR)/Transport Channel Reconfiguration (TCR)/Radio Bearer Reconfiguration (RBR)) to be transmitted over the source cell or how long the UE will take to reconfigure on receiving the message, it has to assume the worst-case. Thus, it typically indicates a conservative activation time, leading to potentially large interruption for voice traffic, particularly if the source cell signal strength has degraded. This proposals allow the UE to receive the serving cell related information (carried today in PCR/RBR/TCR message) in an Active Set Update message.

• Journal of Navigation and Port Research
• /
• v.37 no.3
• /
• pp.321-327
• /
• 2013

As the market of express delivery services expands rapidly, delivery service companies are exposed to severe competition. As a result of the surplus of delivery companies, they are struggling with remaining competitive at a reasonable price with appropriate level of customer satisfaction. To cope with competition pressures, a strategic alliance is suggested as an effective solution to the challenges faced by small and medium enterprises (SMEs) in express delivery services. Therefore, this study suggests a combined optimization and simulation approach to the reconfiguration of an express delivery service network for strategic alliance with respect to strategy partnership of closing/keeping service centers among companies involved and adjustments of their cutoff times. An illustrative numerical example is presented to demonstrate the practicality and efficiency of the approach.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.5
• /
• pp.2181-2202
• /
• 2016

In Wireless Sensor Networks (WSNs) and even in the Internet of Things (IoT) ecosystem, the reconfiguration of sensor variables is an important problem when the role of a system (or application) program's sensor nodes needs to be adjusted in a particular situation. For example, the outdoor temperature in a volcanic zone, which is usually updated in a system every 10 s, should be updated every 1 s during an emergency situation. To solve this problem, this paper proposes a novel approach based on changing only a set of sensor variables in a part of a program, rather than modifying the entire program, in order to reduce both network congestion and the sensor nodes' battery consumption. To validate our approach, we demonstrate an implementation of a proof-of-concept prototype system and also present results of comparative studies showing the performance and effectiveness of our proposed method.

• Journal of Information Processing Systems
• /
• v.2 no.3 s.4
• /
• pp.183-188
• /
• 2006

A RMON agent system, which locates on a subnet, collects the network traffic information for management by retrieving and analyzing all of the packets on the subnet. The RMON agent system can miss some packets due to the high packet analyzing overhead when the number of packets on the subnet is huge. In this paper, we have developed a light-weight RMON agent system that can handle a large amount of packets without packet loss. Our RMON agent system has also been designed such that its functionality can be added dynamically when needed. To demonstrate the dynamic reconfiguration capability of our RMON agent system, a simple port scanning attack detection module is added to the RMON agent system. We have also evaluated the performance of our RMON agent system on a large network that has a huge traffic. The test result has shown our RMON agent system can analyze the network packets without packet loss.

• Journal of Electrical Engineering and Technology
• /
• v.13 no.2
• /
• pp.637-647
• /
• 2018

In this paper, we propose a method to search candidates of network reconfiguration to restore distribution system with distributed energy resources using a level-based tree search algorithm. First, we introduce a method of expressing distribution network with distributed energy resources for fault restoration, and to represent the distribution network into a simplified graph. Second, we explain the tree search algorithm, and introduce a method of performing the tree search on the basis of search levels, which we call a level-based tree search in this paper. Then, we propose a candidate search method for fault restoration, and explain it using an example. Finally, we verify the proposed method using computer simulations.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.5
• /
• pp.1333-1353
• /
• 2012

The robustness of a network is usually measured by error tolerance and attack vulnerability. Significant research effort has been devoted to determining the network design with optimal robustness. However, little attention has been paid to the problem of how to improve the robustness of existing networks. In this paper, we investigate how to optimize attack tolerance and communication efficiency of an existing network under the limited link addition. A survival fitness metric is defined to measure both the attack tolerance and the communication efficiency of the network. We show that network topology reconfiguration optimization with limited link addition (NTRLA) problem is NP-hard. Two approximate solution methods are developed. First, we present a degree-fitness parameter to guide degree-based link addition method. Second, a preferential configuration node-protecting cycle (PCNC) method is developed to do trade-off between network robustness and efficiency. The performance of PCNC method is demonstrated by numerical experiments.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.9
• /
• pp.37-48
• /
• 1996

In this paper, for the single s-a-E fault detected in a triangular cellular permutation network (TCPN), we propose a method which can tolerate a fault by reconfiguring the netowrk and analyze the possibilities of the reconfiguration. The network is set up through iterative decomposition of a permutation into the right or left coset. For the s-a-E fault of a cell which is to be transpositioned for an increasing order mapping, we cna reconfigure it merely by switching te decomposition scheme from right coset to left coset or vice versa. Also for a decreasing order mapping, we make a detour around the faulty cell. Reconfiguring with the redundant connectivity of a TCPN, we could realize form 17% to 90% of the permutation for the number of inputs from 4 to 40. REconfiguration of the network by exchanging the first input with the last input and the first output with the last output resulted in more than 99% realization of the permutation. Also with the exchange of all inputs and outputs with neighboring cells, we could have 100% realization of the permutation.