• Convergence Security Journal
• /
• v.8 no.3
• /
• pp.65-71
• /
• 2008

Network Flow has been playing important role in the modern industrial society. No matter what people or company run the network, both of them can't avoid circulating goods among the many branches. But in practical situations, not only the price rising in network increase the transportation costs, but the huge traffic flow volumes increase the transportation costs. Given to such a network environment, how to flow goods in the network is very important. In this paper, the MAX-Flow algorithm will be applied to network flow in order to maximize the network flow volumes. As far as the functions of network are correctly provided, the optimized network system always can make the flow process efficiently.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.10
• /
• pp.4902-4932
• /
• 2016

The popularity of network virtualization has recently regained considerable momentum because of the emergence of OpenFlow technology. It is essentially decouples a data plane from a control plane and promotes hardware programmability. Subsequently, OpenFlow facilitates the implementation of network virtualization. This study aims to provide an overview of different approaches to create a virtual network using OpenFlow technology. The paper also presents the OpenFlow components to compare conventional network architecture with OpenFlow network architecture, particularly in terms of the virtualization. A thematic OpenFlow network virtualization taxonomy is devised to categorize network virtualization approaches. Several testbeds that support OpenFlow network virtualization are discussed with case studies to show the capabilities of OpenFlow virtualization. Moreover, the advantages of popular OpenFlow controllers that are designed to enhance network virtualization is compared and analyzed. Finally, we present key research challenges that mainly focus on security, scalability, reliability, isolation, and monitoring in the OpenFlow virtual environment. Numerous potential directions to tackle the problems related to OpenFlow network virtualization are likewise discussed.

• Journal of Korean Society on Water Environment
• /
• v.29 no.1
• /
• pp.55-65
• /
• 2013

It is very difficult to apply stream flow data directly to the management of Total Maximum Daily Loads because there are some differences between the unit watershed and the stream flow monitoring network in their characteristics such as monitoring locations and its intervals. Flow duration curve can be developed by linking the daily flow data of stream monitoring network to 8 day interval flow data of the unit watershed. This study investigated the current operating conditions of the stream flow monitoring network and the flow relationships between the unit watershed and the stream flow monitoring network. Criteria such as missing and zero value data, and correlation coefficients were applied to select the stream flow reference sites. The reference sites were selected in 112 areas out of 142 unit watersheds in 4 river basins, where the stream flow observations were carried out in relatively normal operating conditions. These reference sites could be utilized in various ways such as flow variation analysis, flow duration curve development and so on for the management of Total Maximum Daily Loads.

• Korean Journal of Air-Conditioning and Refrigeration Engineering
• /
• v.22 no.8
• /
• pp.573-578
• /
• 2010

Topological matrix which reflects characteristics of network connectivity has been widely used in efficient solving for complicated flow network. Using topological matrix, one can easily define continuity at each node of flow network and make algorithm to automatically generate continuity equation of matrix form. In order to analyze flow network completely it is required to satisfy energy conservation in closed loops of flow network. Fundamental cycle retrieving algorithm based on graph theory automatically constructs energy conservation equation in closed loops. However, it is often accompanied by NP-complete problem. In addition, it always needs fundamental cycle retrieving procedure for every structural change of flow network. This paper proposes alternative mathematical method to analyze flow network without fundamental cycle retrieving algorithm. Consequently, the new mathematical method is expected to reduce solving time and prevent error occurrence by means of simplifying flow network analysis procedure.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.1
• /
• pp.65-72
• /
• 2016

Network virtualization is an emerging technology for solving the rigidity of the physical network infrastructure. The innovative technique virtualizes all resources in the network, including the network links and nodes, and provides a number of virtual networks on a single network infrastructure. In order to realize a virtual network, a thorough and complete monitoring of all resources in the network should be performed firstly. OpenFlow is an open source stack for network virtualization. However, it is impossible to apply OpenFlow to AP-based legacy wireless LAN environment because OpenFlow targets ethernet-based LAN environment. In this paper, we implement an adaptor-styled virtual switch for AP-based wireless LAN through customizing the Open vSwitch which is a virtual switch of OpenFlow. The evaluation test results show that the implemented OpenFlow stack operates successfully. The implemented OpenFlow stack can now be plugged immediately in existing AP-based wireless LAN environment and plays network resource monitoring. In the future, we can develop wireless LAN virtualization applications on the wireless OpenFlow stack.

• Proceedings of the Korean Reliability Society Conference
• /
• 2000.11a
• /
• pp.405-409
• /
• 2000

The flow network is considered to be in a functioning state if it can transmit a maximum flow which is greater than or equal to a specified amount of flow. In this paper we consider the measures of importance of a link in the flow network. We define the structural importance and reliability importance of link when the required amount of flow is given. Also, we present the performance importance of link in a flow network. The performance importance can be used to determine which links should be improved first in order to make the greatest improvement in performance of the network. Numerical examples are presented for illustrative purpose.

• Korean Management Science Review
• /
• v.21 no.1
• /
• pp.77-86
• /
• 2004

In this paper, we present a methodology for solving the multicommodity network flow problems using interior point methods. In our method, the minimum cost network flow problem extracted from the given multicommodity network flow problem is solved by primal-dual barrier method in which normal equations are solved partially using preconditioned conjugate gradient method. Based on the solution of the minimum cost network flow problem, a warm-start point is obtained from which Castro's specialized interior point method for multicommodity network flow problem starts. In the computational experiments, the effectiveness of our methodology is shown.

• Journal of the Korean Statistical Society
• /
• v.29 no.3
• /
• pp.297-306
• /
• 2000

An efficient method of constructing $textsc{k}$-minimal path sets to evaluate the reliability of a flow network is presented. The network is considered to be in a functioning state if it can transmit a maximum flow which is greater than or equal to a specified amount of flow, $textsc{k}$say, and a $textsc{k}$-minimal path set is a minimal set of branches that satisfies the given flow constraint. In this paper, under the assumption that minimal path sets of the network are known, we generate composite paths by adding only a minimal set of branches at each iteration to get $textsc{k}$-minimal path sets after possibly the fewest composition, and compute maximum flow of composite paths using only minimal path sets. Thereby we greatly reduce the possible occurrence of redundant composite paths throughout the process and efficiently compute the maximum flow of composite paths generated. Numerical examples illustrate the method.

• IE interfaces
• /
• v.10 no.3
• /
• pp.179-187
• /
• 1997

The efficiency of material flow systems in terms of optimal network flow and minimum cost flow has always been an important design and operational goal in material handling and distribution system. In this research, an attempt was made to develop a new algorithm and the model to solve a stochastic material flow network with bidirectional and uncertain flows. A stochastic material flow network with bidirectional flows can be considered from a finite set with unknown demand probabilities of each node. This problem can be formulated as a special case of a two-stage linear programming problem which can be converted into an equivalent linear program. To find the optimal solution of proposed stochastic material flow network, some terminologies and algorithms together with theories are developed based on the partitioning and subgradient techniques. A computer program applying the proposed method was developed and was applied to various problems.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2014.11a
• /
• pp.234-237
• /
• 2014

This paper provides insights into the sFlow monitoring system of OF@KREONET. OF@KREONET is software defined network (SDN) testbed adapted by KREONET (Korea Research Environment Open NETwork). OF@KREONET uses SDN-based network virtualization to slice the network among multiple concurrent experimenter. Flow Monitoring of OF@KREONET using sFlow. sFlow and OpenFlow can be used to provide an integrated flow monitoring system where OpenFlow controller can be used to define flows to be monitored by sFlow. OF@KREONET flow monitoring system supports monitoring of per slice FlowSpace. An Experimental can monitor his/her own FlowSpace while network administrator can monitor all spaces.