• ETRI Journal
• /
• v.24 no.5
• /
• pp.360-372
• /
• 2002

In this paper, we propose the modified dynamic weighted round robin (MDWRR) cell scheduling algorithm, which guarantees the delay property of real-time traffic and also efficiently transmits non-real-time traffic. The proposed scheduling algorithm is a variation of the dynamic weighted round robin (DWRR) algorithm and guarantees the delay property of real-time traffic by adding a cell transmission procedure based on delay priority. It also uses a threshold to prevent the cell loss of non-real-time traffic that is due to the cell transmission procedure based on delay priority. Though the MDWRR scheduling algorithm may be more complex than the conventional DWRR scheme, considering delay priority minimizes cell delay and decreases the required size of the temporary buffer. The results of our performance study show that the proposed scheduling algorithm has better performance than the conventional DWRR scheme because of the delay guarantee of real-time traffic.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.3
• /
• pp.593-603
• /
• 1997

Connection admission decision in ATM networks requires decision made in real time using fast algorithm. It is difficult to construct a model of the multiplexed traffic and thus, approximation of the traffic load is necessary. In this paper, we propose a measurement-based dynamic CAC(Connection admission Control) in ATM(Asynchronous Transfer Mode) networks, which observes current traffic by the moving window and set the window size to the value which is computed from the measured cell loss amount. It is based on the measurements of the traffic load over an admission period that is load enough to reflect the current traffic behavior instead of analytic modeling. And, the dynamic reallocation of bandwidth for each class leads to effective bandwidth utilization. The performance of proposed method is analyzed through computer simulation. The performance of proposed method is analyzed by using SIMAN simulation package and FORTRAN language. As can be seen in the simulation result, cell loss performance and bandwidth utilization have been increased.

• Journal of Intelligence and Information Systems
• /
• v.6 no.1
• /
• pp.113-128
• /
• 2000

This paper presents a first year report of an ongoing multi-year project to develop a systolic parallel simulation system for dynamic traffic assignment. The fundamental approach to the simulation is systolic parallel processing based on autonomous agent modeling. Agents continuously act on their own initiatives and access to database to get the status of the simulation world. Various agents are defined in order to populate the simulation world. In particular existing modls and algorithm were incorporated in designing the behavior of relevant agents such as car-following model headway distribution Frank-Wolf algorithm and so on. Simulation is based on predetermined routes between centroids that are computed off-line by a conventional optimal path-finding algorithm. Iterating the cycles of optimization-then-simulation the proposed system will provide a realistic and valuable traffic assignment. Gangnum-Gu district in Seoul is selected for the target are for the modeling. It is expected that realtime traffic assignment services can be provided on the internet within 3 years.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.8
• /
• pp.2783-2804
• /
• 2021

In the network function virtualization environment, dynamic changes in network traffic will lead to the dynamic changes of service function chain resource demand, which entails timely dynamic adjustment of service function chain resource configuration. At present, most researches solve this problem through virtual network function migration and link rerouting, and there exist some problems such as long service interruption time, excessive network operation cost and high penalty. This paper proposes a dynamic adjustment method of service function chain resource configuration for the dynamic changes of network traffic. First, a dynamic adjustment request of service function chain is generated according to the prediction of network traffic. Second, a dynamic adjustment strategy of service function chain resource configuration is determined according to substrate network resources. Finally, the resource configuration of a service function chain is pre-adjusted according to the dynamic adjustment strategy. Virtual network functions combination and virtual machine reusing are fully considered in this process. The experimental results show that this method can reduce the influence of service function chain resource configuration dynamic adjustment on quality of service, reduce network operation cost and improve the revenue of service providers.

• Journal of Korean Society of Transportation
• /
• v.34 no.3
• /
• pp.278-290
• /
• 2016

Maximum traffic flow rate is an important performance measure of operational status in transport networks, and has been considered as a key parameter for transportation operation since a bottleneck in congestion decreases maximum traffic flow rate. Although previous studies for traffic flow analysis have been widely conducted, a detection method for changes in dynamic traffic flow has been still veiled. This paper explores the dynamic traffic flow detection that can be utilized for various traffic operational strategies. Turning point analysis (TPA), as a statistical method, is applied to detect the changes in traffic flow rate. In TPA, Bayesian approach is employed and vehicle arrival is assumed to follow Poisson distribution. To examine the performance of the TPA method, traffic flow data from Jayuro urban expressway were obtained and applied. We propose a novel methodology to detect turning points of dynamic traffic flow in real time using TPA. The results showed that the turning points identified in real-time detected the changes in traffic flow rate. We expect that the proposed methodology has wide application in traffic operation systems such as ramp-metering and variable lane control.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.25 no.2
• /
• pp.100-109
• /
• 2022

Large-scale urban concentration of population and vehicles due to economic growth in Korea has been causing serious urban transport problems. Although the collection of congestion pricing has been evaluated as the most effective transportation policy to alleviate traffic demand, its effectiveness is very limited as it was just executed around congested points or along main arterial roads. This study derived dynamic congestion zones with the average travel speed of 206 traffic analysis zones in Busan Metropolitan City to propose a dynamic congestion pricing collection system by employing Space-Time Cube Analysis and Emerging Hot Spot Analysis. As a result, dynamic hot spots were formed from 7h to 24h and particularly, traffic congestion was severely deteriorated from 18h to 20h around Seomyeon and Gwangbok-dong. Therefore, it is expected that the effect of dynamic congestion pricing will be maximized in managing traffic demand in the city center.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.1846-1850
• /
• 2005

This paper presents a constrained-based routing (CBR) algorithm called, Dynamic Possible Path per Link (D-PPL) routing algorithm, for MultiProtocol Label Switching (MPLS) networks. In MPLS on-line routing, future traffics are unknown and network resource is limited. Therefore many routing algorithms such as Minimum Hop Algorithm (MHA), Widest Shortest Path (WSP), Dynamic Link Weight (DLW), Minimum Interference Routing Algorithm (MIRA), Profiled-Based Routing (PBR), Possible Path per Link (PPL) and Residual bandwidth integrated - Possible Path per Link (R-PPL) are proposed in order to improve network throughput and reduce rejection probability. MIRA is the first algorithm that introduces interference level avoidance between source-destination node pairs by integrating topology information or address of source-destination node pairs into the routing calculation. From its results, MIRA improves lower rejection probability performance. Nevertheless, MIRA suffer from its high routing complexity which could be considered as NP-Complete problem. In PBR, complexity of on-line routing is reduced comparing to those of MIRA, because link weights are off-line calculated by statistical profile of history traffics. However, because of dynamic of traffic nature, PBR maybe unsuitable for MPLS on-line routing. Also, both PPL and R-PPL routing algorithm we formerly proposed, are algorithms that achieve reduction of interference level among source-destination node pairs, rejection probability and routing complexity. Again, those previously proposed algorithms do not take into account the dynamic nature of traffic load. In fact, future traffics are unknown, but, amount of previous traffic over link can be measured. Therefore, this is the motivation of our proposed algorithm, the D-PPL. The D-PPL algorithm is improved based on the R-PPL routing algorithm by integrating traffic-per-link parameters. The parameters are periodically updated and are dynamically changed depended on current incoming traffic. The D-PPL tries to reserve residual bandwidth to service future request by avoid routing through those high traffic-per-link parameters. We have developed extensive MATLAB simulator to evaluate performance of the D-PPL. From simulation results, the D-PPL improves performance of MPLS on-line routing in terms of rejection probability and total throughput.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.5
• /
• pp.988-995
• /
• 2009

One of the most popular services of Telematics is a shortest path finding from a starting point to a destination. In this paper, a dynamic shortest path finding system with forecasting result of traffic flow in the future was developed and various experiments to verify the performance of our system using real-time traffic information has been conducted. Traffic forecasting has been done by a prediction system using Bayesian network. It searched a dynamic shortest path, a static shortest path and an accumulated shortest path for the same starting point and destination and calculated their travel time to compare with one of its real shortest path. From the experiment, over 75%, the travel time of dynamic shortest paths is the closest to one of their real shortest paths than one of static shortest paths and accumulated shortest paths. Therefore, it is proved that finding a dynamic shortest path by applying traffic flows in the future for intermediated intersections can give more accurate traffic information and improve the quality of services of Telematics than finding a static shortest path applying by traffic flows of the starting time for intermediated intersections.

• Journal of the Korean Society of Industry Convergence
• /
• v.5 no.1
• /
• pp.53-64
• /
• 2002

The purpose of this study was to predict the future urban activities effectively and rationally. For the purpose, a simulation model, based on SD, was built by integrating economic activities, land use and traffic of a city and by dividing Daegu Metropolitan City into seven districts and one county. To identify the effect of the development of a new city in the Dalsung County area, the future population and traffic volume of the city were predicted, using the model. The results are summarized as follows. The future population according to the development of a new city in the Dalsung County area was predicted, and the effects before and after the development twenty years later were compared. The future population of the Dalsung County was found to have slightly increased, whereas that of the adjoining Dalsuh Metropolitan District was found to has slightly decreased. For the other districts, there were no changes of the future population. It was found, therefore, that the development of a new city would have no effect on other districts. Then, the traffic volume according to the development of a new city in the Dalsung County area was also predicted. It was found that in the initial stage the traffic volume would increase with the increase in population of Dalsung County. It was predicted that particularly,. the traffic volume for the purpose of business would greatly increase. The traffic volume of Dalsuh Metropolitan District showed a slight decrease, whereas for the other districts, there were no changes of the traffic volume.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.27 no.3
• /
• pp.579-589
• /
• 2017

The cloud environment is hypervisor-based, and many virtual machines are interconnected, which makes propagation of malicious code easier than other environments. Accordingly, this paper proposes a malicious traffic dynamic analysis system for secure cloud environment. The proposed system continuously monitors and analyzes malicious activity in an isolated virtual network environment by distinguishing malicious traffic that occurs in a cloud environment. In addition, the analyzed results are reflected in the distinguishment and analysis of malicious traffic that occurs in the future. The goal of this research is secure and efficient malicious traffic dynamic analysis by constructing the malicious traffic analysis environment in the cloud environment for detecting and responding to the new and variant malicious traffic generated in the cloud environment.