• 한국정보과학회논문지:정보통신
• /
• 제29권2호
• /
• pp.181-187
• /
• 2002

Connection admission control(CAC), which decides whether or not to accept a new call request, is one of the most Important preventive congestion control techniques in asynchronous transfer mode(ATM) networks. To develop a practical CAC scheme, first we propose a "Modified Cell Loss Probability MP${\nu}"$, which is based on "Virtual Cell Loss Probability P${\nu}"$, taking into account mean burst duration of input traffic source and buffer size in ATM networks. MP${\nu}"$ computes more accurate cell loss probability than P${\nu}"$ without increasing computational complexity, since P${\nu}"$ is formulated simply form the maximum and the average cell rate of input traffic. P${\nu}"$ is overestimated as compared to the real cell loss probability when the mean burst duration is relatively small to the buffer capacity. Then, we Propose a CAC scheme, based on "Modified Virtual Bandwidth(MVB)" method, which may individualize the cell loss probabilities in heterogeneous traffic environments. For the proposed approach, we define the interference intensity to identify interferences between heterogeneous traffic sources and use it as well as MP${\nu}"$ to compute MVB. Our approach is well suitable for ATM networks since it provides high bandwidth utilization and guarantees simple and real time CAC computation for heterogeneous traffic environments.heterogeneous traffic environments.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 1996년도 춘계공동학술대회논문집; 공군사관학교, 청주; 26-27 Apr. 1996
• /
• pp.543-546
• /
• 1996

Recently, some research has been done to analyze the asymptotic behavior of queue length distribution in ATM (Asynchronous Transfer Mode) multiplexer. In this paper, we relate this asymptotic behavior with the asymptotic behavior of decreasing cell loss probability when the buffer capacity is increased. We find with reasonable assumptions that the asymptotic rate of queue length distribution is the same as that of decreasing cell loss probability. Even under different priority control schemes and traffic classes, we find that this asymptotic rate of the individual cell loss probability of each traffic class does not change. As a consequence, we propose the upper bound of cell loss probability of each traffic class when a priority control scheme is employed. This bound is computationally feasible in a real-time. The numerical examples will be provided to validate this finding.

• 한국통신학회논문지
• /
• 제18권6호
• /
• pp.779-792
• /
• 1993

ATM망의 스위칭 노드나 ATM멀티플랙서에서는 셀의 헤더내에 있는 1-비트의 CLP(Cell Loss Priority)를 사용하여 우선순위 제어를 함으로써 대역폭의 사용효율을 높인다. 본 논문에서는 기존 공간 우선순위 제어(space priority control) 메카니즘들의 단점들을 보완하고 높은 우선순위 셀의 손실 확률을 줄이기 위한 혼합형 메커니즘을 제안하며 이 메커니즘에 대한 성능을 셀 손실 확률면에서 분석하였다. 제안한 혼합형 메카니즘의 성능 평가는 우선순위 제어가 없는 메카니즘, 축출 메카니즘 및 부분버퍼공유 메카니즘에 대한 셀 손실 확률을 비교하였다. 셀 손실 확률은 M/D/1/N모델링과 2-state MMPP/D/1/N모델링을 사용하여 해석하였으며 이 두 가지 모델링에 대한 비교도 병행하였다. 각 메카니즘에 대한 해석값은 PC의 SIMSCRIPT II.5를 이용한 컴퓨터 시뮬레이션으로 검증하였다.

• 한국시뮬레이션학회논문지
• /
• 제8권4호
• /
• pp.1-8
• /
• 1999

This paper proposes an ATM switch architecture called Output Queued Batcher-Banyan switch (OQBBS). It consists of a Sorting Module, Expanding Module, and Output Queueing Modules. The principles of channel grouping and output queueing are used to increase the maximum throughput of an ATM switch. One distinctive feature of the OQBBS is that multiple cells can be simultaneously delivered to their desired output. The switch architecture is shown to be modular and easily expandable. The performance of the OQBBS in terms of throughput, cell delays, and cell loss rate under uniform random traffic condition is evaluated by computer simulation. The throughput and the average cell delay are close to the ideal performance behavior of a fully connected output queued crossbar switch. It is also shown that the OQBBS meets the cell loss probability requirement of $10^{-6}$.

• 한국통신학회논문지
• /
• 제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.

• 한국통신학회논문지
• /
• 제33권5A호
• /
• pp.517-525
• /
• 2008

본 논문은 균일한 도심지역에서의 CDMA 시스템의 상향링크에 대하여 송신전력, 간섭전력 및 블로킹 확률 등을 최소화하는데 기지국 배치에 따라 결정되는 셀 모양의 효과를 분석하기 위하여 시스템 수준의 모의실험이 이루어진다. 도심 마이크로 셀에서 기지국에 대한 경로 손실은 단말이 위치한 거리의 방향성에 영향을 받는다. 단말로부터 기준 기지국에 대한 간섭은 2차 Tier까지 고려된다. 간섭 계산의 정확성에 대한 손실 없이 계산 복잡도를 줄이기 위한 방법으로Wrap around method가 사용된다. 모의실험 결과는 송신전력, 간섭전력 및 블로킹 확률 등이 효율적인 기지국 배치에 따른 셀의 모양에 따라 줄어들 수 있음을 보여준다.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 1995년도 춘계공동학술대회논문집; 전남대학교; 28-29 Apr. 1995
• /
• pp.435-444
• /
• 1995

We propose a new approach to the calculation of the exact cells loss probability in a shared buffer ATM multiplexer, which is loaded with homogeneous discrete-time ON-OFF sources. Renewal cycles are identified in regard to the state of input sources and the buffer state on each renewal circle is modelled as a K(shared buffer size)-state Markov chain. We also analyze the behavior of queue build-up at the shared buffer whose distribution together with the steady-state probabilities of the Markov chain leads to the exact cell loss probability. Our approach to obtaining the exact cell loss probability seems to be more efficient than most of other existing ones since our underlying Markov chain has less number of states.

• 한국경영과학회지
• /
• 제21권3호
• /
• pp.47-61
• /
• 1996

An ATM switch must deal with various kinds of input sources having different traffic characteristics and it must guarantee very small value of cel loss probability, about 10$^{8}$ -10$^{12}$ , to deal with loss-sensitive traffics. In order to estimate such a rate event probability with simulation procedure, a variance reduction technique is essential for obtaining an appropriate level of precision with reduced cost. In this paper, we propose a hybrid simulation technique to achieve reduction of variance of cell loss probability estimator, where hybrid means the combination of analytical method and simulation procedure. A discrete time queueing model with multiple input sources and a finite shared buffer is considered, where the arrival process at an input source and a finite shared buffer is considered, where the arrival process at an input source is governed by an Interrupted Bernoulli Process and the service rate is constant. We deal with heterogeneous input sources as well as homogeneous case. The performance of the proposed hybrid simulation estimator is compared with those of the raw simulation estimator and the importance sampling estimator in terms of variance reduction ratios.

• 한국통신학회논문지
• /
• 제21권3호
• /
• pp.629-642
• /
• 1996

ATM switch handles the traffic for a wide range of appliations with different QOS(Quality-of-Service) requirements. In ATM switch, the priority control mechanism is needed to improve effectively the required QOS requirements. In this paper, we propose a priority control mechanism using the cell transfer ratio type and discard threshold in order to archive the cell loss probability requirement and the delay requirement of each service class. The service classes of our concern are the service class with high time priority(class 1) and the service class with high loss priority control mechanism, cells for two kind of service classes are stored and processed within one buffer. In case cells are stored in the buffer, cells for class 2 are allocated in the stored and processed within one buffer. In case cells are stored in the buffer, cells for class 2 are allocated in the shole range of the buffer and cells for class 1 are allocated up to discard threshold of the buffer. In case cells in the buffer are transmitted, one cell for class 1 is transmitted whenever the maximum K cells for class 2 are transmitted consecutively. We analyze the time delay and the loss probability for each class of traffic using Markov chain. The results show that the characteristics of the mean cell delay about cells for class 1 becomes better and that of the cell loss probability about cells for class 2 becomes better by selecting properly discard threshold of the buffer and the cell transfer ratio according to the condition of input traffic.

• 한국통신학회논문지
• /
• 제22권4호
• /
• pp.855-869
• /
• 1997

In this paper, we proposed two kids of dynamic priority control mechanisms controlling the cell service ratio in order to improve the QOS(Quality of Service). We also analyse theoretically the characteristics of cell loss probability and mean cell delay time by applying the proposed priority control mechanisms to ATM switch with output buffer. The proposed priority control mechanisms have the same principles of storing cells into buffer but the different principles of serving cells from buffer. The one is the control mechanism controlling the cell service ratio according to the relative cell occupancy ratio of buffer, the other is the control mechanism controlling the cell service ratio according to both the relative cell occupancy ratio of buffer and the average arrival rate. The two service classes of our concern are the delay sensitive class and the loss sensitive class. The analytical results show that the proposed control mechanisms are able to improve the QOS, the characteristics of cell loss probability and mean cell delay time, by selecting properly the relative cell occupancy ratio of buffer and the average arrival rate. conventional DLB algorithm does not support synchronous cells, but the proposed algorithm gives higher priority to synchronous cells. To reduce synchronous cell loss rate, the synchronous cell detector is used in the proposed algorithm. Synchronous cell detector detects synchronous cells, and passes them cells to the 2nd Leaky-Bucket. So it is similar to give higher priority to synchronous cells. In this paper, the proposed algorithm used audio/video traffic modeled by On/Off and Two-state MMPP, and simulated by SLAM II package. As simulation results, the proposed algorithm gets lower synchronous cell loss rate than the conventional DLB algorithms. The improved DLB algorithm for multimedia synchronization can be extended to any other cells which require higher priority.