• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.16 no.4
• /
• pp.64-75
• /
• 2017

Previous count models using fixed parameter can not consider the unobserved heterogeneity, as the standard error of the count value is underestimated, excessive t-values are derived thereby reducing the reliability of the model. Also, the study of unsignalized intersections are inadequate because of the difficulty of collecting data and statistical limits for accurate analytical processes compared to the signalized intersections. The purpose of this study is to analyze the factors affecting traffic accidents by constructing the count model using random parameters, and it aimed to distinguish between existing studies based on the rural unsignalized intersections. As a result of the analysis, 7 variables were presented as significant variables, and 2 variables(presence of crosswalk, speed limit) were presented as random parameter.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.11
• /
• pp.610-620
• /
• 2003

Various shadows are one of main factors that cause errors in vision based vehicle detection. In this paper, two simple methods, land mark based method and BS & Edge method, are proposed for vehicle detection and shadow rejection. In the experiments, the accuracy of vehicle detection is higher than 96%, during which the shadows arisen from roadside buildings grew considerably. Based on these two methods, vehicle counting, tracking, classification, and speed estimation are achieved so that real-time traffic parameters concerning traffic flow can be extracted to describe the load of each lane.

• Journal of Communications and Networks
• /
• v.12 no.6
• /
• pp.624-631
• /
• 2010

Effective traffic matrix estimation is the basis of efficient traffic engineering, and therefore, quality of service provision support in IP networks. In this study, traffic matrix estimation is investigated in IP networks and an Elman neural network-based traffic matrix inference (ENNTMI) method is proposed. In ENNTMI, the conventional Elman neural network is modified to capture the spatio-temporal correlations and the time-varying property, and certain side information is introduced to help estimate traffic matrix in a network accurately. The regular parameter is further introduced into the optimal equation. Thus, the highly ill-posed nature of traffic matrix estimation is overcome effectively and efficiently.

• Journal of Advanced Navigation Technology
• /
• v.15 no.6
• /
• pp.946-952
• /
• 2011

In term of inaccuracy of information and increasing channel occupancy time, the use of voice communication in Air Traffic Control has many problems. In order to improve it, ICAO proposed digital communication and ADS-B system that is more effective for voice communication in ATC. For improvement of effectiveness to add additional parameter to designated ADS-B In-Out data group, many studies being performed. In this paper, we analysis voice communication for reduce the communication traffic in ATC and simulate to add aiming altitude parameter for comparative effect analysis of communication traffic between pilot and controller. The result of the analysis were successfully validated that reduction of communication traffic in ADS-B environments.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.12
• /
• pp.3150-3158
• /
• 1997

In the ATM networks, there are two method in traffic control as schemes to improve the quality of service; one is the reactive control after congestion and the other is the preventive control before congestion. The preventive control include the CAC(Connection Admission Control), the UPC(Usage Parameter Control), the NPC(Network Parameter Control) and the PC(Priority co ntrol). In this paper, we propose an efficient UPC algorithm that has a complex structure using the Jumping window algorithm within the Leaky Bucket algorithm. The proposed algorithm controls peak hit rate by the Leaky Bucket algorithm, then it does the traffic control to evaluate by the Jumping Window whether violates mean bit rate or not. As we assume On/Off traffic source model, our simulation results showed cell loss rate less than the pre-existential Leaky Bucket algorithm method, and it could decrease the demanded Bucket size.

• International Journal of Internet, Broadcasting and Communication
• /
• v.8 no.4
• /
• pp.1-10
• /
• 2016

This paper considers WiMedia UWB network based wireless ship area network (WSAN) so as to support high-quality multimedia video data services and important shipboard control data. In this paper, prioritized contention access (PCA) and distributed reservation protocol (DRP) based on WiMedia UWB (ECMA-368) MAC protocols are combined and proposed to support mixed high-quality video traffic and shipboard control data traffic applying varying DRP and PCA data periods according to channel condition and link parameter ptimization. It is shown that the proposed dynmaic channel allocation of WiMedia UWB MAC protocol can provide reliable mixed video and shipboard control data traffic as well.

• International Journal of Highway Engineering
• /
• v.16 no.5
• /
• pp.133-142
• /
• 2014

PURPOSES : The objective was to develop the advanced method which could not explain each observation's specific characteristic in the present negative binomial method that results in under-estimation of the standard error(t-value inflation) and affects the confidence of whole derived results. METHODS : This study dealt with traffic accidents occurring within interchange segment on highway main line with RPNB(Random Parameter Negative Binomial) method that enables to take account of heterogeneity. RESULTS : As a result, AADT and lighting installation type on the road were revealed to have random parameter and in terms of other geometric variables, all were derived as fixed parameter(same effect on every segment). Also, marginal effects were adapted to analyze the relative effects on traffic accidents. CONCLUSIONS : This study proves that RPNB method which considers each observation's specific characteristics is better fitted to the accident data with geometrics. Thus, it is recommended that RPNB model or other methods which could consider the heterogeneity needs to be adapted in accident analysis.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10c
• /
• pp.210-212
• /
• 2000

In this paper, we propose an enhanced usage parameter control algorithm, which is one of the preventive traffic control method in ATM networks and implemented it with VLSI Proposed algorithm is based on the cell loss priority bit in the ATM cell header. This algorithm can solve the measurement phasing problem in cell conformance testing in ATM networks. Proposed algorithm can minimize the cell loss ratio of high priority cell(CLP=0) and resolve the burstiness of cells which may be introduced in traffic multiplexing and demultiplexing procedure. The result of performance evaluation shows that the performance of proposed algorithm is better than that of ITU-T usage parameter control algorithm.

• Proceedings of the IEEK Conference
• /
• 2000.11b
• /
• pp.196-199
• /
• 2000

In this paper has studied an enhanced usage parameter control algorithm, which is one of the preventive traffic control method in ATM networks. The proposed algorithm is based on the CLP(Cell Loss Priority) bit in the ATM cell header. This algorithm can eliminate the measurement phasing problem in cell conformance testing in ATM networks. The proposed algorithm can minimize the cell loss ratio of high priority cell(CLP = 0) and resolve the burstiness of eel]s which may be generated in the multiplexing and demultiplexing procedure. For the performance evaluation, we have simulated the proposed algorithm with discrete time input traffic model and the results show that the performance of the proposed algorithm is better than that of ITU-T usage parameter control algorithm.

• ETRI Journal
• /
• v.36 no.1
• /
• pp.69-79
• /
• 2014

The scheduling scheme in packet switching networks is one of the most critical features that can affect the performance of the network. Hence, many scheduling algorithms have been suggested and some indices, such as fairness and latency, have been proposed for the comparison of their performances. While the nature of Internet traffic is bursty, traditional scheduling algorithms try to smooth the traffic and serve the users based on this smoothed traffic. As a result, the fairness index mainly considers this smoothed traffic and the service rate as the main parameter to differentiate among different sessions or flows. This work uses burstiness as a differentiating factor to evaluate scheduling algorithms proposed in the literature. To achieve this goal, a new index that evaluates the performance of a scheduler with bursty traffic is introduced. Additionally, this paper introduces a new scheduler that not only uses arrival rates but also considers burstiness parameters in its scheduling algorithms.