• Proceedings of the Korea Society for Simulation Conference
• /
• 2002.05a
• /
• pp.239-242
• /
• 2002

멀티미디어 환경에서 많은 패킷 스위치 네트워크로부터 발생되는 트래픽은 burstiness성질이 상당히 넓은 범위의 time scale상에 존재하고, 트래픽 특성이 self-similar현상을 보이고 있다는 것이 알려지고 있다. 본 논문에서는 Shared-Buffer를 이용한 ATM 스위치 buffer관리방법을 적용하여 입력포트에 self-similar 트래픽이 들어올 때 출력포트의 long-range dependency의 변화를 분석하며 아울러 큐잉 지연, 셀 손실률 그리고 이용도(utilization)등이 self-similar 트래픽에 미치는 영향을 분석할 것이다.

• Journal of applied mathematics & informatics
• /
• v.18 no.1_2
• /
• pp.455-464
• /
• 2005

In this paper, we analyze a queueing system with overload control by arrival rates. This paper is motivated by overload control to prevent congestion in telecommunication networks. The arrivals occur dependent upon queue length. In other words, if the queue length increases, the arrivals may be reduced. By considering the burstiness of traffics in telecommunication networks, we assume the arrival to be a Markov-modulated Poisson process. The analysis by the embedded Markov chain method gives to us the performance measures such as loss and delay. The effect of performance measures on system parameters also is given throughout the numerical examples.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1996.10a
• /
• pp.215-218
• /
• 1996

ATM망은 실제로 이용 가능한 대역폭 이상을 할당하는 통계적 다중화(statistical multiplexing) 기법을 사용하므로 망을 통한 트래픽 흐름을 적절히 관리하지 못하면 혼잡(congestion), 셀 손실, 망의 성능 저하 등을 야기하게 된다. 이러한 상황을 예방하고 셀의 도착 시간 버스트(burstiness)를 줄이며 셀 손실 특성을 개선하여 망의 성능을 증가시키기 위하여, 트래픽의 형태 제어 방법을 제안한다. 트래픽 형태 제어 파라미터 값의 역전파 신경망을 적용하여 예측되며, 이 예측된 값들에 의해 형태 제어 방법을 수행한다. 제안된 형태 제어 기법의 성능은 Poisson 트래픽 입력에 대한 컴퓨터 시뮬레이션에 의해 얻어지며, 멀티플렉서에서의 최대 버퍼 크기를 측정하여 성능을 평가하였다.

• The Journal of Natural Sciences
• /
• v.8 no.2
• /
• pp.83-91
• /
• 1996

We first obtain the departure process of a D-BMAP/Geo/1/K queue. The departure process is then exactly characterized by a k-state MMBP in order to capture the burstiness and correlation of the departure process.

• Proceedings of the Korea Society for Simulation Conference
• /
• 1999.04a
• /
• pp.1-5
• /
• 1999

An ATM switch is the basic component of an ATM network, and its functioning is to switch incoming cells arriving at an input port to the output port associated with an appropriate virtual path. In case of an ATM switch with buffer sharing scheme, the performance analysis is very difficult due to the interactions between the address queues. In this paper, the influences of the degree of traffic burstiness and some traffic routing properties are investigated by using the simulation. Also, some cell access strategies including priority access and cell dropping are compared in terms of cell loss probability.

• Proceedings of the Korea Society for Simulation Conference
• /
• 1999.10a
• /
• pp.62-62
• /
• 1999

In this paper, we propose a new technique of estimating tail of steady-state queue length distribution; Pr(Q>q), fo ATM multiplexer. Pr(Q>q) is a fundamental measure of network congestion. Assessing Pr(Q>q) properly is crucial for design and control of ATM networks. Data traffic pattern of high-speed networks is highly correlated and bursty. Estimating Pr(Q>q) is very difficult because of correlation and burstiness. We estimate entropy(rate-function) using large deviation principles and threshold bootstrap. Simulation studies are conducted to compare the performance of an existing method and our new method.

• The KIPS Transactions:PartC
• /
• v.12C no.6 s.102
• /
• pp.855-864
• /
• 2005

In this paper, we propose an intrusion detection system(IDS) architecture which can detect and respond against the generation of abnormal traffic such as malicious code and Internet worms. We model the system, design and implement a simulator using OPNET Modeller, for the performance analysis on the response capacity of alert information in the proposed system. At first, we model the arrival process of alert information resulted from abnormal traffic. In order to model the situation in which alert information is intensively produced, we apply the IBP(Interrupted Bernoulli Process) which may represent well the burstiness of traffic. Then we perform the simulation in order to gain some quantitative understanding of the system for our performance parameters. Based on the results of the performance analysis, we analyze factors which may hinder in accelerating the speed of security node, and would like to present some methods to enhance performance.

• Journal of Internet Computing and Services
• /
• v.9 no.4
• /
• pp.61-68
• /
• 2008

Ethernet passive optical network (EPON) is the next-generation technology mitigating the bottleneck between high-capacity local area networks (LANs) and a backbone network. The bottleneck is aggrevated depending on burstiness and long range dependence (LRD) of traffic characteristics as well as amount of outgoing traffic from the high-capacity LANs. The proposed scheme decreases average packet delay for data upstreaming by considering such traffic characteristics to dynamically allocate bandwidth to multiple optical network units (ONUs). In addition, it can appropriately support delay-sensitive traffic such as constant bit ratio (CBR) traffic by making maximum cycle time fix regardless of the number of ONUs. The comprehensive simulation results indicate that the proposed scheme acheives up to 77% and 82% lower than previous schemes in terms of average packet delay and average queue size while it limits the maximum cycle time to twice of the basic cycle time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.12C
• /
• pp.1207-1214
• /
• 2002

A scheduling scheme for high speed networks requires a low time complexity to schedule packets in a packet transmission time. High speed networks support a number of connections, different rates for each connection and variable packet length. Conventional round robin algorithms have a time complexity of O(1), but their short time fairness, latency and burstiness depend on the quantum of a connection due to serving several packets for a backlogged connection once a round. To improve these properties, we propose in this paper an efficient packet scheduling scheme which is based on the credits of a connection and has a time complexity of O(1). We also analyzed its performance in terms of short time fairness, latency and burstiness. The analysis results show that the proposed scheme can improve the performance compared with traditional round robin schemes. The proposed scheme can be easily utilized in high speed packet networks.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.5
• /
• pp.667-676
• /
• 1995

In ATM traffic multiplexing, the cell clumping and the cell dispersion are occured due to the cell delay variance(CDV) which changes the traffic characteristics. These cell variances increase the burstiness of t.he cell streams and make the network congested. The function of the traffic shaping is necessary to transmit the input streams into the networks or into the traffic policing schemes with some intevals. Most of the existing studies regard the input traffics as the traffic with the identical characteristics. In this study, the traffic shaping is processed by considering the traffic characteristICS with t.he loss-sensitive traffic and the delay-sensitive traffic. The traffic shaping model and the traffic shaping algorithm which considers the" characteristics of input streams have been presented. The traffic effect On t.he CDV size is also studied. The proposed scheme is compared to Virtual Scheduling Algorithm(VSA) and the efficiency of the proposed scheme is evaluated. According to the simulation results, t.he mean delay is decreased about 12% in delay-sensitive traffic and the traffic burstiness is decreased about 11 % in loss-sensitive traffic.