• Journal of the Korean Society of Visualization
• /
• v.4 no.2
• /
• pp.3-5
• /
• 2006

Recently, the next-generation advanced flow visualization techniques such as holographic PIV, aynni.c PIV, echo-PIV, micro/nano-PIV, and X-ray PIV have been introduced. These advanced mea-surement techniques have a big potential as the core technology for analyzing outmost thermo-fluid flows in future. They would be indispensable in solving complicated thermo-fluid flow problems not only in industrial fields such as automotive, space, electronics, aero- and hydro-dynamics. steel, and information engineering, but also in the research fields of medical science, bio-medical engineering, environmental and energy technology etc. Especially, NT (Nano Technology) and BT (Bio Technology) strongly demand these advanced measurement techniques, because it is impossible for conventional measurement methods to observe the nano- and bio-fluidic flow phenomena. In this article, the basic principle of these high-tech flow visualization techniques and their practical applications which cannot be resolved by conventional methods, such as blood flows in a micro-tube, in vivo analysis of micro-circulation, and flow around a living body are introduced as a blue ocean strategy.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.3
• /
• pp.1-11
• /
• 1997

Since the radio spectrum is limited, future wireless system will have micro cellular architecture in order to provide multimedia traffic services on personal communicatons network. The small coverage area of micro cellular systems results in frequent hadnoffs and location updates. We focuse on network load and terminal power due to frequent location updates and propose a location tracking scheme using embedded-pager PCS terminals. The proposed scheme is expected to minimize theconsumption of PCS terminal powr and improve the receiving rate of callee because of the power saving mechanism and the embedded-pager PCS terminal. This paper proposes signaling flows among the network elements for the proposed location tracking scheme. The signaling flows are accomodated to not only the existed network architectures but alsothe ATM backbone network arcitecture. To verify the signaling flows, we used petri-Net model. The resutls show that the signaling flows are suitable to our proposed location tracking scheme.

• Journal of Communications and Networks
• /
• v.15 no.4
• /
• pp.430-438
• /
• 2013

This paper addresses the issue of throughput-delay of one-to-many wireless multi-hop flows based on random linear network coding (RLNC). Existing research results have been focusing on the single-hop model which is not suitable for wireless multi-hop networks. In addition, the conditions of related system model are too idealistic. To address these limitations, we herein investigate the performance of a wireless multi-hop network, focusing on the one-to-many flows. Firstly, a system model with multi-hop delay was constructed; secondly, the transmission schemes of system model were gradually improved in terms of practical conditions such as limited queue length and asynchronous forwarding way; thirdly, the mean delay and the mean throughput were quantified in terms of coding window size K and number of destination nodes N for the wireless multi-hop transmission. Our findings show a clear relationship between the multi-hop transmission performance and the network coding parameters. This study results will contribute significantly to the evaluation and the optimization of network coding method.

• Journal of KIISE:Information Networking
• /
• v.29 no.5
• /
• pp.524-532
• /
• 2002

With the recent rapid progress of Internet, the higher speed network is needed to support the exploration of ambient information from text-based to multimedia-based information. Also, demands for additional Layer 3 routing technique, such as Network Address Translator (NAT) and Firewall, are required to solve a limitation of a current Internet address space and to protect the interior network from the exterior network. However, current router-based algorithms do not provide mechanisms to solve the congestion and fairness problems, while supporting the multimedia services and satisfying the user requirements. In this paper, to solve these problems, a new active queue management, called MFRED (Multiple Fairness RED) algorithm, is proposed. This algorithm can efficiently reduce the congestion in a router or gateway based on the Layer 3 routing technique, such as NAT. This algorithm can improve the fairness among TCP-like flows and unresponsive flows. It also works well in fairly protecting congestion-sensitive flows, i.e. fragile TCP, from congestion-insensitive or congestion-causing flows, i.e. robust TCP.

• Management Science and Financial Engineering
• /
• v.15 no.1
• /
• pp.51-69
• /
• 2009

A network model and a Genetic Algorithm (GA) is proposed to solve the simultaneous estimation of the trip distribution and traffic assignment from traffic counts in the congested networks in a logit-based Stochastic User Equilibrium (SUE). The model is formulated as a problem of minimizing a non-linear objective function with the linear constraints. In the model, the flow-conservation constraints are utilized to restrict the solution space and to force the link flows become consistent to the traffic counts. The objective of the model is to minimize the discrepancies between two sets of link flows. One is the set of link flows satisfying the constraints of flow-conservation, trip production from origin, trip attraction to destination and traffic counts at observed links. The other is the set of link flows those are estimated through the trip distribution and traffic assignment using the path flow estimator in the logit-based SUE. In the proposed GA, a chromosome is defined as a real vector representing a set of Origin-Destination Matrix (ODM), link flows and route-choice dispersion coefficient. Each chromosome is evaluated by the corresponding discrepancies. The population of the chromosome is evolved by the concurrent simplex crossover and random mutation. To maintain the feasibility of solutions, a bounded vector shipment technique is used during the crossover and mutation.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.8
• /
• pp.69-75
• /
• 2015

Nowadays, software plays various roles in applications in wide areas. However, the security problems caused by software vulnerabilities increase. So, it is necessary to improve software security and safety in software execution. In this paper, we propose an approach to improve the safety of software execution by managing information used in software through static data access analysis. The approach can detect the exposures of secure data in software execution by analyzing information property and flows through static data access analysis. In this paper, we implemented and experimented the proposed approach with a base language, and verify that the proposed approach can effectively detect the exposures of secure information. The proposed approach can be applied in several areas for improving software safety by analysing vulnerabilities from information flows in software execution.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.3
• /
• pp.316-323
• /
• 2010

We propose a method to find flows of transit users in the subway transportation network of the metropolitan Seoul and analyze the passenger flows on some central links of the network. The transportation network consists of vertices for subway stops, edges for links between two adjacent subway stops, and flows on the edges' Each subway transit user makes a passenger flow along edges of the shortest path from the origin stop to the destination stop in his trip. In this paper, we have developed a new algorithm to find the passenger flow of each link in the subway network from a large trip-transaction database of subway transit users. We have applied the algorithm to find the passenger flows from one day database of about 5 million transactions by the subway transit users. As results of the experiments, the travel behavior on 4 central subway links is analyzed in passenger flows and top 10 flows among all subway links are explained in a table.

• Journal of KIISE:Information Networking
• /
• v.30 no.3
• /
• pp.437-447
• /
• 2003

In order to reduce the increasing packet loss rates caused by an exponential increase in network traffic, the IETF(Internet Engineering Task Force) is considering the deployment of active queue management techniques such as RED(Random Early Detection) algorithm. However, RED algorithm simple but does not protect traffic from high-bandwidth flows, which include not only flows that fail to use end-to-end congestion control such as UDP flow, but also short round-trip time TCP flows. In this paper, in order to solve this problem, we propose a simple fairness queue management scheme, called AFQM(Approximate Fair Queue Management) algorithm, that discriminate against the flows which submit more packets/sec than is allowed by their fair share. By doing this, the scheme aims to approximate the fair queueing policy Since it is a small overhead and easy to implement, AFQM algorithm controls unresponsive or misbehaving flows with a minimum overhead.

• International Journal of Quality Innovation
• /
• v.6 no.1
• /
• pp.74-97
• /
• 2005

IDEF0 is the IEEE standard for functional enterprise modeling and has been used for business process modeling or process mapping in US and Europe. But it does not reflect the potential benefits of modeling and simulation of the dynamic aspects of an enterprise or a system. On the other hand, simulation tools concentrate mostly on the simulation of material flows and are difficult to include information flows and control flows. Additionally, the simulation models that include elements such as queues, event generators and process nodes is a visual interactive representation for the model builder, but is inconvenient for the domain expert. In an attempt to fill that void, we provide an integration of business process and simulation models in this paper. An enhancement of the IDEF0, called parameterized IDEF0, is proposed and its conversion mechanism to network simulation model is developed. Using this methodology, business process models for alternative systems can be evaluated and compared through simulation on time, cost, and quality metrics. As an application of the proposed methodology, economic evaluation of EDI (Electronic Data Interchange) for time-based BPR (Business Process Redesign) is demonstrated. In addition to BPR, the developed methodology may be further integrated with ABC (Activity Based Costing), TQM (Total Quality Management), and economic evaluation of information systems.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.12
• /
• pp.3923-3932
• /
• 2000

In mobile network, wireless links may be overloaded due to a high concentratioJl of mobile hosts in a given cell. As a result, the required QOS(Quality of Service) cannot be provided to all flows in that cell. So, there exists adaptive applications which can operate with various bandwidth levels. When a wireless link is overloaded, it can adapt by reducing the bandwidths of flows, is referred to as rate adaptation. In this paper, we analyze the performance of existing rate adaptation methods by simulations. The result of simulation experiments shows that average-fair adaptation scheme has very low network overhead but high bandwidth variance of flows, which causes the worse quality of service. We propose a rate adaptation method refined by combining fair adaptation and average-fair adaptation, and shows the refined method can provide lower bandwidth variance of flows by simulations.