• Journal of Communications and Networks
• /
• v.10 no.1
• /
• pp.89-97
• /
• 2008

Anomaly detection systems playa significant role in protection mechanism against attacks launched on a network. The greatest challenge in designing systems detecting anomalous exploits is defining what to measure. Effective yet simple, Shannon entropy metrics have been successfully used to detect specific types of malicious traffic in a number of commercially available IDS's. We believe that Renyi entropy measures can also adequately describe the characteristics of a network as a whole as well as detect abnormal traces in the observed traffic. In addition, Renyi entropy metrics might boost sensitivity of the methods when disambiguating certain anomalous patterns. In this paper we describe our efforts to understand how Renyi mutual information can be applied to anomaly detection as an offline computation. An initial analysis has been performed to determine how well fast spreading worms (Slammer, Code Red, and Welchia) can be detected using our technique. We use both synthetic and real data audits to illustrate the potentials of our method and provide a tentative explanation of the results.

• The KIPS Transactions:PartC
• /
• v.10C no.1
• /
• pp.51-60
• /
• 2003

One of the most important matters in designing network and realizing service, is to grip on the traffic characteristics. Conventional traffic prediction and analysis used the models which based on the Poisson or Markovian. Recently, experimental research on the LAN, WAN and VBR traffic properties have been pointed rut that they weren't able to display actual real traffic specificities because the models based on the Poisson assumption had been underestimated the long range dependency of network traffic and self-similar peculiarities, it has been lately presented that the new approach method using self-similarity characteristics as similar as the real traffic models. Therefore, in this paper, we generated self-similar data traffic like real traffic as background load. On the existing ABR congestion control algorithm, we analyzed by classify into ACR, buffer utilization. cell drop rate, transmission throughput with the representative EFCI, ERICA, EPRCA and NIST twitch algorithm to show the efficient reaction about the burst traffic.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.9
• /
• pp.2326-2333
• /
• 2009

In the adaptable bandwidth allocation technique, a transmission plan for variable rate video data is made by smoothing algorithms such as CBA algorithm and the data is sent by the transmission plan considering network traffic. But the CBA algorithm, the MCBA algorithm, MVBA algorithm and the other smoothing algorithms produce a transmission plan where the size of the increasing interval of transmission rate is generally larger than the size of the decreasing interval. And the transmission rate in CBA algorithm, the MCBA algorithm, the MVBA algorithm is changed in overflow curve during the increasing interval of transmission rate. This may cause many frames to be discarded when available transmission rate is larger than transmission rate by the transmission plan. In this paper, the smoothing algorithm, where transmission rate is changed in the middle of underflow curve and overflow curve to decrease the number of discarded frames, but the transmission rate increases at the minimum, and the CBA algorithm, the MCBA algorithm, the MVBA algorithm are applied to a transmission plan in the adaptable bandwidth allocation technique, and the minimum frame rates, the average frame rates, the variation of frame rates, and the numbers of discarded frames are compared in among algorithms.

• Journal of Korean Society of Transportation
• /
• v.20 no.4
• /
• pp.135-150
• /
• 2002

The basic assumption of analytical Dynamic Traffic Assignment models is that traffic demand and network conditions are known as a priori and unchanging during the whole planning horizon. This assumption may not be realistic in the practical traffic situation because traffic demand and network conditions nay vary from time to time. The rolling horizon implementation recognizes a fact : The Prediction of origin-destination(OD) matrices and network conditions is usually more accurate in a short period of time, while further into the whole horizon there exists a substantial uncertainty. In the rolling horizon implementation, therefore, rather than assuming time-dependent OD matrices and network conditions are known at the beginning of the horizon, it is assumed that the deterministic information of OD and traffic conditions for a short period are possessed, whereas information beyond this short period will not be available until the time rolls forward. This paper introduces rolling horizon implementation to enable a multi-class analytical DTA model to respond operationally to dynamic variations of both traffic demand and network conditions. In the paper, implementation procedure is discussed in detail, and practical solutions for some raised issues of 1) unfinished trips and 2) rerouting strategy of these trips, are proposed. Computational examples and results are presented and analyzed.

• International Journal of Highway Engineering
• /
• v.18 no.2
• /
• pp.91-101
• /
• 2016

PURPOSES : The aim of this study was to compare the performance of the QUEENSOD method and the gravity model in estimating Origin-Destination (O/D) tables for a large-sized microscopic traffic simulation network. METHODS : In this study, an expressway network was simulated using the microscopic traffic simulation model, VISSIM. The gravity model and QUEENSOD method were used to estimate the O/D pairs between internal and between external zones. RESULTS: After obtaining estimations of the O/D table by using both the gravity model and the QUEENSOD method, the value of the root mean square error (RMSE) for O/D pairs between internal zones were compared. For the gravity model and the QUEENSOD method, the RMSE obtained were 386.0 and 241.2, respectively. The O/D tables estimated using both methods were then entered into the VISSIM networks and calibrated with measured travel time. The resulting estimated travel times were then compared. For the gravity model and the QUEENSOD method, the estimated travel times showed 1.16% and 0.45% deviation from the surveyed travel time, respectively. CONCLUSIONS : In building a large-sized microscopic traffic simulation network, an O/D matrix is essential in order to produce reliable analysis results. When link counts from diverse ITS facilities are available, the QUEENSOD method outperforms the gravity model.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.1 no.1
• /
• pp.8-13
• /
• 2006

In mobile ad hoc networks, most of on demand routing protocols such as DSR and AODV do not deal with traffic load during the route discovery procedure. To achieve load balancing in networks, many protocols have been proposed. However, existing load balancing schemes do not consider the remaining available buffer size of the interface queue, which still results in buffer overflows by congestion in a certain node which has the least available buffer size in the route. To solve this problem, we propose a load balancing protocol called Dynamic Congestion Aware Routing Protocol (DCAR) which monitors the remaining buffer length of all nodes in routes and excludes a certain congested node during the route discovery procedure. We also propose two buffer threshold values to select an optimal route selection metric between the traffic load and the minimum hop count. Through simulation study, we compare DCAR with other on demand routing protocols and show that the proposed protocol is more efficient when a network is heavily loaded.

• Journal of Digital Contents Society
• /
• v.18 no.7
• /
• pp.1443-1450
• /
• 2017

The purpose of this study is to develop an intelligent parking dispatching system based on LoRa network technology. During the local festival, many tourists come into the festival site simultaneously after sunset. To handle the traffic jam and parking dispatching, many traffic management staffs are engaged in the main road to guide the cars to available parking lots. Nevertheless, the traffic problems are more serious at the peak time of festival. Such parking dispatching problems are complex and real-time traffic information dependent. We used Queuing theory to predict inbound traffics and to measure parking service performance. Q-learning algorithm is used to find fastest routes and dispatch the vehicles efficiently to the available parking lots.

• Journal of KIISE:Computing Practices and Letters
• /
• v.10 no.5
• /
• pp.365-374
• /
• 2004

This paper proposes the architecture of Intermediate System to Intermediate System routing protocol. IS-IS is a link state routing protocol designed to provide routing in a network layer protocols with datagram services. IS-IS has favored scalability and stability. So, it is important to support IS-IS for the MPLS system used in backbone networks. Especially, IS-IS must provide network state information and available resource information for supporting qualify of services in MPLS network. Therefore, we propose the design architecture of IS-IS routing protocol and the implementation technologies. Also, we propose extended architecture for traffic engineering in ATM based MPLS system.

• ETRI Journal
• /
• v.44 no.6
• /
• pp.945-954
• /
• 2022

The 5G mobile network is promising to handle the dynamic traffic demands of user equipment (UE). Unmanned aerial vehicles (UAVs) equipped with wireless transceivers can act as flying base stations in heterogeneous networks to ensure the quality of service of UE. However, it is challenging to efficiently allocate limited bandwidth to UE due to dynamic traffic demands and low network coverage. In this study, a blockchain-enabled bandwidth allocation framework is proposed for secure bandwidth trading. Furthermore, the proposed framework is based on the Cournot oligopoly game theoretical model to provide the optimal solution; that is, bandwidth is allocated to different UE based on the available bandwidth at UAV-assisted-based stations (UBSs) with optimal profit. The Cournot oligopoly game is performed between UBSs and cellular base stations (CBSs). Utility functions for both UBSs and CBSs are introduced on the basis of the available bandwidth, total demand of CSBs, and cost of providing cellular services. The proposed framework prevents security attacks and maximizes the utility functions of UBSs and CBSs.

• Journal of KIISE:Information Networking
• /
• v.34 no.2
• /
• pp.100-109
• /
• 2007

Streaming protocol with the Available Bandwidth measurement scheme has problems that are to measure a Available Bandwidth uncorrectly and slowly. In this basis, in order to overcome limitations of the previous streaming protocols, we propose the NABO that is a New Available Bandwidth measurement scheme used by OWD(One-Way Delay). Proposed NABO(New Available Bandwidth measurement based on OWD) measures the constant transmission delay occurred by bottleneck link capacity and the variable delay. Competing traffic contribute to the variable delay. Through the measurement of the constant transmission delay and the competing traffic, a NABO can measure the Available Bandwidth correctly and fast in network. The simulation result proves that the proposed NABO has a performance that satisfies both accuracy viewpoint and measurement speed viewpoint.