• Communications for Statistical Applications and Methods
• /
• 제16권2호
• /
• pp.217-228
• /
• 2009

계층 전이가 가능한 다계층 대기행렬에 대한 빠른 시뮬레이션 방법을 제시하고 이를 이용하여 총 고객의 수가 적정 수준을 초과하는 과부하 발생 확률과 과부하 발생시 각 계층별 평균 고객의 수를 추정한다. 또한 이들 값들이 시스템의 총 로드나 계층별 로드에 따라 어떤 차이를 보이는지도 빠른 시뮬레이션을 통해 서로 비교한다.

• 한국데이터정보과학회:학술대회논문집
• /
• 한국데이터정보과학회 2003년도 추계학술대회
• /
• pp.155-162
• /
• 2003

A tandem network in which all nodes have the same load is considered. We derive bounds on the probability that the total population of the tandem network exceeds a large value by using its relation to the stationary distribution. These bounds imply a stronger asymptotic limit than that in the large deviation theory.

• Journal of the Korean Data and Information Science Society
• /
• 제14권3호
• /
• pp.715-723
• /
• 2003

A tandem network in which all nodes have the same load is considered. We derive bounds on the probability that the total population of the tandem network exceeds a large value by using its relation to the stationary distribution. These bounds imply a stronger asymptotic limit than that in the large deviation theory.

• 한국통신학회논문지
• /
• 제25권4A호
• /
• pp.489-495
• /
• 2000

In this paper we propose an approximate method to estimate the cell loss probability(CLP) due to buffer overflow in ATM networks. The main idea is to relate the buffer capacity with the CLP target in explicit formula by using the approximate upper bound for the tail distribution of a queue. The significance of the proposition lies in the fact that we can obtain the expected CLP by using only the source traffic data represented by mean rate and its variance. To that purpose we consider the problem of estimating the cell loss measures form the statistical viewpoint such that the probability of cell loss due to buffer overflow does not exceed a target value. In obtaining the exact solution we use a typical matrix analytic method for GI/D/1B queue where B is the queue size. Finally, in order to investigate the accuracy of the result, we present both the approximate and exact results of the numerical computation and give some discussion.

• 한국통신학회논문지
• /
• 제21권4호
• /
• pp.952-960
• /
• 1996

In this paper, a new overload control scheme is proposed for a control system in ATM switching system. The proposed control scheme includes a counter that conunts the number of accepted calls and is decreased at cach D time interval. In overload condition of call processor, the control scheme detects over load condition when the counter value reaches a certain threshold value. Under overload condition, processor utilization is measured and the value of the D is updataed according to the difference between measured processor utilization and target utilization. A new call is accepted accepted only if the value of the counter is less than the threshold value. In overflow condition of cell traffic, accept probability of new call is reduced exponetially according to the elapsed time. The results of simulation show that the proposed overload contorl scheme maintains the target utilization very well under the various processor overload conditions and reduces the cell loss probability under the cell overflow conditions.

• 한국통신학회논문지
• /
• 제11권4호
• /
• pp.268-279
• /
• 1986

最近, 미래의 情報化 社會에서 요구되는 새로운 서어비스 제공을 위한 綜合情報 通信網(integrated services digital network: ISDN)의 重要性이 강조되고 있다. 本 論文에서는 ISDN 加入者 返送裝置를 開發함에 있어, 加入者수용 能力을 제고시키기 위하여 11個의 D채널 多重化 裝置의 基本構造를 提示하였으며 이와함께 data traffic intensity, 信號의 到着 및 길이 分布, buffer overflow probability 등을 硏究하여 效率的으로 데이터를 多重化하기 위한 buffer memory size를 統計的으로 산출하였다.

• Communications for Statistical Applications and Methods
• /
• 제14권2호
• /
• pp.287-299
• /
• 2007

We consider a multiclass queue where queued customers are served in their order of arrival at a rate which depends on the customer type. By using the asymptotic results obtained by Dabrowski et al. (2006) we calculate the sharp asymptotics of the stationary distribution of the number of customers of each class in the system and the distribution of the number of customers of each class when the total number of customers reaches a high level before emptying. We also obtain a fast simulation algorithm to estimate the overflow probability and compare it with the general simulation and asymptotic results.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2011년도 한국컴퓨터종합학술대회논문집 Vol.38 No.1(A)
• /
• pp.420-421
• /
• 2011

This paper derive an optimal distributed power control strategy under both the probability of dropping a packet due to buffer overflow constraints at the secondary users and the interference constraints to the primary users.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2004년도 ICCAS
• /
• pp.782-787
• /
• 2004

Internet Engineering Task Force (IETF) has been considering the deployment of the Random Early Detection (RED) in order to avoid the increasing of packet loss rates which caused by an exponential increase in network traffic and buffer overflow. Although RED mechanism can prevent buffer overflow and hence reduce an average values of packet loss rates, but this technique is ineffective in preventing the consecutive drop in the high traffic condition. Moreover, it increases a probability and average number of consecutive dropped packet in the low traffic condition (named as "uncritical condition"). RED mechanism effects to TCP congestion control that build up the consecutive of the unnecessary transmission rate reducing; lead to low utilization on the link and consequently degrade the network performance. To overcome these problems, we have proposed a new mechanism, named as Extended Drop slope RED (ExRED) mechanism, by modifying the traditional RED. The numerical and simulation results show that our proposed mechanism reduces a drop probability in the uncritical condition.

• 한국정보통신학회논문지
• /
• 제13권1호
• /
• pp.67-74
• /
• 2009

본 논문에서는 이동통신 네트워크의 계층 셀 구조에서 음성호와 데이터호의 트래픽을 분산시킴으로서 서비스의 이용성을 개선시키는 방안을 제안한다. 계층 셀 구조의 트래픽 모델을 기술하고, 호 처리에 대한 성능 분석이 수행된다. 본 논문에서 제안된 호 처리 방식에서, 빠른 속도로 이동하는 호는 상위 계층 셀로 이동하여 서비스된다. 오버플로우가 발생하는 경 우에도 호는 상위 계층으로 이동한다. 다른 방식들과 달리, 오버플로우가 발생되어 상위 계층으로 이동한 호는 하위 계층에서 가장 오래 동안 서비스된 호이다. 오버플로우가 발생하여 상위 계층 셀로 이동된 호가 일정시간 이상상위 계층에서 서비스되면, 상위 계층 셀의 한정된 자원을 절약하기 위해 하위 계층으로 호를 이동시킨다. 제안된 방식의 호 처리 성능분석을 위해 M/M/C/K모델을 이용하여 평가하고, 호 블록킹 확률과 강제종료 확률이 개선됨을 보여준다.