• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.11 no.6
• /
• pp.95-102
• /
• 2012

In this paper, we propose a method that can construct efficiently a P2P overlay multicast network composed of many heterogeneous peers in communication bandwidth, processing power and a storage size by selecting a peer in a distributed fashion using an ant-colony theory that is one of the computational intelligence methods. The proposed method considers not only the capacity of a peer but also the number of children peers supported by the peer and the hop distance between a multicast source and the peer when selecting a parent peer of a newly joining node. Thus, an P2P multicast overlay network is constructed efficiently in that the distances between a multicast source and peers are maintained small. In addition, the proposed method works in a distributed fashion in that peers use their local information to find a parent node. Thus, compared to a centralized method where a centralized server maintains and controls the overlay construction process, the proposed method scales well. Through simulations, we show that, by making a few high capacity peers support a lot of low capacity peers, the proposed method can maintain the size of overlay network small even there are a few thousands of peers in the network.

• Proceedings of the Korean Association of Geographic Inforamtion Studies Conference
• /
• 1995.12a
• /
• pp.9-21
• /
• 1995

A planning support system enhances our ability to use water capacity expansion as an urban growth management strategy. This paper reports the development of capacity expansion modeling of water supply as part of the continuing development of such a planning support system (PEGASUS: Planning Environment for Generation and Analysis of Spatial Urban Systems) to incorporate water supply, This system is designed from the understanding that land use and development drive the demand for infrastructure and infrastructure can have a significant influence on the ways in which land is developed and used. Capacity expansion Problems of water supply can be solved in two ways: 1) optimal control theory, and 2) mixed integer nonlinear programming (MINLP). Each method has its strengths and weaknesses. In this study the MINLP approach is used because of its strength of determining expansion sizing and timing simultaneously. A dynamic network optimization model and a water-distribution network analysis model can address the dynamic interdependence between water planning and land use planning. While the water-distribution network analysis model evaluates the performance of generated networks over time, the dynamic optimization model chooses alternatives to meet expanding water needs. In addition, the user and capacity expansion modeling-to-generate-alternatives (MGA) can generate alternatives. A cost benefit analysis module using a normalization technique helps in choosing the most economical among those alternatives. GIS provide a tool for estimating the volume of demanded water and showing results of the capacity expansion model.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.16 no.5
• /
• pp.666-674
• /
• 2013

This paper studied about the design and implementation of tactical communication network simulator in order to obtain tactical communication network parameter, such as link capacity and routing plan, and a number of exceptional cases that may occur during actual deployment by conducting simulation of a large-scale tactical communication networks. This tactical communication network simulator provides equipment models and link models of commercial OPNET simulator for tactical communication network. In addition, 6 types of simulation scenario writings convenience functions and traffic generation models that may occur in situations of tactical communication network environment were implemented in order to enhance user friendliness. By taking advantages of SITL(System-In-The-Loop) function of OPNET, the tactical communication network simulator allows users to perform interoperability test between M&S models and actual equipment in operating simulation of tactical communication network, which is run on software. In order to confirm the functions and performance of the simulator, small-scale of tactical communication network was configured to make sure interoperability between SITL-based equipment and a large-scale tactical communication network was simulated and checked how to cope with traffic generated for each network node. As the results, we were able to confirm that the simulator is operated properly.

• Proceedings of the Korean Reliability Society Conference
• /
• 2001.06a
• /
• pp.455-462
• /
• 2001

We propose a new method to evaluate the network reliability which greatly reduces the intermediate steps toward calculations of maximum capacity flow by excluding unnecessary simple paths contained in the set of failure simple paths. By using signed simple paths and signed flow, we show that our method is more efficient than that of Lee and Park (2001a) in the number of generated composite paths and in the procedure for obtaining minimal success composite paths. Numerical examples are given to illustrate the use and the efficiency of the method.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2001.01a
• /
• pp.186-191
• /
• 2001

Mobile agent technologies are getting popular as means for accessing network resources efficiently. In order for mobile agents to be accepted as a reliable technology for applications such as e-commerce, a proper framework for mobile database should be established. In this paper, we first discuss weak points of current mobile computing systems that mostly result from the limitations of current mobile computing technology including frequent disconnection, limited battery capacity, low-bandwidth communication and reduced storage capacity. These weak points also have become the cause of transaction problem where mobile devices issue transactions. In order to eliminate this transaction problem in the mobile environment, we propose a mobile database framework, Proxyne, which is based on the proxy and SyncML.

• Korean Management Science Review
• /
• v.20 no.1
• /
• pp.65-76
• /
• 2003

The increased environmental concerns and the emphasis on recycling are gradually shifting the orientation of municipal solid waste (MSW) management. This paper is designed to evaluate regionalization programs for MSW management system. We developed a mixed intiger network programming (MIP) model to identify environment-friendly, cost-effective expansion plans for regionalization scenarios considered. The MIP model is a dynamic capacity expansion model based on the network flow model that depicts the MSW management cycle. In particular, our model is designed to determine the optimal form of regionalization using binary variables. We apply this model to assess the regionalization program of Seoul Metropolitan City, which includes three scenarios such as 1) districting, 2) regionalization with neighboring self-governing districts, and 3) g1obalization with all districts. We demonstrate how our model can be used to plan the MSW system. The results indicate that optimal regionalization with nearby self-governing districts can eliminate unnecessary landfills and expansions if jurisdictional obstacles are removed.

• IE interfaces
• /
• v.18 no.1
• /
• pp.63-72
• /
• 2005

In this paper, we present a distribution planning method for a supply chain. Like a typical distribution network of manufacturing firms, we have the form of arborescence. To consider more realistic situation, we investigated that an outside supplier has limited capacity. The customer demands are given in deterministic form in finite number of discrete time periods. In this environment, we attempt to minimize the total costs, which is the sum of inventory holding and backorder costs over the distribution network during the planning horizon. To make the best of the restricted capacity, we propose the look-ahead feature. For looking ahead, we convert this problem into a single machine scheduling problem and utilize tabu search approach to solve it. Numerous simulation tests have shown that the proposed algorithm performs quite well.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.16 no.2
• /
• pp.118-127
• /
• 1991

In this paper, criteria and algorithms for the optimal service rate in a closed queueing network have been established. The objective is to minimize total cost. It is shown that system throughput is increasing concave over the service rate of a node and cycle time is increasing convex over the set of service times with a single calss of cubsomers. This enables developing an algorithm using a steepest descent method when the cost function for service rate is convex. The efficiency of the algorithm rests on the fact that the steepest descent direction is readily obtained at each iteration from the MVA algorithm. Several numerical examples are presented. The major application of this research is optimization of facility capacity in a manufacturing system.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.49 no.1
• /
• pp.26-30
• /
• 2000

Switching of the transmission lines(T/L) is one of the methods for wuppressing the short circuit capacity. This paper presents the T/L switching operation by using the Hopfield neural network(HNN). The switching of T/L can make the line powers and the bus voltages deteriorated, as well as the fault current decreased. Such an insecure state should be avoided when the T/L is operated to be open. In this studies, the inequality constraints are formulated into the objective function to be incorporated with the HNN. Test results show that the convergence characteristics of HNN lead to the adequate solution of T/L switching.

• ETRI Journal
• /
• v.21 no.4
• /
• pp.9-22
• /
• 1999

This paper considers a problem of configuring both physical backbone and logical virtual path (VP) networks in a reconfigurable asynchronous transfer mode (ATM) network where links are subject to failures. The objective is to determine jointly the VP assignment, the capacity assignment of physical links and the bandwidth allocation of VPs, and the routing assignment of traffic demand at least cost. The network cost includes backbone link capacity expansion cost and penalty cost for not satisfying the maximum throughput of the traffic due to link failures or insufficient link capacities. The problem is formulated as a zero-one non-linear mixed integer programming problem, for which an effective solution procedure is developed by using a Lagrangean relaxation technique for finding a lower bound and a heuristic method exploited for improving the upper bound of any intermediate solution. The solution procedure is tested for its effectiveness with various numerical examples.