• 한국정보전자통신기술학회논문지
• /
• 제9권6호
• /
• pp.559-565
• /
• 2016

본 교차로에 각 방향별 이동류의 상충해소를 위한 목적으로 도입된 교통신호제어는 차량증가에 따라 여러 교차로를 연계하여 정지와 지체시간을 최소화하는 간선도로 제어 목적으로 바뀌었고 이를 위해 교통신호운영 효율화를 위한 다양한 방법이 제시되고 있다. 본 연구는 도심 가로축 연동체계를 교통운영체계 선진화 방안에서 제시하고 있는 비보호좌회전확대로 운영되는 선직진 후좌회전 체계와 기존 실시간 대응제어 신호운영체계를 비교 분석하였으며, 비교 분석을 위해 4개시 5개 지역을 선정 평균 교차로 간격, 연동 가로축 거리 등을 구분하였다. 그 결과 교통운영체계 선진화 방안 신호운영체계의 교통처리용량은 실시간 대응제어 신호운영체계의 교통처리용량 보다 주기 160초 때 차로 당 286대, 140초 경우 308대, 120초 경우 264대가 증가하여 1차로 도로확장을 한 만큼의 효과가 있는 것으로 나타났다. 또한 가로축 연동에 대해서도 가로축 길이 2.0~3.0km, 2.0km미만에서 분석 주기(160초, 140초, 120초) 모두에서 연동밴드 폭이나 정지횟수에서 효과가 있는 것으로 나타났다.

• ETRI Journal
• /
• 제42권3호
• /
• pp.311-323
• /
• 2020

Encrypted traffic classification plays a vital role in cybersecurity as network traffic encryption becomes prevalent. First, we briefly introduce three traffic encryption mechanisms: IPsec, SSL/TLS, and SRTP. After evaluating the performances of support vector machine, random forest, naïve Bayes, and logistic regression for traffic classification, we propose the combined approach of entropy estimation and artificial neural networks. First, network traffic is classified as encrypted or plaintext with entropy estimation. Encrypted traffic is then further classified using neural networks. We propose using traffic packet's sizes, packet's inter-arrival time, and direction as the neural network's input. Our combined approach was evaluated with the dataset obtained from the Canadian Institute for Cybersecurity. Results show an improved precision (from 1 to 7 percentage points), and some application classification metrics improved nearly by 30 percentage points.

• Ocean Systems Engineering
• /
• 제12권3호
• /
• pp.267-284
• /
• 2022

A subsea pipeline designed across active shipping lane prones to failure against external interferences such as anchorage activities, hence risk assessment is essential. It requires quantifying the geometric probability derived from ship traffic distribution based on Automatic Identification System (AIS) data. The actual probability density function from historical vessel traffic data is ideal, as for rapid assessment, conceptual study, when the AIS data is scarce or when the local vessels traffic are not utilised with AIS. Recommended practices suggest the probability distribution is assumed as a single peak Gaussian. This study compares several fitted Gaussian distributions and Monte Carlo simulation based on actual ship traffic data in main ship direction in an active shipping lane across a subsea pipeline. The results shows that a Gaussian distribution with five peaks is required to represent the ship traffic data, providing an error of 0.23%, while a single peak Gaussian distribution and the Monte Carlo simulation with one hundred million realisation provide an error of 1.32% and 0.79% respectively. Thus, it can be concluded that the multi-peak Gaussian distribution can represent the actual ship traffic distribution in the main direction, but it is less representative for ship traffic distribution in other direction. The geometric probability is utilised in a quantitative risk assessment (QRA) for subsea pipeline against vessel anchor dropping and dragging and vessel sinking.

• Journal of Information Processing Systems
• /
• 제7권4호
• /
• pp.679-690
• /
• 2011

In this paper we consider a local area network (LAN) of dual mode service where one is a token bus and the other is a carrier sense multiple access with a collision detection (CSMA/CD) bus. The objective of the paper is to find the overall cell/packet dropping probability of a dual mode LAN for finite length queue M/G/1(m) traffic. Here, the offered traffic of the LAN is taken to be the equivalent carried traffic of a one-millisecond delay. The concept of a tabular solution for two-dimensional Poisson's traffic of circuit switching is adapted here to find the cell dropping probability of the dual mode packet service. Although the work is done for the traffic of similar bandwidth, it can be extended for the case of a dissimilar bandwidth of a circuit switched network.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제16권11호
• /
• pp.3584-3602
• /
• 2022

NFV realizes flexible and rapid software deployment and management of network functions in the cloud network, and provides network services in the form of chained virtual network functions (VNFs). However, using VNFs to provide quality guaranteed services is still a challenge because of the inherent difficulty in intelligently scaling VNFs to handle traffic fluctuations. Most existing works scale VNFs with fixed-capacity instances, that is they take instances of the same size and determine a suitable deployment location without considering the cloud network resource distribution. This paper proposes a traffic forecasted assisted proactive VNF scaling approach, and it adopts the instance capacity adaptive to the node resource. We first model the VNF scaling as integer quadratic programming and then propose a proactive adaptive VNF scaling (PAVS) approach. The approach employs an efficient traffic forecasting method based on LSTM to predict the upcoming traffic demands. With the obtained traffic demands, we design a resource-aware new VNF instance deployment algorithm to scale out under-provisioning VNFs and a redundant VNF instance management mechanism to scale in over-provisioning VNFs. Trace-driven simulation demonstrates that our proposed approach can respond to traffic fluctuation in advance and reduce the total cost significantly.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제5권2호
• /
• pp.313-329
• /
• 2011

To provide a seamless network to customers, Internet service providers must promptly detect and control abnormal traffic. One approach is to shorten the traffic information measurement cycle. However, performance degradation is inevitable if traffic measurement servers merely shorten the cycle and measure all traffic. This paper presents a software architecture that can measure traffic more frequently without degrading performance by estimating the level of abnormal traffic. The algorithm in the architecture estimates the values of the interface group objects in MIB by using the IP group objects thereby reducing the number of measurements and the size of measured data. We evaluated this architecture on part of Internet service provider's IP network. When the traffic was measured 5 times more than before, the CPU usage and TPS of the proposed scheme was 7% and 41% less than that of the original scheme while the false positive rate and false negative rate were 3.2% and 2.7% respectively.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2003년도 ISIS 2003
• /
• pp.664-667
• /
• 2003

We propose a frizzy traffic controller of Sugeno's fuzzy model so as to model the nonlinear characteristics of controlling the traffic light. It uses a degree of the traffic congestion of the preceding roads as an input so that it can cope with traffic congestion appropriately, which causes the loss of fuel and our discomfort. In order to construct fuzzy traffic controller of Sugeno's fuzzy model we first model the control process of the traffic light by using Mamdani's fuzzy model, which has the uniform membership functions of the same size and shape. Next we make Mamdani's fuzzy model with the non-uniform membership functions so that it can exactly reflect the knowledge of experts and operators. Lastly, we construct the fuzzy traffic controller of Sugeno's fuzzy model by learning from the input/output data, which is retrieved from Mamdani's fuzzy model with the non-uniform membership functions. We compared and analyzed the service level of the traffic light controllers by using the delay time. As a result of comparison, the fuzzy traffic controller of Sugeno's fuzzy model shows the best service level of them.

• 산업경영시스템학회지
• /
• 제45권2호
• /
• pp.20-29
• /
• 2022

This study intends to present a traffic node-based and link-based accident prediction models using XGBoost which is very excellent in performance among machine learning models, and to develop those models with sustainability and scalability. Also, we intend to present those models which predict the number of annual traffic accidents based on road types, weather conditions, and traffic information using XGBoost. To this end, data sets were constructed by collecting and preprocessing traffic accident information, road information, weather information, and traffic information. The SHAP method was used to identify the variables affecting the number of traffic accidents. The five main variables of the traffic node-based accident prediction model were snow cover, precipitation, the number of entering lanes and connected links, and slow speed. Otherwise, those of the traffic link-based accident prediction model were snow cover, precipitation, the number of lanes, road length, and slow speed. As the evaluation results of those models, the RMSE values of those models were each 0.2035 and 0.2107. In this study, only data from Sejong City were used to our models, but ours can be applied to all regions where traffic nodes and links are constructed. Therefore, our prediction models can be extended to a wider range.

• 시스템엔지니어링학술지
• /
• 제3권1호
• /
• pp.27-31
• /
• 2007

A complex system like ATM(Air Traffic Management) has safety problem emerging from complex interactions between systems. In complex systems, malfunctions of components are not the only causes of critical accidents. To resolve this problem many researchers have proposed new safety analysis models for complex systems. This research is a way of improving safety analysis model focusing on systems engineering design model for ATM.

• Journal of information and communication convergence engineering
• /
• 제5권3호
• /
• pp.239-244
• /
• 2007

In the telematics system, a reasonable path search time should be guaranteed from a great number of user's queries, even though the optimal path with minimized travel time might be continuously changed by the traffic flows. Thus, the path search method should consider traffic flows of the roads and the search time as well. However, the existing path search methods are not able to cope efficiently with the change of the traffic flows and to search rapidly paths simultaneously. This paper proposes a new path search method for fast computation. It also reflects the traffic flows efficiently. Especially, in order to simplify the computation of variable heuristic values, it employs a simplification method for estimating values of traffic-adaptable heuristics. The experiments are carried out with the $A^*$ algorithm and the proposed method in terms of the execution time, the number of node accesses and the accuracy. The results obtained from the experiments show that the method achieves very fast execution time and the reasonable accuracy as well.