• Title/Summary/Keyword: congestion pattern

Search Result 83, Processing Time 0.024 seconds

Extracting optimal moving patterns of edge devices for efficient resource placement in an FEC environment (FEC 환경에서 효율적 자원 배치를 위한 엣지 디바이스의 최적 이동패턴 추출)

  • Lee, YonSik;Nam, KwangWoo;Jang, MinSeok
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.26 no.1
    • /
    • pp.162-169
    • /
    • 2022
  • In a dynamically changing time-varying network environment, the optimal moving pattern of edge devices can be applied to distributing computing resources to edge cloud servers or deploying new edge servers in the FEC(Fog/Edge Computing) environment. In addition, this can be used to build an environment capable of efficient computation offloading to alleviate latency problems, which are disadvantages of cloud computing. This paper proposes an algorithm to extract the optimal moving pattern by analyzing the moving path of multiple edge devices requiring application services in an arbitrary spatio-temporal environment based on frequency. A comparative experiment with A* and Dijkstra algorithms shows that the proposed algorithm uses a relatively fast execution time and less memory, and extracts a more accurate optimal path. Furthermore, it was deduced from the comparison result with the A* algorithm that applying weights (preference, congestion, etc.) simultaneously with frequency can increase path extraction accuracy.

Analysis of Lane-Changing Distribution within Merging and Weaving Sections of Freeways (고속도로 합류 및 엇갈림구간에서의 차로변경 분포 분석에 관한 연구)

  • Kim, Yeong-Chun;Kim, Sang-Gu
    • Journal of Korean Society of Transportation
    • /
    • v.27 no.4
    • /
    • pp.115-126
    • /
    • 2009
  • The lane-change behavior usually consists of discretionary lane-change and mandatory lane-change types. For the first type, drivers change lanes selectively to maintain their own driving condition and the second type is the case that the drivers must change the current lane, which can occur in recurrent congestion sections like merging and weaving sections. The mandatory lane-change behavior have a great effect on the operation condition of freeway. In this paper, we first generate data such as traffic volumes, speeds, densities, and the number of lane-change within the merging and weaving sections using the data of individual vehicle collected from time-lapse aerial photography. And then, the data is divided into the stable and congested flow by analyzing the speed variation pattern of individual vehicles. In addition, the number of lane-changing from ramp to mainline within every 30-meter interval is investigated before and after traffic congestion at study sites and the distribution of lane-changing at each 30-meter point is analyzed to identify the variation of lane-changing ratio depending on the stable and congested flows. To recognize the effect of mainline flow influenced by ramp flow, this study also analyzes the characteristics of the lane-changing distributions within the lanes of mainline. The purpose of this paper is to present the basic theory to be used in developing a lane-changing model at the merging and weaving sections on freeways.

A Study on the Analysis of Container Physical Distribution System -Pusan Port Oriented- (물류시스템 분석에 관한 연구 - 부산항을 중심으로 -)

  • Park, C.H.;Lee, C.Y.
    • Journal of Korean Port Research
    • /
    • v.5 no.2
    • /
    • pp.19-37
    • /
    • 1991
  • This work aims to : establish a model of the container physical distribution system of Pusan port comprising 4 sub-systems of a navigational system, on-dock cargo handling/transfer/storage system, off-dock CY system and an in-land transport system : examine the system regarding the cargo handling capability of the port and analyse the cost of the physical distribution system. The overall findings are as follows : Firstly in the navigational system, average tonnage of the ships visiting the Busan container terminal was 33,055 GRT in 1990. The distribution of the arrival intervals of the ships' arriving at BCTOC was exponential distribution of $Y=e^{-x/5.52}$ with 95% confidence, whereas that of the ships service time was Erlangian distribution(K=4) with 95% confidence, Ships' arrival and service pattern at the terminal, therefore, was Poisson Input Erlangian Service, and ships' average waiting times was 28.55 hours In this case 8berths were required for the arriving ships to wait less than one hour. Secondly an annual container through put that can be handled by the 9cranes at the terminal was found to be 683,000 TEU in case ships waiting time is one hour and 806,000 TEU in case ships waiting is 2 hours in-port transfer capability was 913,000 TEU when berth occupancy rate(9) was 0.5. This means that there was heavy congestion in the port when considering the fact that a total amount of 1,300,000 TEU was handled in the terminal in 1990. Thirdly when the cost of port congestion was not considered optimum cargo volume to be handled by a ship at a time was 235.7 VAN. When the ships' waiting time was set at 1 hour, optimum annual cargo handling capacity at the terminal was calculated to be 386,070 VAN(609,990 TEU), whereas when the ships' waiting time was set at 2 hours, it was calculated to be 467,738 VAN(739,027 TEU). Fourthly, when the cost of port congestion was considered optimum cargo volume to be handled by a ship at a time was 314.5 VAN. When the ships' waiting time was set at I hour optimum annual cargo handling capacity at the terminal was calculated to be 388.416(613.697 TEU), whereas when the ships' waiting time was set 2 hours, it was calculated to be 462,381 VAN(730,562 TEU).

  • PDF

Prediction of Traffic Congestion in Seoul by Deep Neural Network (심층인공신경망(DNN)과 다각도 상황 정보 기반의 서울시 도로 링크별 교통 혼잡도 예측)

  • Kim, Dong Hyun;Hwang, Kee Yeon;Yoon, Young
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.18 no.4
    • /
    • pp.44-57
    • /
    • 2019
  • Various studies have been conducted to solve traffic congestions in many metropolitan cities through accurate traffic flow prediction. Most studies are based on the assumption that past traffic patterns repeat in the future. Models based on such an assumption fall short in case irregular traffic patterns abruptly occur. Instead, the approaches such as predicting traffic pattern through big data analytics and artificial intelligence have emerged. Specifically, deep learning algorithms such as RNN have been prevalent for tackling the problems of predicting temporal traffic flow as a time series. However, these algorithms do not perform well in terms of long-term prediction. In this paper, we take into account various external factors that may affect the traffic flows. We model the correlation between the multi-dimensional context information with temporal traffic speed pattern using deep neural networks. Our model trained with the traffic data from TOPIS system by Seoul, Korea can predict traffic speed on a specific date with the accuracy reaching nearly 90%. We expect that the accuracy can be improved further by taking into account additional factors such as accidents and constructions for the prediction.

Development of a Daily Pattern Clustering Algorithm using Historical Profiles (과거이력자료를 활용한 요일별 패턴분류 알고리즘 개발)

  • Cho, Jun-Han;Kim, Bo-Sung;Kim, Seong-Ho;Kang, Weon-Eui
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.10 no.4
    • /
    • pp.11-23
    • /
    • 2011
  • The objective of this paper is to develop a daily pattern clustering algorithm using historical traffic data that can reliably detect under various traffic flow conditions in urban streets. The developed algorithm in this paper is categorized into two major parts, that is to say a macroscopic and a microscopic points of view. First of all, a macroscopic analysis process deduces a daily peak/non-peak hour and emphasis analysis time zones based on the speed time-series. A microscopic analysis process clusters a daily pattern compared with a similarity between individuals or between individual and group. The name of the developed algorithm in microscopic analysis process is called "Two-step speed clustering (TSC) algorithm". TSC algorithm improves the accuracy of a daily pattern clustering based on the time-series speed variation data. The experiments of the algorithm have been conducted with point detector data, installed at a Ansan city, and verified through comparison with a clustering techniques using SPSS. Our efforts in this study are expected to contribute to developing pattern-based information processing, operations management of daily recurrent congestion, improvement of daily signal optimization based on TOD plans.

The System for Predicting the Traffic Flow with the Real-time Traffic Information (실시간 교통 정보를 이용한 교통 혼잡 예측 시스템)

  • Yu Young-Jung;Cho Mi-Gyung
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.10 no.7
    • /
    • pp.1312-1318
    • /
    • 2006
  • One of the common services of telematics is the car navigation that finds the shortest path from source to target. Until now, some routing algorithms of the car navigation do not consider the real-time traffic information and use the static shortest path algorithm. In this paper, we prosed the method to predict the traffic flow in the future. This prediction combines two methods. The former is an accumulated speed pattern, which means the analysis results for all past speeds of each road by classfying the same day and the same time inteval. The latter is the Kalman filter. We predicted the traffic flows of each segment by combining the two methods. By experiment, we showed our algorithm gave better precise predicition than only using accumulated speed pattern that is used commonly. The result can be applied to the car navigation to support a dynamic shortest path. In addition, it can give users the travel information to avoid the traffic congestion areas.

Mitigating TCP Incast Issue in Cloud Data Centres using Software-Defined Networking (SDN): A Survey

  • Shah, Zawar
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.11
    • /
    • pp.5179-5202
    • /
    • 2018
  • Transmission Control Protocol (TCP) is the most widely used protocol in the cloud data centers today. However, cloud data centers using TCP experience many issues as TCP was designed based on the assumption that it would primarily be used in Wide Area Networks (WANs). One of the major issues with TCP in the cloud data centers is the Incast issue. This issue arises because of the many-to-one communication pattern that commonly exists in the modern cloud data centers. In many-to-one communication pattern, multiple senders simultaneously send data to a single receiver. This causes packet loss at the switch buffer which results in TCP throughput collapse that leads to high Flow Completion Time (FCT). Recently, Software-Defined Networking (SDN) has been used by many researchers to mitigate the Incast issue. In this paper, a detailed survey of various SDN based solutions to the Incast issue is carried out. In this survey, various SDN based solutions are classified into four categories i.e. TCP Receive Window based solutions, Tuning TCP Parameters based solutions, Quick Recovery based solutions and Application Layer based solutions. All the solutions are critically evaluated in terms of their principles, advantages, and shortcomings. Another important feature of this survey is to compare various SDN based solutions with respect to different performance metrics e.g. maximum number of concurrent senders supported, calculation of delay at the controller etc. These performance metrics are important for deployment of any SDN based solution in modern cloud data centers. In addition, future research directions are also discussed in this survey that can be explored to design and develop better SDN based solutions to the Incast issue.

Extraction of Optimal Moving Patterns of Edge Devices Using Frequencies and Weights (빈발도와 가중치를 적용한 엣지 디바이스의 최적 이동패턴 추출)

  • Lee, YonSik;Jang, MinSeok
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.26 no.5
    • /
    • pp.786-792
    • /
    • 2022
  • In the cloud computing environment, there has been a lot of research into the Fog/Edge Computing (FEC) paradigm for securing user proximity of application services and computation offloading to alleviate service delay difficulties. The method of predicting dynamic location change patterns of edge devices (moving objects) requesting application services is critical in this FEC environment for efficient computing resource distribution and deployment. This paper proposes an optimal moving pattern extraction algorithm in which variable weights (distance, time, congestion) are applied to selected paths in addition to a support factor threshold for frequency patterns (moving objects) of edge devices. The proposed algorithm is compared to the OPE_freq [8] algorithm, which just applies frequency, as well as the A* and Dijkstra algorithms, and it can be shown that the execution time and number of nodes accessed are reduced, and a more accurate path is extracted through experiments.

An Adaptable Integrated Prediction System for Traffic Service of Telematics

  • Cho, Mi-Gyung;Yu, Young-Jung
    • Journal of information and communication convergence engineering
    • /
    • v.5 no.2
    • /
    • pp.171-176
    • /
    • 2007
  • To give a guarantee a consistently high level of quality and reliability of Telematics traffic service, traffic flow forecasting is very important issue. In this paper, we proposed an adaptable integrated prediction model to predict the traffic flow in the future. Our model combines two methods, short-term prediction model and long-term prediction model with different combining coefficients to reflect current traffic condition. Short-term model uses the Kalman filtering technique to predict the future traffic conditions. And long-term model processes accumulated speed patterns which means the analysis results for all past speeds of each road by classifying the same day and the same time interval. Combining two models makes it possible to predict future traffic flow with higher accuracy over a longer time range. Many experiments showed our algorithm gives a better precise prediction than only an accumulated speed pattern that is used commonly. The result can be applied to the car navigation to support a dynamic shortest path. In addition, it can give users the travel information to avoid the traffic congestion areas.

On Improving the Productivity of Busan Container Terminal (부산 컨테이너 부두의 효율적인 운영방안에 관하여)

  • 이병국;이철영
    • Journal of the Korean Institute of Navigation
    • /
    • v.11 no.1
    • /
    • pp.39-65
    • /
    • 1987
  • Since the middle of 1950's, containerization has been rapidly spread over the world in virtue of great merits providing to interensts, and the fundamental changes in port management and prot operations are resulted. As the container terminal is a complex system which is consisted of various subsystems, the treatment for improving the productivity is required in a comprehensive fashion, both in each of its parts and as an integrated system. This paper aims to make an intensive analysis of the Busan Container Terminal system, especially focusing on its subsystems such as ship operation system, storage system and transfer system. First of all, the intrinsic capacity of various subsystems is calculated and it is checked whether the current operation is being performed effectively through the formal analysis. Secondly, the suggestion is presented to improve the operation by considering the throughput that the port of Busan will have to accept in the near future. The results are as follows; 1) As the inefficiency is due to the imbalance between various subsystems at Busan terminal, transfer equipment level must be up to 31% for straddle carrier and 67% transfer crane above all. 2) The yard capacity must be increased by reducing the free dwell time of containers in order to accept the traffic volume smoothly in the near future. 3) The better way to reduce the port congestion is to change berthing rule from the FIFP to the Pre-allocated system by considering the ship arrival pattern.

  • PDF