• Journal of applied mathematics & informatics
• /
• v.9 no.1
• /
• pp.77-86
• /
• 2002

Ford and Fulkerson have shown that a stationary maximal dynamic flow can be obtained by solving a transhipment problem associated with the static network and thereby finding the maximal temporally repeated dynamic flow. This flow is known to be an optical dynamic flow. This paper presents an algorithm for second best temporal1y repeated flows. A numerical example is presented.

• Journal of applied mathematics & informatics
• /
• v.7 no.2
• /
• pp.379-389
• /
• 2000

FORD and FULKERSON have shown that a stationary maximal dynamic flow can be obtained by solving a transhipment problem associated with the static network and thereby finding the maximal temporally repeated dynamic flow. This flow is known to be an optimal dynamic flow. this paper presents the remark that temporally repeated flows may be not optimal for a minimal dynamic flow and an algorithm for such a flow. a numerical example is presented.

• Journal of Information Processing Systems
• /
• v.19 no.1
• /
• pp.130-138
• /
• 2023

The traffic flow in an urban area is affected by the date, weather, and regional traffic flow. The existing methods are weak to model the dynamic road network features, which results in inadequate long-term prediction performance. To solve the problems regarding insufficient capacity for dynamic modeling of road network structures and insufficient mining of dynamic spatio-temporal features. In this study, we propose a novel traffic flow prediction framework called shared spatio-temporal attention convolution optimization network (SSTACON). The shared spatio-temporal attention convolution layer shares a spatio-temporal attention structure, that is designed to extract dynamic spatio-temporal features from historical traffic conditions. Subsequently, the graph optimization module is used to model the dynamic road network structure. The experimental evaluation conducted on two datasets shows that the proposed method outperforms state-of-the-art methods at all time intervals.

• Journal of Korean Society of Transportation
• /
• v.20 no.1
• /
• pp.101-110
• /
• 2002

This study first explains general features of traffic assignment models and network loading methods, and investigates the relationship between them. Then it introduces a dynamic network loading method, which accounts far time variable additionally. First of all, this study suggests that it is important to consider some requirements for the dynamic network loading, such as causality, FIFO(First-In-First-Out) discipline, the flow propagation, and the flow conservation. The details of dynamic network loafing methods are explained in the form of algorithm, and numerical examples are shown in the test network by adopting deterministic queuing model for a link Performance function.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.8
• /
• pp.1683-1690
• /
• 2005

This study examines dynamic flow control method in UDP, analyzes packet loss which is frequently used element in measuring existing dynamic flow control and characteristics of round trip time, and proposes a new method of measurement, RSST. The algorithm that uses the proposed RSST enables accurate measurement of network status by considering both the currently measured network status and the past history of network status in controlling the transmission rate. For comparison study, a network status measurement software program that displays detailed information about volume of transmission generation of network status, and flow pattern of network was developed. The performance test shows that the proposed algorithm can better adjust to network condition in terms of low pack loss rate over existing algorithms.

• Journal of Korean Society of Transportation
• /
• v.22 no.3 s.74
• /
• pp.179-201
• /
• 2004

Online traffic flow modeling is attracting more attention due to intelligent transport systems and technologies. The flow-density relation plays an important role in traffic flow modeling and provides a basic way to illustrate traffic flow behavior under different traffic flow and traffic density conditions. Until now the research effort has focused mainly on the shape of the relation. The time series of the relation has not been identified clearly, even though the time series of the relation reflects the upstream/downstream traffic conditions and should be considered in the traffic flow modeling. In this paper the flow-density relation is analyzed dynamically and interpreted as a states diagram. The dynamic flow-density relation is quantified by applying fuzzy logic. The quantified dynamic flow-density relation builds the basis for online application of a macroscopic traffic flow model. The new approach to online modeling of traffic flow applying the dynamic flow-density relation alleviates parameter calibration problems stemming from the static flow-density relation.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.17 no.6
• /
• pp.1047-1054
• /
• 2022

With the advent of SDN, a next-generation network technology that separates the hardware and software areas of network equipment and defines the network using open source-based software, it solves the problems of complexity and scalability of the existing network system. It is now possible to configure a custom network according to the requirements. However, it has a structural disadvantage that a load on the network may occur due to a lot of control communication occurring between the controller and the switch, and many studies on network load distribution to effectively solve this have been preceded. In particular, in previous studies of load balancing techniques related to flow tables, many studies were conducted without consideration of flow entries, and as the number of flows increased, the packet processing speed decreased and the load was increased. To this end, we propose a new network load balancing technique that monitors flows in real time and applies dynamic flow management techniques to control the number of flows to an appropriate level while maintaining high packet processing speed.

• Proceedings of the KOR-KST Conference
• /
• 2002.02a
• /
• pp.97-139
• /
• 2002

The aim of the present study is to find a good quality user equilibrium assignments under time varying condition. For this purpose, this study introduces a dynamic network loading method that can maintain correct flow propagation as well as flow conservation, and it develops a novel solution algorithm that does not need evaluation of the objective function by modifying the Schittenhelm (1990)'s algorithm. This novel algorithm turns out to be efficient and convenient compared to the conventional Frank-Wolfe (1956) algorithm because the former finds solutions based on routes rather than links so that it can maintain correct flow propagation intrinsically in the time-varying network conditions. The application of dynamic user equilibrium (DUE) assignment model with this novel solution algorithm to test networks including medium-sized one shows that the present DUE assignment model gives rise to high quality discrete time solutions when we adopt the deterministic queuing model for a link performance function, and we associate flows and costs in a proper way.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.7 no.2
• /
• pp.5-29
• /
• 1982

This paper presents the network models for general dynamic conveyor systems which are characterized by transporting and storing materials between work stations over time. With an appropriate choice of time-slice the conveyor system can be represented exactly as a dynamic flow network which can be solved by an efficient pure network algorithm.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2021.06a
• /
• pp.147-147
• /
• 2021

A partition of water distribution network (WDN) into district metered areas (DMAs) brings the efficiency and efficacy for water network operation and management (O&M), especially in monitoring pressure and leakage. Traditionally, the DMA configurations (i.e., number, shape, and size of DMAs) are permanent and cannot be changed occasionally. This leads to changes in water quality and reduced network redundancy lowering network resilience against abnormal conditions such as water demand variability and mechanical failures. This study proposes a framework to automatically divide a WDN into dynamic DMA configurations, in which the DMA layouts can self-adapt in response to abnormal scenarios. To that aim, a complex graph theory is adopted to sectorize a WDN into multiscale DMA layouts. Then, different failure-based scenarios are investigated on the existing DMA layouts. Here, an optimization-based model is proposed to convert existing DMA layouts into dynamic layouts by considering existing valves and possibly placing new valves. The objective is to minimize the alteration of flow paths (i.e., flow direction and velocity in the pipes) while preserving the hydraulic performance of the network. The proposed method is tested on a real complex WDN for demonstration and validation of the approach.