• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.8
• /
• pp.3946-3965
• /
• 2018

Network anomaly detection in Software Defined Networking, especially the detection of DDoS attack, has been given great attention in recent years. It is convenient to build the Traffic Matrix from a global view in SDN. However, the monitoring and management of high-volume feature-rich traffic in large networks brings significant challenges. In this paper, we propose a moving window Principal Components Analysis based anomaly detection and mitigation approach to map data onto a low-dimensional subspace and keep monitoring the network state in real-time. Once the anomaly is detected, the controller will install the defense flow table rules onto the corresponding data plane switches to mitigate the attack. Furthermore, we evaluate our approach with experiments. The Receiver Operating Characteristic curves show that our approach performs well in both detection probability and false alarm probability compared with the entropy-based approach. In addition, the mitigation effect is impressive that our approach can prevent most of the attacking traffic. At last, we evaluate the overhead of the system, including the detection delay and utilization of CPU, which is not excessive. Our anomaly detection approach is lightweight and effective.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.22 no.3
• /
• pp.58-64
• /
• 2021

As the number of registered vehicles increases, traffic congestion will worsen worse, which may act as an inhibitory factor for urban social and economic development. Through accurate traffic flow prediction, various AI techniques have been used to prevent traffic congestion. This paper uses the data from a VDS (Vehicle Detection System) as input variables. This study predicted traffic flow in five levels (free flow, somewhat delayed, delayed, somewhat congested, and congested), rather than predicting traffic flow in two levels (free flow and congested). The Catboost model, which is a machine-learning algorithm, was used in this study. This model predicts traffic flow in five levels and compares and analyzes the accuracy of the prediction with other algorithms. In addition, the preprocessed model that went through RandomizedSerachCv and One-Hot Encoding was compared with the naive one. As a result, the Catboost model without any hyper-parameter showed the highest accuracy of 93%. Overall, the Catboost model analyzes and predicts a large number of categorical traffic data better than any other machine learning and deep learning models, and the initial set parameters are optimized for Catboost.

• KIPS Transactions on Computer and Communication Systems
• /
• v.2 no.10
• /
• pp.421-426
• /
• 2013

As a greater amount of traffic have been generated on the Internet, it becomes more important to know the size of each flow. Many research studies have been conducted on the traffic measurement, and mostly they have focused on how to increase the measurement accuracy with a limited amount of memory. In this paper, we propose an explicit flow labeling technique that can be used to find out the names of the top flows and to increase the counting upper bound of the existing scheme. The labeling technique is applied to CSM (Counter Sharing Method), the most recent traffic measurement algorithm, and the performance is evaluated using the CAIDA dataset.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.4 no.1 s.6
• /
• pp.43-56
• /
• 2005

This research has examined a time series analysis(TSA) of an every hour traffic information such as occupancy, a traffic flow, and a speed, a statistical model of a surveyed data on the traffic fundamental diagram and an expand aspect of a traffic jam by many Parts of the traffic flow. Based on the detected data from traffic accidents on the Cheonan-Nonsan high way and events when the road volume decreases dramatically like traffic accidents it can be estimated from the change of occupancy right after accidents. When it comes to a traffic jam like events the changing gap of the occupancy and the mean speed is gentle, in addition to a quickness and an accuracy of a detection by the time series analyse of simple traffic index is weak. When it is a stable flow a relationship between the occupancy and a flow is a linear, which explain a very high reliability. In contrast, a platoon form presented by a wide deviation about an ideal speed of drivers is difficult to express by a statical model in a relationship between the speed and occupancy, In this case the speed drops shifty at 6$\~$8$\%$ occupancy. In case of an unstable flow, it is difficult to adopt a statistical model because the formation-clearance Process of a traffic jam is analyzed in each parts. Taken the formation-clearance process of a traffic jam by 2 parts division into consideration the flow having an accident is transferred to a stopped flow and the occupancy increases dramatically. When the flow recovers from a sloped flow to a free flow the occupancy which has increased dramatically decrease gradually and then traffic flow increases according as the result analyzed traffic flow by the multi regime as time series. When it is on the traffic jam the traffic flow transfers from an impeded free flow to a congested flow and then a jammed flow which is complicated more than on the accidents and the gap of traffic volume in each traffic conditions about a same occupancy is generated huge. This research presents a need of a multi-regime division when analyzing a traffic flow and for the future it needs a fixed quantity division and model about each traffic regimes.

• Journal of Korean Society of Transportation
• /
• v.26 no.4
• /
• pp.229-239
• /
• 2008

Most algorithms for detecting incidents have been developed under the premise that congestion must happen whenever an incident occurs. For that reason, the performance of these algorithms could not be guaranteed in cases where congestion did not happen due to traffic operations with low flows despite the occurrence of an incident. The objective of this paper is to develop an automatic incident detection algorithm using a new diagram that can reliably detect the incident under various conditions of traffic operations including a low volume state. Compared with the McMaster Algorithm, the proposed algorithm in this paper was evaluated with three different cases in which the incidents occur in traffic operations with a low volume state, a relatively high volume state, and a recurrent congestion state. It is shown that the new algorithm has a capability to identify the flow characteristics of incidents for all the three cases and is much better than McMaster algorithm in terms of detection rate and false alarm rate.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.11S
• /
• pp.3269-3277
• /
• 1999

To promote the inclusion of end-to-end congestion control in the design of future protocols using best-effort traffic, we propose a router mechanism, Extended FRED(ex-FRED). In this paper, we catagorize the TCP controlled traffics into robust and fragile traffic and discuss several unfairness conditions between them caused by the diverse applications. For example, fragile traffic from bursty application cannot use its fair share due to their slow adaptation. Ex-FRED modifies the FRED(Fair Random Early Drop), which can show wrong information due to the narrow view of actual buffer. Therefore, Ex-FRED uses per-flow accounting in larger virtual buffer to impose an each flow a loss rate that depends on the virtual buffer use of a flow. The simulation results show that Ex-FRED uses fair share and has good throughput.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.6A
• /
• pp.910-917
• /
• 2000

Because the random early detection(RED) algorithm deals all flows with the same best-effort traffic characteristic, it can not correctly control the output link bandwidth for the flows with different traffic characteristics. To remedy this problem, several per-flow algorithms have been proposed. In this paper, we propose a new per-flow type Fair Droptail algorithm which can fairly allocate bandwidth among flows over a shared output link. By evenly allocating buffers per flow, the Fair Droptail can restrict a flow not to use more bandwidth than others. In addition, it can be simply implemented even if it employs the per-flow state mechanism, because the Fair Droptail only keeps each information of flow in active state.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.11 no.2
• /
• pp.29-38
• /
• 2012

The data quality and measurements along consecutive detector stations can vary much even in the same traffic conditions due to variety in detector types, calibration and maintenance effort, field operation periods, minor geometric changes of roads and so on. These faulty situations often create 10% or more of inherent difference in important traffic measurements between two stations even under stable low flow condition. Low detection rates(DR) and high false alarm rates(FAR) therefore sets in among many popular Automatic Incident Detection Algorithms(AIDA). This research is two-folded and aims mainly to develop a new AIDA for uninterrupted flow. For this purpose, a technique which utilizes a Simple Arithmetic Operation(SAO) of traffic variables is introduced. This SAO technique is designed to address the inherent discrepancy of detector data observed successive stations, and to overcome the degradation of AIDA performance. It was found that this new algorithm improves DR as much as 95 percent and above. And mean time to detection(MTTD) is found to be 1 minutes or less. When it comes to FAR, this new approach compared to existing AIDAs reduces FAR up to 31.0 percent. And capability in persistency check of on-going incidents was found excellent as well.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.7
• /
• pp.2512-2531
• /
• 2014

We propose a new Distributed Denial of Service (DDoS) defense mechanism that protects http web servers from application-level DDoS attacks based on the two methodologies: whitelist-based admission control and busy period-based attack flow detection. The attack flow detection mechanism detects attach flows based on the symptom or stress at the server, since it is getting more difficult to identify bad flows only based on the incoming traffic patterns. The stress is measured by the time interval during which a given client makes the server busy, referred to as a client-induced server busy period (CSBP). We also need to protect the servers from a sudden surge of attack flows even before the malicious flows are identified by the attack flow detection mechanism. Thus, we use whitelist-based admission control mechanism additionally to control the load on the servers. We evaluate the performance of the proposed scheme via simulation and experiment. The simulation results show that our defense system can mitigate DDoS attacks effectively even under a large number of attack flows, on the order of thousands, and the experiment results show that our defense system deployed on a linux machine is sufficiently lightweight to handle packets arriving at a rate close to the link rate.

• Journal of Korean Society of Transportation
• /
• v.23 no.3 s.81
• /
• pp.137-147
• /
• 2005

This study is to define new road capacity concept, and to develop and propose an estimation method, through the analysis of individual vehicular behaviors in continuum flow. Developments in detection technology enable various and precise traffic data collection. The U.S. HCM (Highway Capacity Manual) method does not require such various and precise traffic data, and outputs only limited results. Alternative capacity concepts, which can be classified into a stochastic model and behavioral or deterministic model, are attempts for modeling some prominent traffic flow features, namely so-called a capacity drop and a traffic hysteresis, using such various and precise traffic data. Yet, no capacity concept up-to-date can describe both features. The analysis of individual vehicular behaviors, including speed-density plot per time lap, traffic flow-speed-density diagram per each sampling interval, time headway distribution, and free flow speed distribution, is performed for overcoming the limits of the previous capacity concepts. A stochastic methods are applied to determine time headway for estimating freeway capacity for traffic control.