• International Journal of Highway Engineering
• /
• v.18 no.3
• /
• pp.47-57
• /
• 2016

PURPOSES : This study aims to examine the differences between the existing traffic demand forecasting method and the traffic demand forecasting method considering future regional development plans and new road construction and expansion plans using a four-step traffic demand forecast for a more objective and sophisticated national highway maintenance. This study ultimately aims to present future pavement deterioration and budget forecasting planning based on the examination. METHODS : This study used the latest data offered by the Korea Transport Data Base (KTDB) as the basic data for demand forecast. The analysis scope was set using the Daejeon Metropolitan City's O/D and network data. This study used a traffic demand program called TransCad, and performed a traffic assignment by vehicle type through the application of a user equilibrium-based multi-class assignment technique. This study forecasted future traffic demand by verifying whether or not a realistic traffic pattern was expressed similarly by undertaking a calibration process. This study performed a life cycle cost analysis based on traffic using the forecasted future demand or existing past pattern, or by assuming the constant traffic demand. The maintenance criteria were decided according to equivalent single axle loads (ESAL). The maintenance period in the concerned section was calculated in this study. This study also computed the maintenance costs using a construction method by applying the maintenance criteria considering the ESAL. The road user costs were calculated by using the user cost calculation logic applied to the Korean Pavement Management System, which is the existing study outcome. RESULTS : This study ascertained that the increase and decrease of traffic occurred in the concerned section according to the future development plans. Furthermore, there were differences from demand forecasting that did not consider the development plans. Realistic and accurate demand forecasting supported an optimized decision making that efficiently assigns maintenance costs, and can be used as very important basic information for maintenance decision making. CONCLUSIONS : Therefore, decision making for a more efficient and sophisticated road management than the method assuming future traffic can be expected to be the same as the existing pattern or steady traffic demand. The reflection of a reliable forecasting of the future traffic demand to life cycle cost analysis (LCCA) can be a very vital factor because many studies are generally performed without considering the future traffic demand or with an analysis through setting a scenario upon LCCA within a pavement management system.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.4
• /
• pp.697-708
• /
• 1996

In this paper, we study reactive congestion control with priority in ATM network. The priority schemes for buffer access, partial buffer sharing have been investigated in order to improve the utilization of ATM network resources the network and to satisfy the most demanding traffic class. We consider in this paper a discrete-time queueing model for partial buffer sharing with two Markov modulated Poisson inputs. This model can be used to analyze the the effects of the partial buffer sharing priority scheme on system performance for realistic cases of bursty services. Explicit formulae are derived for the number of cells in the system and the loss probabilities for the traffic. Congestion may still occur because of unpredictable statistical fluctuation of traffic sources even when preventive control is performed in the network. In this Paper, we study reactive congestion control, in which each source changes its cell emitting rate a daptively to the traffic load at the switching node. Our intention is that,by incorporating such a congcstion control method in ATM network,more efficient congsestion control is established. We develope an analytical model,and carry out an approximateanalysis of reactive congestion con-trol with priority.Numerical results show that several orders of magnitude improvement in the loss probability can be achieved for the high priority class with little impact on the low priority class performance.And the results show that the reactive congestion control with priority are very effective in avoiding congestion and in achieving the statistical gain.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.6
• /
• pp.927-936
• /
• 1995

ATM Forum has defined a new service class for data applications called Available Bit Rate(ABR) Service, which has highly bursty traffic and unpredictable burst size. It is desirable that we reduce the probability of retrans mission of packets by minimizing the loss of cells because the traffic is much more sensitive to loss than delay. The Forum has also selected the Rate-Based Control for the ABR service and proposed EPRCA as the control mechanism for the service. This paper proposes the combination of EPRCA and the other feedb ack control mechanisms such as BECN and BP. The combined control mechanism control ABR traffic more efficiently and the simulation results show that the network performance can be improved by choosing the appropriate parameters.

• Journal of Communications and Networks
• /
• v.9 no.4
• /
• pp.428-437
• /
• 2007

Along with the development of network, more and more functions and services are required by users, while traditional network fails to support all of them. Although overlay is a good solution to some demands, using them in an efficient, scalable way is still a problem. This paper puts forward a framework on how to construct an efficient, scalable overlay mesh in real network. Main differences between other overlays and ours are that our overlay mesh processes some nice features including class-of-service(CoS) and traffic engineering(TE). It embeds the end-to-end optimal traffic control law which can distribute traffic in an optimal way. Then, an example is given for better understanding the framework. Particularly, besides good scalability, and failure recovery, it possesses other characteristics such as routing simplicity, self-organization, etc. In such an overlay mesh, an applicable source routing scheme called hierarchical source routing is used to transmit data packet based on UDP protocol. Finally, a guideline derived from a number of simulations is proposed on how to set various parameters in this overlay mesh, which makes the overlay more efficient.

• Journal of the Korea Society of Computer and Information
• /
• v.26 no.12
• /
• pp.123-132
• /
• 2021

Malicious activities of Botnets are responsible for huge financial losses to Internet Service Providers, companies, governments and even home users. In this paper, we try to confirm the possibility of detecting botnet traffic by applying the deep learning model Convolutional Neural Network (CNN) using the CTU-13 botnet traffic dataset. In particular, we classify three classes, such as the C&C traffic between bots and C&C servers to detect C&C servers, traffic generated by bots other than C&C communication to detect bots, and normal traffic. Performance metrics were presented by accuracy, precision, recall, and F1 score on classifying both known and unknown botnet traffic. Moreover, we propose a stackable botnet detection system that can load modules for each botnet type considering scalability and operability on the real field.

• International Journal of Highway Engineering
• /
• v.7 no.4 s.26
• /
• pp.41-47
• /
• 2005

Traffic data such as traffic volume, speed, and vehicle Class are very important basic data for the plan and design of highway. Based on traffic data, the future service level of a specific highway and geometry of newly constructed or expended road is predicted and determined. The Ministry of Construction & Transportation has simultaneously surveyed coverage count and permanent count at highways since 1985. Traffic volume survey sections were determined at jointed nodes of highways and jointed nodes of highways and other roads such as freeway and local highway. Volume survey was performed at these sections. The premise to decide these sections is assumed that links between jointed nodes of main highways exhibit similar traffic characteristics. Recently, due to the change of highway geometries such as construction of detour road and installations of traffic facilities such as installation of media, traffic characteristics of the existing traffic volume survey sections was changed. To reflect these changes, traffic characteristics at homogeneous road sections was widely evaluated and analyzed. Using Genetic Algorithms, a model was developed for the evaluation of traffic characteristics at homogeneous road sections. Traffic volume survey sections were then determined through the application of the developed model for current traffic system.

• Journal of the Korea Society of Computer and Information
• /
• v.26 no.6
• /
• pp.73-80
• /
• 2021

In this paper, we propose a packet processing method capable of handling large-capacity traffic over 20Gbps using multi-core and huge page memory approaches. As ICT technology advances, the global average monthly traffic is expected to reach 396 exabytes by 2022. With the increase in network traffic, cyber threats are also increasing, increasing the importance of traffic analysis. Traffic analyzed as an existing high-cost foreign product simply stores statistical data and visually shows it. Network administrators introduce and analyze many traffic analysis systems to analyze traffic in various sections, but they cannot check the aggregated traffic of the entire network. In addition, since most of the existing equipment is of the 10Gbps class, it cannot handle the increasing traffic every year at a fast speed. In this paper, as a method of processing large-capacity traffic over 20Gbps, the process of processing raw packets without copying from single-core and basic SMA memory approaches to high-performance packet reception, packet detection, and statistics using multi-core and NUMA memory approaches suggest When using the proposed method, it was confirmed that more than 50% of the traffic was processed compared to the existing equipment.

• Journal of Korean Society of Transportation
• /
• v.17 no.4
• /
• pp.85-97
• /
• 1999

The Purpose of this Paper is the development of the day-to-day dynamic combined model on the evaluation of traveller's traffic information for multi-mode and multi-class environments. Information is assumed to be provided for multi-mode such as bus and automobile. and multi-class such as a driver with and without route guidance equipment when they depart for their trips. The information provision strategies have been developed in the base of user equilibrium, system optimum and in between them. The Sioux Falls network is used for the evaluation of the model and information provision strategies. In the numerical analysis, a Braess' paradox for the information provision, which is the increase of travel time even though the number of information usage level and user are increased, has been occurred so that these kinds of information strategies should be implemented with special care.

• The Journal of the Korea Contents Association
• /
• v.6 no.7
• /
• pp.58-68
• /
• 2006

There are two traditional scheduling methods known as PQ and WRR in the DiffServ network, however, these two scheduling methods have some drawbacks. In this paper, we propose an algorithm that can be adopted in WRR scheduler with making up for weak points of PQ and WRR. The proposed algorithm produces the control discipline by the fuzzy theory to dynamically assign the weight of WRR scheduler with checking the Queue status of each class. To evaluate the performance of the proposed algorithm, We accomplished a computer simulation using NS-2. From simulation results, the proposed algorithm improves the packet loss rate of the EF class traffic to 6.5% by comparison with WRR scheduling method and that of the AF4 class traffic to 45% by comparison with PQ scheduling method.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.12
• /
• pp.46-58
• /
• 2003

The recent Internet is changing from its best-effort service and needs the network structure and traffic engineering, which can support various applications requiring differentiated traffic processing and high quality of service. The extension of the Internet from wired to wireless system generating location-dependent and burst errors make more difficult to support a good service with the existing packet scheduling algorithm. In this paper, we propose a wireless diffserv packet scheduling (WDSPS) algorithm that can provide reliable service in the differentiated wireless internet service network. The proposed scheduling algorithm solves the HOL(head of line) blocking problems of class queue occurred in wireless network, supports the differentiated service for each class which is defined in differentiated service networks and makes possible the gradual and efficient service compensation not only among classes but also among flows to prevent the monopoly of one class or one flow. Through simulations, we show that our proposed WDSPS scheduling algorithm can provide the required QoS differentiation between classes and enhance the service throughput in various wireless network conditions.