• Management Science and Financial Engineering
• /
• v.12 no.2
• /
• pp.37-62
• /
• 2006

This paper considers the problem of designing logical tunnels in virtual private networks considering QoS guarantee which restricts the number of tunnel hops for each traffic routing. The previous researches focused on the design of logical tunnel itself and Steiner-tree based solution algorithms were proposed. However, we show that for some objective settings it is not sufficient and is necessary to consider both physical and logical connectivity at the same time. Thereupon, the concept of the layered network is applied to the logical tunnel design problem in virtual private networks. The layered network approach considers the design of logical tunnel as well as its physical routing and we propose a modified branch-and-price algorithm which is known to solve layered network design problems effectively. To show the performance of the proposed algorithm, computational experiments have been done and the results show that the proposed algorithm solves the given problem efficiently and effectively.

• Journal of Korean Institute of Industrial Engineers
• /
• v.37 no.4
• /
• pp.279-288
• /
• 2011

The past researches focused on the supply chain network that consists of factories, distribution centers and retailers for single product type. This research is required because the factory for single product type is advanced to reconfigurable type in order to produce various products, according to customers' various purchase forms and time. This research is also required because in the past researches, the material flows from factories to distribution centers and from distribution centers to retailers, but recently, there are material flows between distribution centers. The supply chain network in this research consists of reconfigurable manufacturing system, multi-layered distribution centers, and retailers. A simulator is developed to analyze the material flow on the supply chain network. The developed simulator is web-based designed by using Java Server Page and MS-SQL, so as to maximize the convenience for users.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.24 no.4
• /
• pp.111-122
• /
• 1999

In this paper, we consider a queueing network model. where the population constraint within each subnetwork is controlled by a semaphore queue. The total number of customers that may be present in the subnetwork can not exceed a given value. Each node has a constant service time and the arrival process to the queueing network is an arbitrary distribution. A major characteristics of this model is that the lower layer flow is halted by the state of higher layer. We present some properties that the inter-change of nodes does not make any difference to customer's waiting time in the queueing network under a certain condition. The queueing network can be transformed into a simplified queueing network. A dramatic simplification of the queueing network is shown. It is interesting to see how the simplification developed for sliding window flow control, can be applied to multi-layered queueing network.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.9 no.4
• /
• pp.103-112
• /
• 1989

A numerical model for Steady state groundwater flow has been established to understand the groundwater flow phenomena near a radioactive waste repository. The integrated finite difference method based on a network composed of nodes and members was applied to investigate groundwater flow in homogeneous, heterogeneous and layered media. Its numerical solution was in good agreement with analytic solution. Physical phenomena associated in the groundwater flow depending on both hydraulic characteristics and effects of fractured zone were also investigated. A method by which feasible groundwater flow paths can be identified was developed. This method used the composite network for the geologic media near a repository and the direction of computed groudwater velocity. Groundwater velocity and travel time were predicted for the possible pathway form a repository to a biosphere.

• The Journal of Korea Robotics Society
• /
• v.6 no.4
• /
• pp.353-364
• /
• 2011

In ubiquitous computing environments, users want to receive the robot services regardless of various physical status or devices such as time, place, various sensors, and high-performance servers. Thus, the ubiquitous service robots have to provide users with automated services according to situational information that they properly recognize. Beyond these problems, robot software has to establish a foundation to support the functions with the network infrastructure that are not able to be solved by a single independent resource. On the basis of a robot middleware that is capable of minimizing dependencies among hierarchy structures, the robot software also has to provide execution environment to control the flow of robot application services. In this paper, we propose a layered architecture to provide users with automated services through ubiquitous robots. The proposed architecture is based on CAWL (Context-Aware Workflow Language) and RSEL (Robot Services Execution Language). CAWL easily represents the flow of robot services from user application service levels, and RSEL is able to support the composition and reusability of robot services through abstraction of robot device services. In our experiments, we applied the proposed architecture to an example of "booth guide robot service".

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.4C
• /
• pp.343-355
• /
• 2003

Fair bandwidth allocations at routers protect adaptive flows from non-adaptive ones and may simplify end-to end congestion control. However, traditional fair bandwidth allocation mechanisms, like Weighted Fair Queueing and Flow Random Early Drop, maintain state, manage buffera and perform packet scheduling on a per-flow basis. These mechanisms are more complex and less scalable than simple FIFO queueing when they are used in the interi or of a high-speed network. Recently, to overcome the implementation complexity problem and address the scalability and robustness, several fair bandwidth allocation mechanisms without per-flow state in the interior routers are proposed. Core-Stateless Fair Queueing and Rainbow Fair Queuing are approximates fair queueing in the core-stateless networks. In this paper, we proposed simple Layered Fair Queueing (SLFQ), another core-stateless mechanism to approximate fair bandwidth allocation without per-flow state. SLFQ use simple layered scheme for packet labeling and has simpler packet dropping algorithm than other core-stateless fair bandwidth allocation mechanisms. We presente simulations and evaluated the performance of SLFQ in comparison to other schemes. We also discussed other are as to which SLFQ is applicable.

• Journal of Communications and Networks
• /
• v.14 no.5
• /
• pp.554-565
• /
• 2012

In this paper, we study a cross-layer and end-to-end optimization problem for the integrated wireless and wireline network that consists of one wireline core network and multiple wireless access networks. We consider joint end-to-end flow control/distribution at the transport and network layers and opportunistic scheduling at the data link and physical layers. We formulate a single stochastic optimization problem and solve it by using a dual approach and a stochastic sub-gradient algorithm. The developed algorithm can be implemented in a distributed way, vertically among communication layers and horizontally among all entities in the network, clearly showing what should be done at each layer and each entity and what parameters should be exchanged between layers and between entities. Numerical results show that our cross-layer and end-to-end optimization approach provides more efficient resource allocation than the conventional layered and separated optimization approach.

• Journal of Electrical Engineering and Technology
• /
• v.10 no.4
• /
• pp.1480-1491
• /
• 2015

In new deregulated electricity market, short-term price forecasting is key information for all market players. A better forecast of market-clearing price (MCP) helps market participants to strategically set up their bidding strategies for energy markets in the short-term. This paper presents a new prediction strategy to improve the need for more accurate short-term price forecasting tool at spot market using an artificial neural networks (ANNs). To build the forecasting ANN model, a three-layered feedforward neural network trained by the improved Levenberg-marquardt (LM) algorithm is used to forecast the locational marginal prices (LMPs). To accurately predict LMPs, actual power generation and load are considered as the input sets, and then the difference is used to predict price differences in the spot market. The proposed ANN model generalizes the relationship between the LMP in each area and the unconstrained MCP during the same period of time. The LMP calculation is iterated so that the capacity between the areas is maximized and the mechanism itself helps to relieve grid congestion. The addition of flow between the areas gives the LMPs a new equilibrium point, which is balanced when taking the transfer capacity into account, LMP forecasting is then possible. The proposed forecasting strategy is tested on the spot market of the Nord Pool. The validity, the efficiency, and effectiveness of the proposed approach are shown by comparing with time-series models

• Journal of KIISE:Software and Applications
• /
• v.36 no.11
• /
• pp.875-890
• /
• 2009

Metabolimics interprets an organism as a network of functional units and an organism is represented by a metabolic pathway i.e., well-displayed graph. So a software tool for drawing pathway is necessary to understand it comprehensively. These tools have a problem that edge-crossings exponentially increase as the number of nodes grows. To apply automatic graph layout techniques to the genome-scale metabolic flow, it is very important to reduce unnecessary edge-crossing on a metabolic pathway layout. In this paper, we design and implement 2.5D metabolic pathway layout modules. Metabolic pathways are represented hierarchically by making use of the '2-layered layout algorithm' in 3D. It enhances the readability and reduces unnecessary edge-crossings by using 3D layout modules instead of 2D layout algorithms.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.05a
• /
• pp.211-214
• /
• 2014

Nowadays, manufacturing field are facing new challenges, through digital information and global integration, toward sophisticated production. This paper presents the system configuration and issues of current manufacturing execution system(MES), and describes major issues and solving elements to establish a MES system for cloud services. Also, it proposes business intelligence(BI) systems for building a manufacturing information system to have the optimized production flow and to respond appropriately to consumer market.