• Journal of Information Processing Systems
• /
• v.8 no.4
• /
• pp.603-620
• /
• 2012

Proxy Mobile IPv6 (PMIPv6) is a network-based mobility support protocol and it does not require Mobile Nodes (MNs) to be involved in the mobility support signaling. In the case when multiple interfaces are active in an MN simultaneously, each data flow can be dynamically allocated to and redirected between different access networks to adapt to the dynamically changing network status and to balance the workload. Such a flow redistribution control is called "flow mobility". In the existing PMIPv6-based flow mobility support, although the MN's logical interface can solve the well-known problems of flow mobility in a heterogeneous network, some missing procedures, such as an MN-derived flow handover, make PMIPv6-based flow mobility incomplete. In this paper, an enhanced flow mobility support is proposed for actualizing the flow mobility support in PMIPv6. The proposed scheme is also based on the MN's logical interface, which hides the physical interfaces from the network layer and above. As new functional modules, the flow interface manager is placed at the MN's logical interface and the flow binding manager in the Local Mobility Anchor (LMA) is paired with the MN's flow interface manager. They manage the flow bindings, and select the proper access technology to send packets. In this paper, we provide the complete flow mobility procedures which begin with the following three different triggering cases: the MN's new connection/disconnection, the LMA's decision, and the MN's request. Simulation using the ns-3 network simulator is performed to verify the proposed procedures and we show the network throughput variation caused by the network offload using the proposed procedures.

• Korean Journal of Air-Conditioning and Refrigeration Engineering
• /
• v.18 no.8
• /
• pp.635-640
• /
• 2006

An optimizer has been applied for the optimal design of pipe diameters in the pipe flow network problems. Pipe network flow analysis, which is developed separately, is performed within the interface for the optimization algorithm. A pipe network is chosen for the test, and optimizer GenOpt is applied with Holder-Mead-O'Niell's simplex algorithm after solving the network flow problem by the Newton-Raphson method. As a result, optimally do-signed pipe diameters are successfully obtained which minimize the total design cost. Design cost of pipe flow network can be considered as the sum of pipe installation cost and pump operation cost. In this study, a practical and efficient solution method for the pipe network optimization is presented. Test system is solved for the demonstration of the present optimization technique.

• Journal of Information Processing Systems
• /
• v.17 no.3
• /
• pp.518-536
• /
• 2021

Studies and applications related to unidirectional flow are gaining attention from researchers across disciplines in the recent years. Flow can be viewed as a concept, where the material, fluid, people, air, and electricity are moving from one node to another over a transportation network, water network, or through electricity distribution systems. Unlike other networks such as computer networks, most of the flow networks are visible and have strong material existence and are responsible for the flow of materials with definite shape and volume. The flow of electricity is also unidirectional, and also share similar features as of flow of materials such as liquids and air. Generally, in a flow network, every node in the network participates and contributes to the efficiency of the network. In this survey paper, we would like to evaluate and analyze the depth and application of the acyclic nature of unidirectional flow in several domains such as industry, biology, medicine, and electricity. This survey also provides, how the unidirectional flow and flow networks play an important role in multiple disciplines. The study includes all the major developments in the past years describing the key attributes of unidirectional flow networks, including their applications, scope, and routing methods.

• Journal of The Korean Society of Agricultural Engineers
• /
• v.53 no.1
• /
• pp.1-7
• /
• 2011

The nature of a network implies movement among vertices, and can be regarded as flows. Based on the flow concept which network follows the hydraulic fluid principle, we develop a spatial network model using Bernoulli equation. Then we explore the organization of spatial network and growth by the velocity of network flows. Results show that flow velocity determines network connections or influence of a vertex up to a point, and that the overall network structure is the result of pull force (pressure) and flow velocity. We demonstrate how one vertex can monopolize connections within a network.

• International Journal of Computer Science & Network Security
• /
• v.23 no.10
• /
• pp.107-114
• /
• 2023

The study provides the identification of vulnerabilities in the security issues by Wireless Network. To achieve it the research focus on packet flow analysis, end to end data communication, and the security challenges (Cybercrime, insider threat, attackers, hactivist, malware and Ransomware). To solve this I have used the systematic literature review mechanisms and demonstrative tool namely Wireshark network analyzer. The practical demonstration identifies the packet flow, packet length time, data flow statistics, end- to- end packet flow, reached and lost packets in the network and input/output packet statics graphs. Then, I have developed the proposed model that used to secure the Wireless network solution and prevention vulnerabilities of the network security challenges. And applying the model that used to investigate the security challenges and vulnerabilities of cloud computing services is used to fulfill the network security goals in Wireless network. Finally the research provides the model that investigate the security challenges and vulnerabilities of cloud computing services in wireless networks

• Journal of applied mathematics & informatics
• /
• v.15 no.1_2
• /
• pp.53-75
• /
• 2004

First, we present two classes of sequential algorithms for minimum flow problem: decreasing path algorithms and preflow algorithms. Then we describe another approach of the minimum flow problem, that consists of applying any maximum flow algorithm in a modified network. In section 5 we present several parallel preflow algorithms that solve the minimum flow problem. Finally, we present an application of the minimum flow problem.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.8
• /
• pp.2096-2105
• /
• 1998

As there can be coincident bursts which may result in congetsion in a node of ATM network, reactive flow control schemes are required to guarantee user's Quality of Service. But, the high speed characteristics of ATM networks make it difficult to control source transmission rate in reacting to congestions in intermediate nodes. Therefore, flow control in Customer Premise Network may be more efficient than end-to-end flow control. In this paper, we propose a management model for flow ontrol in CPN and new Network Access Flow/Congestsion control scheme to utilize efficiently Virtual Path Connection.

• Journal of the military operations research society of Korea
• /
• v.25 no.2
• /
• pp.84-96
• /
• 1999

The purpose of this paper is to find the most vital arc in the minimum cost flow problem. The most vital arc is the arc whose removal results in the greatest influence in the costs or the amount of demands in a given minimum cost flow network. This problem can be well applied to the conflict situations such as military logistics network or communications network. In this situation, network user wants to know which arcs are the most vital to him so that he can reinforce these arcs against attack, while interdictor wants to destroy these arcs which increase the distance of the shortest path most through the network. When one of arcs is removed from the network of the minimum cost flow problem, two kinds of situations can be occurred ; breaking feasibility and increasing cost. In case of breaking feasibility, the rank of arcs are determined using the amount of modified flow in a related network which is made of modifying the optimal alternative of the minimum cost flow problem. The rank of arcs with the increased costs are determined by using a method which finds the directed cycle with the minimum cost in a related network.

• Tribology and Lubricants
• /
• v.22 no.1
• /
• pp.47-52
• /
• 2006

It is very important to control pressure and flow rate distribution on each component of engine lubrication network. Sometimes many kinds of orifice are used to control flow rate in the hydraulic lubrication field. In this study orifices were adopted on the lubrication network to control oil flow rate distribution. And unsteady transient flow network analysis was carried out to find out the effects of orifices on the engine oil circuit system.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.2
• /
• pp.733-750
• /
• 2019

Software Defined Networking (SDN) is a new network paradigm, allowing administrators to manage networks through central controllers by separating control plane from data plane. So, one or more controllers must locate outside switches. However, this separation may cause delay problems between controllers and switches. In this paper, we therefore propose a Priority-based Scheduling policy for OpenFlow (PSO) to reduce the delay of some significant traffic. Our PSO is based on packet prioritization mechanisms in both OpenFlow switches and controllers. In addition, we have prototyped and experimented on PSO using a network simulator (ns-3). From the experimental results, PSO has demonstrated low delay for targeted traffic in the out-of-brand control network. The targeted traffic can acquire forwarding rules with lower delay under network congestion in control links (with normalized load > 0.8), comparing to traditional OpenFlow. Furthermore, PSO is helpful in the in-band control network to prioritize OpenFlow messages over data packets.