• Title/Summary/Keyword: Optimal flow path

Search Result 92, Processing Time 0.027 seconds

Flow Assignment and Packet Scheduling for Multipath Routing

  • Leung, Ka-Cheong;Victor O. K. Li
    • Journal of Communications and Networks
    • /
    • v.5 no.3
    • /
    • pp.230-239
    • /
    • 2003
  • In this paper, we propose a framework to study how to route packets efficiently in multipath communication networks. Two traffic congestion control techniques, namely, flow assignment and packet scheduling, have been investigated. The flow assignment mechanism defines an optimal splitting of data traffic on multiple disjoint paths. The resequencing delay and the usage of the resequencing buffer can be reduced significantly by properly scheduling the sending order of all packets, say, according to their expected arrival times at the destination. To illustrate our model, and without loss of generality, Gaussian distributed end-to-end path delays are used. Our analytical results show that the techniques are very effective in reducing the average end-to-end path delay, the average packet resequencing delay, and the average resequencing buffer occupancy for various path configurations. These promising results can form a basis for designing future adaptive multipath protocols.

Optimization of real-time path finding for material handling of finishing work considering the logistics flow (물류량을 고려한 마감공사 자재운반의 실시간 경로탐색 최적화 연구)

  • Kim, Wansoub;Lee, Dongmin;Kim, Taehoon;Cho, Hunhee;Kang, Kyung-In
    • Proceedings of the Korean Institute of Building Construction Conference
    • /
    • 2015.11a
    • /
    • pp.170-171
    • /
    • 2015
  • Resource procurement and material handling are considered as a significant part of construction project especially in large or tall building construction site. There are multiple variables that must be considered in a construction site during finishing work such as movement of materials, equipments, and workers. Therefore, it is difficult for construction workers to find the material handling path solely by intuition. The aim of this study is to propose a real-time path finding model suitable for complicated logistics flow in the field. The model explores the optimal transport path of finishing material with its basis on optimization algorithm, and it determines the direction of the Smart Sign. The proposed model is expected to be utilized for planning of efficient finishing material handling.

  • PDF

A Framework for Determining Minimum Load Shedding for Restoring Solvability Using Outage Parameterization

  • Hwachang Song;Lee, Byongjun
    • KIEE International Transactions on Power Engineering
    • /
    • v.4A no.2
    • /
    • pp.73-78
    • /
    • 2004
  • This paper proposes a framework for determining the minimum load shedding for restoring solvability. The framework includes a continuation power flow (CPF) and an optimal power flow (OPF). The CPF parameterizes a specified outage from a set of multiple contingencies causing unsolvable cases, and it traces the path of solutions with respect to the parameter variation. At the nose point of the path, sensitivity analysis is performed in order to achieve the most effective control location for load shedding. Using the control location information, the OPF for locating the minimum load shedding is executed in order to restore power flow solvability. It is highlighted that the framework systematically determines control locations and the proper amount of load shedding. In a numerical simulation, an illustrative example of the proposed framework is shown by applying it to the New England 39 bus system.

A Design of Optimal Path Search Algorithm using Information of Orientation (방향성 정보를 이용한 최적 경로 탐색 알고리즘의 설계)

  • Kim Jin-Deog;Lee Hyun-Seop;Lee Sang-Wook
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.9 no.2
    • /
    • pp.454-461
    • /
    • 2005
  • Car navigation system which is killer application fuses map management techniques into CPS techniques. Even if the existing navigation systems are designed for the shortest path, they are not able to cope efficiently with the change of the traffic flow and the bottleneck point of road. Therefore, it is necessary to find out shortest path algorithm based on time instead of distance which takes traffic information into consideration. In this paper, we propose a optimal path search algorithm based on the traffic information. More precisely. we introduce the system architecture for finding out optimal paths, and the limitations of the existing shortest path search algorithm are also analyzed. And then, we propose a new algorithm for finding out optimal path to make good use of the orientation of the collected traffic information.

Fluid Dynamics Analysis and Experimental Trial to Improve the Switching Performance of Eco-friendly Gas Insulated Switch (친환경 가스개폐기 개폐성능 향상을 위한 유동해석 및 실험)

  • Yu, Lyun;Ahn, Kil-Young;Kim, Young-Geun;Cho, Hae-Yong
    • Journal of the Korean Society of Manufacturing Process Engineers
    • /
    • v.21 no.9
    • /
    • pp.42-49
    • /
    • 2022
  • An underground electric switch is a high-voltage switch used in distribution network systems for a reliable power supply. Many studies are being conducted to expand the switch to use an eco-friendly gas using dry air instead of SF6 gas to reduce greenhouse gas emissions. In this study, a flow analysis model was established to improve the performance of an eco-friendly gas switch. The results were compared and reviewed through experiments. For the optimal arc grid design applied to the switch, the flow characteristics based on the flow path configuration and the changes in arcing time for each configuration were compared. Flow analysis can predict the switch flow distribution, and a comparative review of the flow path configurations of various methods is possible.

Design of An Abstraction Technique of Road Network for Adapting Dynamic Traffic Information (동적 교통 정보를 적용하기 위한 도로망 추상화기법의 설계)

  • Kim, Ji-Soo;Lee, Ji-wan;Cho, Dae-Soo
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2009.05a
    • /
    • pp.199-202
    • /
    • 2009
  • The optimal path on real road network has been changed by traffic flow of roads frequently. Therefore a path finding system to find the optimal path on real network should consider traffic flow of roads that is changed on real time. The most of existing path finding methods do not consider traffic flow of roads and do not also perform efficiently if they use traffic information. In this paper, we propose an abstraction method of real road network based on the Terminal Based Navigation System (TBNS) with technique such as TPEG. TBNS can be able to provides quality of path better than before as using traffic information that is transferred by TPEG. The proposed method is to abstract real network as simple graph in order to use traffic information. It is composed boundary nodes based on real nodes, all boundary nodes that have the same of connection are merged together. The result of path finding on an abstract graph diminishes the search space.

  • PDF

OFPT: OpenFlow based Parallel Transport in Datacenters

  • Liu, Bo;XU, Bo;Hu, Chao;Hu, Hui;Chen, Ming
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.10
    • /
    • pp.4787-4807
    • /
    • 2016
  • Although the dense interconnection datacenter networks (DCNs) (e.g. FatTree) provide multiple paths and high bisection bandwidth for each server pair, the single-path TCP (SPT) and ECMP which are widely used currently neither achieve high bandwidth utilization nor have good load balancing. Due to only one available transmission path, SPT cannot make full use of all available bandwidth, while ECMP's random hashing results in many collisions. In this paper, we present OFPT, an OpenFlow based Parallel Transport framework, which integrates precise routing and scheduling for better load balancing and higher network throughput. By adopting OpenFlow based centralized control mechanism, OFPT computes the optimal path and bandwidth provision for each flow according to the global network view. To guarantee high throughput, OFPT dynamically schedules flows with Seamless Flow Migration Mechanism (SFMM), which can avoid packet loss in flow rerouting. Finally, we test OFPT on Mininet and implement it in a real testbed. The experimental results show that the average network throughput in OFPT is up to 97.5% of bisection bandwidth, which is higher than ECMP by 36%. Besides, OFPT decreases the average flow completion time (AFCT) and achieves better scalability.

A Study on the Solution Method of Maximum Origin-Destination Flow Path in an Acyclic Network using Branch and Bound Method (분지한계기법을 이용한 무환네트위크에서 최대물동량경로의 해법에 관한 연구)

  • 성기석;임준목
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.20 no.3
    • /
    • pp.31-41
    • /
    • 1995
  • The maximum Origin-Destination Flow Path Problem (MODFP) in an Acyclic Network has known as NP-hard. K. S. Sung has suggested on Optimal Algorithm for MODFP based on the Pseudo flo or arc and the K-th shortest path algorithm. When we try to solve MODFP problem by general Branch and Bound Method (BBM), the upper and lower bounds of subproblems are so weak that the BBM become very inefficient. Here we utilized the Pseudo flow of arc' for the tight bounds of subproblems so that it can produce an efficient BBM for MODFP problem.

  • PDF

Analysis of Flow Performance According to Actuator Geometry of Receptacle for Hydrogen Charging System with Filter Applied (필터가 장착된 수소충전시스템용 리셉터클의 작동부 형상에 따른 유동 성능 분석)

  • JU HWAN CHOI; GU HO KIM;JAE KWANG KIM;YONG KI KIM;HYUN KYU SUH
    • Transactions of the Korean hydrogen and new energy society
    • /
    • v.34 no.1
    • /
    • pp.17-25
    • /
    • 2023
  • The purpose of this study was to propose a design that shows optimal performance by changing the geometry of the internal flow path of the receptacle in order to prevent the decrease in flow rate and differential pressure performance due to the application of the receptacle in the hydrogen charging system. To achieve this, 3D computational fluid dynamics simulation was performed for the receptacle, according to the geometry of the flow path inside the receptacle. The pressure results at the inlet and outlet were measured the same as both of N and H2 in the experiment, and the flow rate of H2 was 3.75 times higher than that of N2. In addition, since the flow performance of the receptacle improved under conditions where the flow path was widened, it was confirmed that reducing the diameter of the poppet and the width of the guide are advantageous for improving performance.

Improvement of Continuation Power Flow System Applying the Optimal Load Shedding Algorithm (최적 부하절체 알고리듬을 적용한 연속조류계산의 향상)

  • Song, Hwa-Chang;Lee, Byong-Jun;Kwon, Sae-Hyuk
    • Proceedings of the KIEE Conference
    • /
    • 1998.07c
    • /
    • pp.899-901
    • /
    • 1998
  • Continuation power flow is a tool that can trace the path of the solution from the base stable solution. However, the base stable solution cannot be calculated when the initial system load is too large to operate at a stable operating point. This case is called as unsolvable case. This paper presents implementation of the optimal load shedding algorithm on continuation power flow. It performs steady-state analysis of power systems at unsolvable case that can occur in contingency analysis. Numerical simulation on 20-bus test system demonstrates that the continuation power flow applying the optimal load shedding algorithm is robust at solvable and unsolvable cases.

  • PDF