• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.4B
• /
• pp.162-169
• /
• 2005

Network traffic measurements show that the data traffic on packet switched networks has the self-similar features which is different from the traditional traffic models such as Poisson distribution or Markovian process model. Most of the call admission control researches have been done on the performance analysis of a single network switch. It is necessary to consider the performance analysis of the proposed admission control scheme under interconnected switch environment because the data traffic transmits through switches in networks. From the simulation results, it is shown that the call admission control scheme may not operate properly on the interconnected switch even though the scheme works well on a single switch. In this parer, we analyze the cell loss probability, utilization and self-similarity of output ports of the interconnected networks switch by using shared buffer memory management schemes and propose the new call admission control scheme considering the interconnected network switches under self-similar traffic environments.

• Journal of Korean Society of Transportation
• /
• v.14 no.4
• /
• pp.49-76
• /
• 1996

Until recently, the inductive loop detecters(ILD) have been used to collect a traffic information in a part of traffic manangment and control. The ILD is able to collect a various traffic data such as a occupancy time and non-occupancy time, traffic volume, etc. The occupancy time of these is very important information for traffic control algorithms, which is required a high accuracy. This accuracy may be improved by classifying a vehicle type with ILD. To classify a vehicle type based on a Analog Digital Converted data collect form ILD, this study used a typical and modifyed statistic method and General Learning Vector Quantization unsuperviser neural network model and a hybrid model of GLVQ and statistic method, As a result, the hybrid model of GLVQ neural network model is superior to the other methods.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.3 no.6
• /
• pp.575-596
• /
• 2009

Facing limited network resources such as bandwidth and processing capability, the Internet will have congestion from time to time. In this paper, we propose a scheme to maximize the total utility offered by the network to the end user during congested times. We believe the only way to achieve our goal is to make the scheme application-aware, that is, to take advantage of the characteristics of the application. To make our scheme scalable, it is designed to be class-based. Traffic from applications with similar characteristics is classified into the same class. We adopted the RED queue management mechanism to adaptively control the traffic belonging to the same class. To achieve the optimal utility, the traffic belonging to different classes should be controlled differently. By adjusting link bandwidth assignments of different classes, the scheme can achieve the goal and adapt to the changes of dynamical incoming traffic. We use the control theoretical approach to analyze our scheme. In this paper, we focus on optimizing the control on two types of traffic flows: TCP and Simple UDP (SUDP, modeling audio or video applications based on UDP). We derive the differential equations to model the dynamics of SUDP traffic flows and drive stability conditions for the system with both SUDP and TCP traffic flows. In our study, we also find analytical results on the TCP traffic stable point are not accurate, so we derived new formulas on the TCP traffic stable point. We verified the proposed scheme with extensive NS2 simulations.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.1568-1570
• /
• 2005

The internet is already a part of life. It is very convenient and people can do almost everything with internet that should be done in real life. Along with the increase of the number of internet user, various network attacks through the internet have been increased as well. Also, Large-scale network attacks are a cause great concern for the computer security communication. These network attack becomes biggest threat could be down utility of network availability. Most of the techniques to detect and analyze abnormal traffic are statistic technique using mathematical modeling. It is difficult accurately to analyze abnormal traffic attack using mathematical modeling, but network simulation technique is possible to analyze and simulate under various network simulation environment with attack scenarios. This paper performs modeling and simulation under virtual network environment including $NGSS^{1}$ system to analyze abnormal traffic-flooding attack.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.549-549
• /
• 2000

In the previous work, we dealt with a traffic analysis of network-based control system and its architecture using the CAN protocol. It is difficult to determine an optimal network architecture for a specific system. In this paper, we propose the architecture of network-based control system applicable to a specific AGV system with manipulator arms. We define the fixed number of periodic messages to be occurred in this system. In the proposed system architecture, we analyse its traffic for the real-time communication of all messages, determine the optimal sampling period of an analog sensor to be satisfied with the required specification and the number of possible sensors to be added through simulation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.2
• /
• pp.313-329
• /
• 2011

To provide a seamless network to customers, Internet service providers must promptly detect and control abnormal traffic. One approach is to shorten the traffic information measurement cycle. However, performance degradation is inevitable if traffic measurement servers merely shorten the cycle and measure all traffic. This paper presents a software architecture that can measure traffic more frequently without degrading performance by estimating the level of abnormal traffic. The algorithm in the architecture estimates the values of the interface group objects in MIB by using the IP group objects thereby reducing the number of measurements and the size of measured data. We evaluated this architecture on part of Internet service provider's IP network. When the traffic was measured 5 times more than before, the CPU usage and TPS of the proposed scheme was 7% and 41% less than that of the original scheme while the false positive rate and false negative rate were 3.2% and 2.7% respectively.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.6
• /
• pp.1085-1094
• /
• 1994

We propose a traffic flow control scheme of B-NT with temporary cell buffering and selective cell discarding to prevent congestion state of the network nodes in B-ISDN systems to reduce or suppress output cell strams towards T interface. We define the states of the network nodes as normal, pre-congestion, and congestion. In a pre-congestion state, the loss-sensitive traffic is temporarily buffered to slow down the rate of the output traffic streams. In a congestion state, the delay-sensitive traffic is selectively discarded to suppress the output traffic streams as possible in addition to the cell buffering. We model the input cell streams and the states of the network nodes with Interrupted Bernoulli Process and 3-state Markov chain to analyze the performance of the proposed scheme in the B-NT system. The appropriate size of the cell buffer is explored by means of simulation and the influence on the performance of the proposed scheme by the network node state is discussed. As results, more than 2,00 cells of buffer size is needed for the control of medium of lower than the medium, degree of congestion occurrence in the network node while the control of high degree of congestion occurrence is nearly impossible.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.5B
• /
• pp.491-497
• /
• 2004

In this Paper, we W a Hovel global traffic control architecture to isolate malicious network attacks and protect network infrastructure in Internet backbone networks. Unlike existing methods based on individual packets or flows, since the proposed detection and control methods are operated on the aggregate traffic level, the computational complexity can k significantly reduced, and they are applicable to develop a global defense architecture against network attack. Experimental results show that the proposed scheme can detect the network attack symptoms very exactly and quickly and protect the network resources as well as the normal traffic flows very efficiently.

• Proceedings of the KAIS Fall Conference
• /
• 2003.11a
• /
• pp.236-242
• /
• 2003

ATM ABR service controls network traffic using feedback information on the network congestion situation in order to guarantee the demanded service qualities and the available cell rates. In this paper we apply the control method using queue length prediction to the formation of feedback information for more efficient ABR traffic control. If backward node receive the longer delayed feedback information on the impending congestion, the switch can be already congested from the uncontrolled arriving traffic and the fluctuation of queue length can be inefficiently high in the continuing time intervals. The feedback control method proposed in this paper predicts the queue length in the switch using the slope of queue length prediction function and queue length changes in time-series. The predicted congestion information is backward to the node. NLMS and neural network are used as the predictive control functions, and they are compared from performance on the queue length prediction. Simulation results show the efficiency of the proposed method compared to the feedback control method without the prediction. Therefore, we conclude that the efficient congestion and stability of the queue length controls are possible using the prediction scheme that can resolve the problems caused from the longer delays of the feedback information.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.17 no.7
• /
• pp.758-766
• /
• 1992

In this paper, the traffic control scheme used by M-cancel-Get services In CMIS /CMIP, OSI network management protocol, is presented and the performance is analyzed. M -Get service which allows a multiple response functional unit is a service that searches an attribute of the managed sys-tem and the service requires a large quantity of response as its typical characteristics. At the time, management response is transmitted Irrelevant to the network condition In the managed as well as In the management system. The management system requests M Canrel-Get service which informs the canrelation of M -Get service (or Information retrieval. In case of using M-Cancel-Get service for traffic control, the point of time for traffic control is propose by the result of simulation on management response time as the number of multiple response packets is Increased. The result is analyzed by processing ratio of the network workload and the average delay time of packets. As a result, the traffic control parameters proposed in the study show superiority in its processing ratio and the average packet delay time. Especially, its performance improves as the size of background traffic density Increase.