• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.9A
• /
• pp.2184-2196
• /
• 1998

Admission control is one of the most important congestion control mechanism to be executed at the call set up phase by regulating traffic into a network in a preventive way. An efficient QOS evaluation or bandwidth estimation method is required for call admission to be decided in real time. In this paper, we spropose a computtionally simple approximation method of estimating cell loss probability and mean cell delay for admission control of both delay sensitive and loss sensitive calls. Mixed input queueing system, where a new call combines with the existing traffic, is used as a queueing model for QOS estimation. Also traffic parameters are suggested to characterize both a new call and existing traffic. Aggregate traffic is approximated by a renewal process with these traffic parameters and then mean delay and cell loss probability are detemined using appropriate approximation formulas. The accuracy of this approximation approach is examined by comparing their results with exact analysis or simulation results of vrious mixed unput queueing systems. Based on this QOS estimation method, call admission control scheme which is traffic independent and computable in yeal time are proposed.

• The Journal of the Korea Contents Association
• /
• v.8 no.8
• /
• pp.57-64
• /
• 2008

In this paper, to resolve the problem caused by a network state information inaccuracy the slow delay time that conclusion of network state of one way delay time which accuracy delay time information, according to network state changes on the based TFRC flow control, and suggest that flow control mechanism to adjust transfer rate fit of real time multimedia data. In simulation, to measure of netowork state information that on the average about 12% difference of compared RTT and $OWD{\times}2$. When used RTT, used fair bandwidth TFRC much better than TCP about 32%, when used OWD, difference about 3% used fair bandwidth. Thus, conclusion of accuracy network state that used fair bandwidth according to network state changes on the based TFRC, users can support service of high quality that flow control mechanism to adjust transfer rate fit of real time data.

• Journal of Industrial Technology
• /
• v.22 no.A
• /
• pp.73-82
• /
• 2002

It is difficult to find the shortest paths using existing algorithms (Dijkstra, Floyd-Warshall algorithm, and etc) in high complex and large size real traffic networks The objective of this paper is to develop an evolution program to find the multiple shortest paths within reasonable time in these networks including turn-restrictions, U-turns, and etc.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.34 no.6
• /
• pp.1873-1879
• /
• 2014

There are various methodologies to forecast the travel time using real-time data but the K-nearest neighborhood (KNN) method in general is regarded as the most one in forecasting when there are enough historical data. The objective of this study is to evaluate applicability of KNN method. In this study, real-time and historical data of toll collection system (TCS) traffic flow and the dedicated short range communication (DSRC) link travel time, and the historical path travel time data are used as input data for KNN approach. The proposed method investigates the path travel time which is the nearest to TCS traffic flow and DSRC link travel time from real-time and historical data, then it calculates the predicted path travel time using weight average method. The results show that accuracy increased when weighted value of DSRC link travel time increases. Moreover the trend of forecasted and real travel times are similar. In addition, the error in forecasted travel time could be further reduced when more historical data could be available in the future database.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.54 no.8
• /
• pp.123-132
• /
• 2017

Traffic lights contain very important information for safety driving. So, the delivery of the information to drivers in real-time is a very critical issue for advanced driver assistance systems. However, traffic light detection is quite difficult because of the small sized traffic lights and the occlusion in real world. In this paper, a traffic light detection method using modified color based saliency map and morphological information is proposed. It shows 98.14% of precisions and 83.52% of recalls on computer simulations.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.9
• /
• pp.47-54
• /
• 2009

Malicious codes, which are spread through WWW are now evolved with various hacking technologies However, detecting technologies for them are seemingly not able to keep up with the improvement of hacking and newly generated malicious codes. In this paper, we define the requirements of detecting systems based on the analysis of malicious codes and their spreading characteristics, and propose an improved detection scheme which monitors HTTP Outbound traffic and detects spreading malicious codes in real time. Our proposed scheme sets up signatures in IDS with confirmed HTML tags and Java scripts which spread malicious codes. Through the verification analysis under the real-attacked environment, we show that our scheme is superior to the existing schemes in satisfying the defined requirements and has a higher detection rate for malicious codes.

• Journal of Korean Society of Transportation
• /
• v.28 no.6
• /
• pp.7-15
• /
• 2010

Research of this paper focused on developing and demonstrating of algorithm with the figures of difference between historical traffic pattern data and real-time traffic data to decide on what the incident is. The aim of this dissertation is to develop incident detection algorithm which can be understood and modified easier to operate. To establish traffic pattern of this algorithm, weighted moving average method was applied. The basis of this method was traffic volume and speed of the same day and time at the same location based on 30-second raw data. The model was completed by a serious of steps of process-screening process of error data, decision of the traffic condition, comparison with pattern data, decision of incident circumstances, continuity test. A variety of parameter value was applied to select reasonable parameter. Results of application of the algorithm came out with figures of average detection rate 94.7 percent, 0.8 percent rate of misinformation and the average detection time 1.6 minutes. With these following results, the detection rate turned out to be superior compared with result of existing model. Applying the concept of traffic patterns was useful to gain excellent results of this study. Also, this study is significant in terms of making algorithm which theorized the decision process of actual operators.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.48 no.6
• /
• pp.760-772
• /
• 1999

The CAN is a serial communication protocol for distributed real-time control and automation systems. Data generated from field devices in the distributed control of power plant are classified into three categories: real-time event data, real-time control data, non-real-time data. These data share a CAN medium. If the traffic of the CAN protocol is not efficiently controlled, performance requirements of the power plant system could not be satisfied. This paper proposes a bandwidth allocation algorithm that can be applicable to the CAN protocol. The bandwidth allocation algorithm not only satisfies the performance requirements of the real-time systems in the power plant but also fully utilizes the bandwidth of CAN. The bandwidth allocation algorithm introduced in this paper is validated using the integrated discrete-event/continuous-time simulation model which comprises the CAN network and distributed control system of power plant.

• Journal of information and communication convergence engineering
• /
• v.10 no.2
• /
• pp.129-134
• /
• 2012

As application-specific requirements for wireless sensor networks emerge, both real-time and reliable communications become major research challenges in wireless sensor networks due to the many constraints on nodes and wireless links. To support these services, several protocols have been proposed. However, since most of them were designed as well as developed for general purpose applications, it is not recommended that they be directly adapted to applications with special requirements. In this paper, we propose a way to extend the current reliable transport protocol to cover a special real-time service, the (m,k)-firm deadline stream, in wireless sensor networks. While the proposed scheme is basically built on the PSFQ protocol for reliability, some features have been newly developed to support the (m,k)-firm stream efficiently. Finally, simulation results are given to demonstrate the feasibility of the proposed scheme in high traffic and with failed links.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.7 no.1
• /
• pp.92-100
• /
• 2008

The existing transportation systems is emerged as a major obstacle to solve the problems such as a traffic jam and the increasing cost for a distribution and a traffic safety. In hun, ITS targeting intellectual vehicles and transportation infrastructure like road and signals is getting more important and the standards of ITS wireless communication is also getting attention. New traffic control strategies are being developed to utilize real-time traffic information collected by detection method using ITS wireless technology. Especially, DSRC system is being expanded wit ETCS and the use of OBU is spreading. These infrastructures will have much influence on ITS industry and a profound study on the method of utilizing a present infrastructure is going on in various fields. The optimum traffic signal control system using quality real-time information through these infrastructure is under development and so is WISDOM. Accordingly, this paper proposes communication protocol utilizing DSRC to collect real-time traffic information in WISDOM.