• Proceedings of the IEEK Conference
• /
• 2001.06a
• /
• pp.133-136
• /
• 2001

In this work, the problem of regulating and tracking available bit rate (ABR) traffic in ATM network. The issue of providing control signals to throttled sources at distant location from bottlenecked node is of particular interest. Network modeling and design of controller is outlined. To obtain optimal control, receding horizon control (RHC) theory is applied. Simulation results are presented in views of regulation and tracking problems with or without constraints.

• Journal of KIISE:Information Networking
• /
• v.32 no.2
• /
• pp.134-146
• /
• 2005

Research about QoS in the ad-hoc networks for stable service of various applications has been needed as the expectation about the realization of the ad-hoc networks grows bigger. Existing researches about QoS in the ad-hoc network had the problems which can not guarantee the quantitative services or create the overhead. In this paper, we propose a novel algorithm of QFAN(QoS Framework for Ad-hoc Networks) the framework to resolve such problems and considered application of the proposed algorithm into the ad-hoc networks. Our model can guarantee the minimum bandwidth of the real-time traffic as minimized the overhead. And, disproportionate distribution of bandwidth problem can resolve by the proposed algorithm through the fair share between real-time traffic and best-effort traffic about available bandwidth. We design both the TiRe(Tiny Reservation) and the ADR(Adaptive Drop Rate) control algorithm to apply the proposed QFAN. Using simulation, we confirm fair share of available bandwidth between real-time traffic and best-effort traffic as guarantee minimum required bandwidth of real-time traffic.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.24 no.7
• /
• pp.26-40
• /
• 2010

We propose a new routing protocol, MCQosR, that is based on bandwidth estimation, admission control, and a routing metric, MCCR - suitable for wireless ad-hoc networks with multiple radios and channels. To use the full capacity of a wireless link, we assume a node with multiple radios for full duplex operation, and a radio using multiple channels to exclude route-intra interference. This makes it possible to use the capacity of a wireless link. Then, to provide bandwidth and delay guarantee, we have a radio with a fixed channel for layer-3 data reception at each node, used to estimate the available bandwidth and expected delay of a wireless link. Based on the estimate of available bandwidth and delay, we apply the call admission control to a new call requiring bandwidth and delay guarantee. New calls with traffic that will overflow link or network capacity are rejected so the accepted calls can use the required bandwidth and delay. Finally, we propose a routing metric, MCCR, which considers the channel contentions and collisions of a wireless link operating in CSMA/CA. MCCR is useful for finding a route with less traffic and distributing traffic over the network to prevent network congestion as much as possible. The simulation of the MCQosR protocol and the MCCR metric shows traffic is distributed and guaranteed service is provided for accepted calls.

• International Journal of Computer Science & Network Security
• /
• v.23 no.12
• /
• pp.91-100
• /
• 2023

As SDN devices and systems hit the market, security in SDN must be raised on the agenda. SDN has become an interesting area in both academics and industry. SDN promises many benefits which attract many IT managers and Leading IT companies which motivates them to switch to SDN. Over the last three decades, network attacks becoming more sophisticated and complex to detect. The goal is to study how traffic information can be extracted from an SDN controller and open virtual switches (OVS) using SDN mechanisms. The testbed environment is created using the RYU controller and Mininet. The extracted information is further used to detect these attacks efficiently using a machine learning approach. To use the Machine learning approach, a dataset is required. Currently, a public SDN based dataset is not available. In this paper, SDN based dataset is created which include legitimate and non-legitimate traffic. Classification is divided into two categories: binary and multiclass classification. Traffic has been classified with or without dimension reduction techniques like PCA and LDA. Our approach provides 98.58% of accuracy using a random forest algorithm.

• Proceedings of the IEEK Conference
• /
• 2001.06a
• /
• pp.257-260
• /
• 2001

As today's network infrastructure continues to grow and DiffServ IP networks ate now available to provide various levels of flexible QoS services. DiffServ guarantees good scalability but shows dynamic QoS dependent on network traffic loads. Therefore, in this paper, we investigate the dynamics of DiffSev QoS and present analytical model to estimate the allowable traffic load under the given network conditions.

• International Journal of Computer Science & Network Security
• /
• v.21 no.12
• /
• pp.257-263
• /
• 2021

Though many have studied choosing one of the alternative ways to reach a destination, the factors such as average road speed, distance, and number of traffic signals, traffic congestion, safety, and services still presents an indisputable challenge. This paper proposes two approaches: Appropriate membership function and ambiguous rule-based approach. It aims to tackle the route choice problem faced by almost all drivers in any city. It indirectly helps in tackling the problem of traffic congestion. The proposed approach considers the preference of each driver which is determined in a flexible way like a human and stored in the driver profile. These preferences relate to the criteria for evaluating each candidate route, considering the average speed, distance, safety, and services available. An illustrative case study demonstrates the added value of the proposed approach compared to some other approaches.

• Proceedings of the KIEE Conference
• /
• 2002.11c
• /
• pp.430-433
• /
• 2002

Fieldbus traffic consists of periodic, time-critical and time-available data. A bandwidth allocation scheme allocates periodic, time-critical and time-available data traffic to the bandwidth-limited network resource. This paper presents an implementation method of the bandwidth allocation scheme in the user layer of Foundation fieldbus. In this study, an experimental model of a Foundation Fieldbus network system is developed. Using the experimental model, validity of the bandwidth allocation scheme is examined. The results obtained from the experimental model show that the proposed scheme restricts the delay of both periodic and time-critical data to a pre-specified bound. The bandwidth allocation scheme also fully utilized the bandwidth resource of the network system.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.20 no.41
• /
• pp.51-60
• /
• 1997

In this paper, A Connection Admission Control(CAC) algorithm by Dynamic Bandwidth Allocation is proposed. The B-ISDN will be required to carry traffic generated by a various traffic sources. These source will have all traffic flow characteristics and quality of services requirements. When a connectionless message with burstiness arrives at a node during a renewal period, CAC will be dynamically determined connection request by using the predetermined connection admission bounds in estimating the number of input arriving cells. The proposed algorithm estimates the available bandwidth by observing cell streams of the aggregate traffic. A connection request is accepted if the available bandwidth is larger than declared peak rate, and otherwise rejected. The proposed CAC scheme is shown to be promising and practically feasible in obtaining efficient transmission of burst traffic with guaranteed quality of services.

• Journal of Korean Society of Transportation
• /
• v.21 no.1
• /
• pp.53-63
• /
• 2003

The Origin-Destination(OD) matrix is very important in describing transport movements in a region. The OD matrix can be estimated using traffic counts on links in the transport network and other available information. This information on the travel is often contained in a target OD matrix and traffic counts in links. To estimate an OD matrix from traffic counts, they are the major input data which obviously affects the accuracy of the OD matrix estimated, Generally, the quality of an estimated OD matrix depends much on the reliability of the input data, and the number and locations of traffic counting points in the network. Any Process regarding the traffic counts such as the amount and their location has to be carefully studied. The objective of this study is to select of the optimal location of traffic counting points for the OD matrix estimation. The model was tested in nationwide network. The network consists of 224 zones, 3,125 nodes and 6,725 links except to inner city road links. The OD matrix applied for selection of traffic counting points was estimated to 3-constrained entropy maximizing model. The results of this study follow that : the selected alternative to the best optimal counting points of six alternatives is the alternative using common links of OD matrix and vehicle-km and traffic density(13.0% of 6,725 links), however the worst alternative is alternative of all available traffic counting points(44.9% of 6,725 links) in the network. Finally, it should be concluded that the accuracy of reproduced OD matrix using traffic counts related much to the number of traffic counting points and locations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.4B
• /
• pp.683-691
• /
• 2000

In this paper, we proposed the cell multiplexer using Hopfield neural network and the bandwidth predictor using the backpropagation neural network in order to make an accurate call setup decision. The cell multiplexer controls heterogeneous traffic and the bandwidth predictor estimates minimum bandwidth which satisfies traffic's QoS and maximizes throughput in network. Also, a novel connection admission controller decides on connection setup using the predicted bandwidth from bandwidth predictor and available bandwidth in networks. And then, we proposed a fuzzy traffic policer, when traffic sources violate the contract, takes an appropriate action and aim proved traffic shaper, which controls burstness which is one of key characteristics in multimedia traffic. We simulated the proposed controller. Simulation results show that the proposed controller outperforms existing controller.