• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.50 no.2
• /
• pp.58-66
• /
• 2001

This paper presents an application of a newly designed Adaptive Genetic Algorithm (AGA) to solve the Optimal Feeder Routing (OFR) problem for distribution system planning. The main objective of the OFR problem usually is to minimize the total cost that is the sum of investment costs and system operation costs. We propose a properly designed AGA, in this paper, which can handle the horizon-year expansion planning problem of power distribution network in which the location of substation candidates, the location and amount of forecasted demands are given. In the proposed AGA, we applied adaptive operators using specially designed adaptive probabilities. we also a Simplified Load Flow (SLF) technique for radial networks to improve a searching efficiency of AGA. The proposed algorithm has been evaluated with the practical 32, 69 bus test system to show favorable performance. It is also shown that the proposed method for the OFR can also be used for the network reconfiguration problem in distribution system.

• Proceedings of the IEEK Conference
• /
• 2002.07c
• /
• pp.1851-1854
• /
• 2002

The Internet with conventional routing scheme cannot meet user demands driven from drastic growth in the Internet user and various service and traffic type. MPLS(Multi Protocol Label Switching) was introduced to the Internet fur solution to resolve this problem. MPLS is a paradigm to integrate higher layer’s software routing functions including layer-3 routing with layer-2 switching. But, the exponential growth of Internet traffic brings out of label space. One scalable solution to cope with this problem is to introduce flow merge technique, i. e. a group of flows is forwarded using the same label. Specially, IETF(Internet Engineering Task Force) recommends that ATM based MPLS system may include VC merge function, so it is scalable to increase of internet traffic. We implemented the MPLS LER system that includes the look-up and forwarding function in incoming path and VC merging function and limited traffic management function in outgoing path. This paper describes the implementation of the LER’s outgoing parts.

• ETRI Journal
• /
• v.36 no.6
• /
• pp.960-967
• /
• 2014

In this paper, an analytical framework is proposed for the optimization of network performance through joint congestion control, channel allocation, rate allocation, power control, scheduling, and routing with the consideration of fairness in multi-channel wireless multihop networks. More specifically, the framework models the network by a generalized network utility maximization (NUM) problem under an elastic link data rate and power constraints. Using the dual decomposition technique, the NUM problem is decomposed into four subproblems - flow control; next-hop routing; rate allocation and scheduling; power control; and channel allocation - and finally solved by a low-complexity distributed method. Simulation results show that the proposed distributed algorithm significantly improves the network throughput and energy efficiency compared with previous algorithms.

• Economic and Environmental Geology
• /
• v.54 no.4
• /
• pp.465-473
• /
• 2021

This numerical study aims at analyzing the effect of flow characteristics, caused by geometrical features such as intersecting angles, on solute mixing at fracture junctions. It showed that not only Pe, the ratio of advection to diffusion, but also the intersecting angles played an important role in solute mixing at the junction. For the intersection angles less than 90°, the fluid flowed to the outlet in the same direction as the injected flow direction, which increased the contact at the junction with the streamlines coming from the different inlets. On the other hand, for the intersecting angles greater than 90°, the fluid flowed out to the outlet opposite to the flow direction in the inlet, leading to minimizing the contact at the junction. Therefore, in the former case, solute mixing occurred even at high Pe, and in the latter case, solutes transport along the streamlines even at low Pe. For Pe < 1, the complete mixing model was known to occur, but for the intersecting angle greater than 150°, no complete solute mixing occurred. Overall, the transition from the complete mixing model to the streamline-routing model occurred for Pe = 0.1 - 100, but it highly depended on the intersecting angles. Specifically, the transition occurred at Pe = 0.1 - 10 for intersecting angles ≧ 150° and at Pe = 10 - 100 for intersecting angles ≦ 30°. For Pe > 100, the streamline-routing model was dominant regardless of intersecting angles. For Pe > 1,000, the complete streamline-routing model appeared only for the intersecting angles greater than 150°. For the intersecting angles less than 150°, the streamline-routing model dominated over the complete solute mixing, but solute mixing still occurred at the fracture junction.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.12
• /
• pp.30-45
• /
• 2014

Recently, multimedia application users who demand for ubiquitous computing environment are rapidly increasing, and wireless mesh network is receiving attention as a cost-effective key technology for next generation wireless networking. When multiple flows are transmitting data at the same time in the network, routing for path selection of each flow and link resource allocation for data transmission of each flow are one of the key factors that influence to the effectiveness of the network directly. In this paper, we consider problems for path discovery and resource allocation of links at the same time and we propose an algorithm based on mathematical modeling using a technique for cross-layer optimization design in STDMA-based wireless mesh networks that can enhance transfer performance for each flow. We show by performance analysis that the proposed algorithm can enhance the throughput performance by maximally utilizing given bandwidth resources when the number of flows increase in multi-hop wireless mesh networks.

• Journal of Korea Water Resources Association
• /
• v.35 no.6
• /
• pp.787-796
• /
• 2002

Hydraulic flood routing was performed for unsteady flow in a natural river using Preissmann scheme. A Log-Pearson Type-Ⅲ hydrograph is chosen arbitrarily as the upstream boundary condition and lateral inflow hydrographs for sensitivity analysis. For the application with an actual river system, upstream and lateral inflow hydrographs were estimated by the linear reservoir model and the Manning's equation was used as the downstream boundary condition. The unsteady flow model using the linear reservoir model as the inflow hydrographs was applied to Bochung stream basin and gives good results, and is approved to be used for the runoff prediction. As results of the sensitivity analysis, the proposed model may help to estimate the roughness coefficients when using the unsteady flow model with lateral inflow combined with the linear reservoir model.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.10
• /
• pp.2764-2771
• /
• 1999

ATM has recently received much attention because of its high capacity, its bandwidth scalability, and its ability to support multiservice traffic. However, ATM is connection oriented whereas the vast majority of modern data networking protocols are connectionless. The alternative to support current service on ATM will be a router with attached switching hardware that has the ability to cache routing decisions. In this paper, we described the router using a switch and simulated the performance. From the results of the simulation, the routing delay was decreased as the number of flow channels. Cell-delay was shortest at 30,000 cell-time when the keeping time of a flow channel was. The line utilization was rapidly decrease when a flow-setup time is 20 30 cell-time. The results of this simulation could be applied to predict the performance of the router using ATM switch.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.9
• /
• pp.901-905
• /
• 2008

In this paper, we propose a detection scheme for sinkhole attacks in wireless sensor networks. Sinkhole attack makes packets that flow network pass through attacker. So, Sinkhole attack can be extended to various kind of attacks. We analyze sinkhole attack methods in the networks that use LQI based routing. For the purpose of response to each attack method, we propose methods to detect attacks. Our scheme can work for those sensor networks which use LQI based dynamic routing protocol. And we show the detection of sinkhole attack can be achieved by using a few detector nodes.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.51 no.11
• /
• pp.568-576
• /
• 2002

This paper presents a new algorithm for the enhancement of voltage stability by optimal routing (OR) technique. A new voltage stability index (VSI) for optimal routing is also proposed by using theories of critical transmission path based on voltage phasor approach and equivalent impedance method. Furthermore, the proposed algorithm automatically detect the critical transmission path to critical transmission path to critical load which are faced to voltage collapse due to additional real or reactive loading. We also adopt a improved branch exchange (IBE) algorithm based on a tie branch power (TBP) flow equation to apply the OR technique. The proposed IBE algorithm for the VSI maximizing can effectively search the optimal topological structures of distribution feeders by changing the open/closed states of the sectionalizing and tie switches. The proposed algorithm has been evaluated with the practical IEEE 32, 69 bus test systems and KEPCO 148 bus test system to show favorable performance.

• ETRI Journal
• /
• v.27 no.6
• /
• pp.733-746
• /
• 2005

In the context of multi-protocol label switching (MPLS) traffic engineering, this paper proposes a scalable constraintbased shortest path first (CSPF) routing algorithm with multiple QoS metrics. This algorithm, called the multiple constraint-based shortest path first (M_CSPF) algorithm, provides an optimal route for setting up a label switched path (LSP) that meets bandwidth and end-to-end delay constraints. In order to maximize the LSP accommodation probability, we propose a link weight computation algorithm to assign the link weight while taking into account the future traffic load and link interference and adopting the concept of a critical link from the minimum interference routing algorithm. In addition, we propose a bounded order assignment algorithm (BOAA) that assigns the appropriate order to the node and link, taking into account the delay constraint and hop count. In particular, BOAA is designed to achieve fast LSP route computation by pruning any portion of the network topology that exceeds the end-to-end delay constraint in the process of traversing the network topology. To clarify the M_CSPF and the existing CSPF routing algorithms, this paper evaluates them from the perspectives of network resource utilization efficiency, end-to-end quality, LSP rejection probability, and LSP route computation performance under various network topologies and conditions.