• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.22 no.50
• /
• pp.333-340
• /
• 1999

An ideal traffic control system should consider simultaneously both route guidance of vehicles and signal policies at intersection of a traffic network. It is known that an iterative procedure gives an optimal route to each vehicle in the network. This paper presents an iterative procedure to find an optimal signal plan for the network. We define the optimal solution as a signal equilibrium. From the definition of signal equilibrium, we prove that the fixed point solution of the iterative procedure is a signal equilibrium, when optimal signal algorithms are implemented at each intersection of the network. A combined model of route guidance and signal planning is also suggested by relating the route guidance procedure and the signal planning procedure into a single loop iterative procedure.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2003.09a
• /
• pp.224-227
• /
• 2003

The Intrsuion Detecion Systems(IDS) are required the accuracy, the adaptability, and the expansion in the information society to be changed quickly. Also, it is required the more structured, and intelligent IDS to protect the resource which is important and maintains a secret in the complicated network environment. The research has the purpose to build the model for the intelligent IDS, which creates the intrusion patterns. The intrusion pattern has extracted from the vast amount of data. To manage the large size of data accurately and efficiently, the link analysis and sequence analysis among the data mining techniqes are used to build the model creating the intrusion patterns. The model is consist of "Time based Traffic Model", "Host based Traffic Model", and "Content Model", which is produced the different intrusion patterns with each model. The model can be created the stable patterns efficiently. That is, we can build the intrusion detection model based on the intelligent systems. The rules prodeuced by the model become the rule to be represented the intrusion data, and classify the normal and abnormal users. The data to be used are KDD audit data.

• Journal of Korean Society of Transportation
• /
• v.20 no.3
• /
• pp.129-147
• /
• 2002

This paper presents a variational equality formulation by Providing new dynamic route choice condition for a link-based dynamic traffic assignment model. The concepts of used paths, used links, used departure times are employed to derive a new link-based dynamic route choice condition. The route choice condition is formulated as a time-dependent variational equality problem and necessity and sufficiency conditions are provided to prove equivalence of the variational equality model. A solution algorithm is proposed based on physical network approach and diagonalization technique. An asymmetric network computational study shows that ideal dynamic-user optimal route condition is satisfied when the length of each time interval is shortened. The I-394 corridor study shows that more than 93% of computational speed improved compared to conventional variational inequality approach, and furthermore as the larger network size, the more computational performance can be expected. This paper concludes that the variational equality could be a promising approach for real-time application of a dynamic traffic assignment model based on fast computational performance.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.6 s.38
• /
• pp.153-166
• /
• 2005

Existing single cache structure has shown difference of hit-ratio according to individually replacement strategy However. It needs new improved cache structure for reducing network traffic and providing advanced hit-ratio. Therefore, this Paper design push agent model using dual cache for increasing hit-ratio by reducing server overload and network traffic by repetition request of persistent and identical information. In this model proposes dual cache structure to do achievement replace gradual cache using by two caches storage space for reducing server overload and network traffic. Also, we show new cache replace techniques and algorithms which executes data update and delete based on replace strategy of Log(Size) +LRU, LFU and PLC for effectiveness of data search in cache. And through an experiment, it evaluates Performance of dual cache push agent model.

• Journal of Communications and Networks
• /
• v.18 no.4
• /
• pp.559-566
• /
• 2016

Software defined network (SDN) can effectively improve the performance of traffic engineering and will be widely used in backbone networks. Therefore, new energy-saving schemes must take SDN into consideration; this action is extremely important owing to the rapidly increasing energy consumption in telecom and Internet service provider (ISP) networks. Meanwhile, the introduction of SDN in current networks must be incremental in most cases, for technical and economic reasons. During this period, operators must manage hybrid networks in which SDN and traditional protocols coexist. In this study, we investigate the energy-efficient traffic engineering problem in hybrid SDN/Internet protocol (IP) networks. First, we formulate the mathematical optimization model considering the SDN/IP hybrid routing mode. The problem is NP-hard; therefore, we propose a fast heuristic algorithm named hybrid energy-aware traffic engineering (HEATE) as a solution. In our proposed HEATE algorithm, the IP routers perform shortest-path routing by using distributed open shortest path first (OSPF) link weight optimization. The SDNs perform multipath routing with traffic-flow splitting managed by the global SDN controller. The HEATE algorithm determines the optimal setting for the OSPF link weight and the splitting ratio of SDNs. Thus, the traffic flow is aggregated onto partial links, and the underutilized links can be turned off to save energy. Based on computer simulation results, we demonstrate that our algorithm achieves a significant improvement in energy efficiency in hybrid SDN/IP networks.

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

• Journal of the Korean Operations Research and Management Science Society
• /
• v.24 no.3
• /
• pp.83-91
• /
• 1999

In order to build and manage an ATM network effectively under several types of control methods, it is necessary to estimate the performance of the equipments in various viewpoints, especially of ATM multiplexer. As for the method to model the input stream into the ATM multiplexer, many researches have been done to characterize it by, such as, fluid flow, MMPP(Markov Modulated Poisson Process), or MMDP (Markov Modulated Deterministic Process). We introduce an MRP(Markov Renewal Process) to model the input stream which has proper structure to represent the burst traffic with high correlation. In this paper, we build a model for aggregated heterogeneous ON-OFF sources of ATM traffic by MRP. We make discrete time MR/D/1/B queueing system, whose input process is the superposed MRP and present a performance analysis by finding CLP(Cell Loss Probability). A simulation is done to validate our algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.4
• /
• pp.939-951
• /
• 1996

The previous study of virtual path design for one traffic class with ATM DCS only should be generalized to that for the multiple traffic class cases of being given neither virtual path candidate set nor end nodes o each virtual path. In this paper, a design model of virtual paths for the general case with multiple traffic classes is suggested. The model is represented as an optimization rpoblem with a special structure. It is solved by SQA algorithm, which is developed by authors in [3, 4]. The model and the algorithm are applied to a numerical example, and results are shown.

• Journal of Information Technology Services
• /
• v.11 no.2
• /
• pp.339-353
• /
• 2012

Mobile communication technology is advancing forward to deliver more connected devices and richer content and applications. The number of subscriptions continues to grow along with an explosive increase in the mobile data traffic demand. Thereby, it creates a significant network capacity shortage concerns for mobile network operators. In order to address this problem, it is essential to increase the network capacity at a low additional cost. The device-to-device (D2D) communication based proximity service is believed to have a promising future mobile communication technology that is capable to create new mobile service opportunities and offload traffic to the eNB. In addition, it is also required to develop new mobile communication services and its business models not only to accommodate the increasing mobile traffic demand but also to foster profitability of mobile business service providers such as the network providers, contents providers and platform providers. In this article, we first analyze current mobile business eco-system in the context of CPNT based value chain. Then, propose service development framework and business model creation methodologies for the device-to-device communication based services in the beyond LTE/LTE-Advanced systems.

• Proceedings of the IEEK Conference
• /
• summer
• /
• pp.143-146
• /
• 2004

Differentiated services (DiffServ) has been widely accepted as the service model to adopt for providing quality-of­service (QoS) over the next-generation IP networks. There is a growing need to support QoS in mobile ad hoc networks. Supporting DiffServ in mobile ad hoc networks, however, is very difficult because of the dynamic nature of mobile ad hoc networks, which causes network congestion. The network congestion induces long transfer packet delay and low throughput which make it very difficult to support QoS in mobile ad hoc networks. We propose DiffServ module to support differentiated service in mobile ad hoc networks through congestion control. Our DiffServ module uses the periodical rate control for real time traffic and also uses the best effort bandwidth concession when network congestion occurs. Network congestion is detected by measuring the packet transfer delay or bandwidth threshold of real time traffic. We evaluate our mechanism via a simulation study. Simulation results show our mechanism may offer a low and stable delay and a stable throughput for real time traffic in mobile ad hoc networks.