• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.5B
• /
• pp.348-356
• /
• 2012

The application traffic analysis is getting more and more challenging due to the huge amount of traffic from high-speed network link and variety of applications running on wired and wireless Internet devices. Multi-level combination of various analysis methods is desired to achieve high completeness and accuracy of analysis results for a real-time analysis system, while requires much of processing burden on the contrary. This paper proposes a novel architecture for a real-time traffic analysis system which improves the processing performance on multi-core CPU environment. The main contribution of the proposed architecture is an efficient parallel processing mechanism with multiple threads of various analysis methods. The feasibility of the proposed architecture was proved by implementing and deploying it on our campus network.

• 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.

• IEIE Transactions on Smart Processing and Computing
• /
• v.5 no.6
• /
• pp.430-439
• /
• 2016

Estimation and analysis of traffic jams plays a vital role in an intelligent transportation system and advances safety in the transportation system as well as mobility and optimization of environmental impact. For these reasons, many researchers currently mainly focus on the brilliant machine learning-based prediction approaches for traffic prediction systems. This paper primarily addresses the analysis and comparison of prediction accuracy between two machine learning algorithms: Naïve Bayes and K-Nearest Neighbor (K-NN). Based on the fact that optimized estimation accuracy of these methods mainly depends on a large amount of recounted data and that they require much time to compute the same function heuristically for each action, we propose an approach that applies multi-threading to these heuristic methods. It is obvious that the greater the amount of historical data, the more processing time is necessary. For a real-time system, operational response time is vital, and the proposed system also focuses on the time complexity cost as well as computational complexity. It is experimentally confirmed that K-NN does much better than Naïve Bayes, not only in prediction accuracy but also in processing time. Multi-threading-based K-NN could compute four times faster than classical K-NN, whereas multi-threading-based Naïve Bayes could process only twice as fast as classical Bayes.

• Aerospace Engineering and Technology
• /
• v.11 no.2
• /
• pp.171-181
• /
• 2012

As a sub-system of an air traffic control system, SDP(Surveillance Data Processor) provides with the system tracks of aircraft using the surveillance sensor data from various air traffic surveillance sensors, such as radars. Therefore, the high accuracy of tracking results is a crucial requirement for safe flights, and verification of the required system performance of SDP is an essential step in development. Moreover, the quantitative evaluation of target tracking accuracy is important for newly developed SDP, since there are several tracking methods for Multi-Sensor Multi-Target Tracking, such as MRT(Multi Radar Tracking), inevitably required as the main function of SDP. In this study, definition of required system performances, establishment of test environment, and test results for MRT performance evaluation of SDP, which is being developed in KARI(Korea Airspace Research Institute) are presented.

• Journal of Information Processing Systems
• /
• v.13 no.6
• /
• pp.1544-1553
• /
• 2017

The network coding mechanism has attracted much attention because of its advantage of enhanced network throughput which is a desirable characteristic especially in a multi-hop wireless network with limited link capacity such as the device-to-device (D2D) communication network of 5G. COPE proposes to use the XOR-based network coding in the two-hop wireless network topology. For multi-hop wireless networks, the Distributed Coding-Aware Routing (DCAR) mechanism was proposed, in which the coding conditions for two flows intersecting at an intermediate node are defined and the routing metric to improve the coding opportunity by preferring those routes with longer queues is designed. Because the routes with longer queues may increase the delay, DCAR is inefficient in delivering real-time multimedia traffic flows. In this paper, we propose a network coding-aware routing protocol for multi-hop wireless networks that enhances DCAR by considering traffic load distribution and link quality. From this, we can achieve higher network throughput and lower end-to-end delay at the same time for the proper delivery of time-sensitive data flow. The Qualnet-based simulation results show that our proposed scheme outperforms DCAR in terms of throughput and delay.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.7
• /
• pp.1781-1787
• /
• 1997

Future high speed networks are expected to use the Asynchronous Transfer Mode(ATM), which provides desired quality of service for the various traffic types(e.g., voice, video and data). Proper traffic control scheme helps ensure efficient and fair operation of networks. In this paper, we analyze various related traffic-control strategies and propose a new traffic control scheme and ATM control architecture with an integrated buffer management method and multi-thresholds in order to solve the problem of each class's cell loss ratio and cell delay in ATM networks. In addition, we evaluate the performance improvement of the proposed traffic control scheme through simulation. As shown in the result, the proposed traffic control scheme improves cell loss ratio in proportion to the buffer size.

• Journal of the Korean Society for Railway
• /
• v.4 no.2
• /
• pp.47-54
• /
• 2001

Railway companies have been faced with many changes in the railway environment. To cope immediately with the influence of environment and to improve productivity, an efficient train operation system and related core technologies must be introduced. The railway system is composed of large scale infrastructures and high-cost trains. Simulation method is one of core technologies and also efficient tool for planning and analyzing these kinds of complex system. In this research, we review basic simulation programming models and present a modeling for the elements of railway system such as rail-line infrastructure, train, time table and operational route. Additionally, some considerations on the development of multi-train traffic simulator for KyongBu-line are discussed.

• Journal of Communications and Networks
• /
• v.3 no.4
• /
• pp.383-395
• /
• 2001

Recent measurement and simulation studies have revealed that wide area network traffic displays complex statistical characteristics-possibly multifractal scaling-on fine timescales, in addition to the well-known properly of self-similar scaling on coarser timescales. In this paper we investigate the performance and network engineering significance of these fine timescale features using measured TCP anti MPEG2 video traces, queueing simulations and analytical arguments. We demonstrate that the fine timescale features can affect performance substantially at low and intermediate utilizations, while the longer timescale self-similarity is important at intermediate and high utilizations. We relate the fine timescale structure in the measured TCP traces to flow controls, and show that UDP traffic-which is not flow controlled-lacks such fine timescale structure. Likewise we relate the fine timescale structure in video MPEG2 traces to sub-frame encoding. We show that it is possibly to construct a relatively parsimonious multi-fractal cascade model of fine timescale features that matches the queueing performance of both the TCP and video traces. We outline an analytical method ta estimate performance for traffic that is self-similar on coarse timescales and multi-fractal on fine timescales, and show that the engineering problem of setting safe operating points for planning or admission controls can be significantly influenced by fine timescale fluctuations in network traffic. The work reported here can be used to model the relevant characteristics of wide area traffic across a full range of engineering timescales, and can be the basis of more accurate network performance analysis and engineering.

• Journal of Communications and Networks
• /
• v.6 no.3
• /
• pp.269-279
• /
• 2004

A new online multi-layer integrated routing (MLIR) scheme that combines IP (electrical) layer routing with WDM (optical) layer routing is investigated. It is a highly efficient and cost-effective routing scheme viable for the next generation integrated optical Internet. A new simplified weighted graph model for the integrated optical Internet consisted of optical routers with multi-granularity optical-electrical hybrid switching capability is firstly proposed. Then, based on the proposed graph model, we develop an online integrated routing scheme called differentiated weighted fair algorithm (DWFA) employing adaptive admission control (routing) strategies with the motivation of service/bandwidth differentiation, which can jointly solve multi-layer routing problem by simply applying the minimal weighted path computation algorithm. The major objective of DWFA is fourfold: 1) Quality of service (QoS) routing for traffic requests with various priorities; 2) blocking fairness for traffic requests with various bandwidth granularities; 3) adaptive routing according to the policy parameters from service provider; 4) lower computational complexity. Simulation results show that DWFA performs better than traditional overlay routing schemes such as optical-first-routing (OFR) and electrical-first-routing (EFR), in terms of traffic blocking ratio, traffic blocking fairness, average traffic logical hop counts, and global network resource utilization. It has been proved that the DWFA is a simple, comprehensive, and practical scheme of integrated routing in optical Internet for service providers.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.1
• /
• pp.103-118
• /
• 1996

With the advent of B-ISDN based on ATM technonlogy, ther are increasing needs for the interconnection of existing LAN/MAN's through ATM networks. ATM networks, therefore, must provide connectionless service. In this paper, the traffic distributio scheme using multi-path is proposed to support efficient connectionless service in ATM networks. Because the proposed scheme distributed the bursty traffic arrived in the interworking unit (IWU) and the connectionless server (CLS) from LAN-terminals, it alleviates the packet loss ratio caused by buffer overflow at IWU/CLS and is able to use nettowrk resources efficiently according to the network conditions and the amount of the traffic arrived at IWU/CLS. This paper presents the distribution algorithm and the IWU/CLS, CLS-CLS closed-loop rate control scheme.