• 한국시뮬레이션학회논문지
• /
• 제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}$.

• Journal of applied mathematics & informatics
• /
• 제12권1_2호
• /
• pp.395-408
• /
• 2003

Common Channel Signaling(CCS) networks need special controls to avoid overload of signaling networks and degradation of call process-ing rate, since they play an important role of controlling communication transfer networks. Congestion control and flow control mechanisms are well described in ITU-T recommendation on Signaling System No.7(SS7). For the practical provisions, however, we need an analysis on the relation among service objects, system requirements and implementation of congestion control algorithms. SS7 provides several options for controlling link congestion in CCS networks. In this paper we give a general queueing model of congestion control algorithm which covers both the international and national options. From the queuing model, we obtain the performance parameters such as throughput, message loss rate and mean delay for the international option. To show the performance of the algorithm, some numerical results are also given.

• 한국통신학회논문지
• /
• 제24권10B호
• /
• pp.1971-1978
• /
• 1999

본 논문에서는‘shifting-level (SL) process’을 기초로 한 모델을 사용하여, VBR 부호화된 영상트래픽의 long-range dependence (LRD) 특성이 대기체계에 미치는 영향에 대해서 연구하였다. 연구 내용은 제1부와 제2부로 나누어 전개된다. 제 1부에서는 실제 영상트래픽의 자기상관함수가 exponential과 hyperbolic의 복합함수로 매우 정확히 표현될 수 있음을 보이고, 이러한 조건을 만족하는 SL process with compound correlations(SLCC)를 제안한다. 대표적인 SRD 모델인 DAR(1)모델과의 대기성능 비교를 통하여 hyperbolic한 상관도가 대기체계에 끼치는 영향을 분석한다. 분석결과 영상의 LRD 특성이 대기체계에 끼치는 영향의 중요도는 단순히‘Yes/No’로 답할 수 없으며, 트래픽 부하가 높아지면 그 영향이 강하게 나타나고, 반대로 트래픽 부하가 낮은 경우에는 무시할 수 있을 정도로 약하게 나타남을 알 수 있다. 여기에 사용하는 SL/D/1/K 대기체계의 해석방법을 제2부에서 다루게 된다.

• 대한산업공학회지
• /
• 제14권1호
• /
• pp.17-30
• /
• 1988

The aim of this project is to analyze the queueing model with the two types of customers which either can wait unrestrictedly or wait restrictively in the system depending on the condition of service facility unless they may be served immediately. This model consists of the three-dimensional state space and then quasi birth-death process is formulated. The steady-state probabilities and measures of performance of this system are derived by using Matrix Geometric method.

• 한국산업정보학회논문지
• /
• 제9권3호
• /
• pp.32-37
• /
• 2004

This paper investigates the mathematical model of multi-server retrial queueing system with the Batch Markovian Arrival Process (BMAP), the Phase type (PH) service distribution and the finite buffer. The sufficient condition for the steady state distribution existence and the algorithm for calculating this distribution are presented. Finally, a formula to solve loss probability in the case of complete admission discipline is derived.

• 한국경영과학회지
• /
• 제22권2호
• /
• pp.45-65
• /
• 1997

We build a queueing model for buffered leaky bucket system. First, we set up system equations and them calculate the steady-state probabilities at an arbitrary time epoch by recursive method. We derive the mean waiting time and the mean number of cells in the input buffer, and evaluate the performance of the buffered leaky bucket system to find the optimal queue capacity and token generation rate that meet the quality of service(QoS).

• 한국시뮬레이션학회:학술대회논문집
• /
• 한국시뮬레이션학회 2001년도 The Seoul International Simulation Conference
• /
• pp.359-364
• /
• 2001

In this study, we try to improve the accuracy of QN-GPH by the help of simulation approach. We first establish an estimation method for GPH distributions with sufficient accuracy based on empirical distribution, and then perform a brief trial run to find appropriate empirical distributions. After getting GPH form of distributions, we continue the QN-GPH analytic steps and compute necessary performance measures. We apply the method to find sojourn time distributions in a 8-node queueing system and compare the results with the whole simulation and the original two-parametric approximation.

• 한국경영과학회지
• /
• 제36권3호
• /
• pp.45-59
• /
• 2011

OFDMA systems have been expected to be widely used to provide multimedia services over wireless channels. To evaluate performance of the OFDMA system, power should be considered as system resource as well as subcarriers. This study propose a queueing traffic model incorporating two kinds of resources (power and subcarriers), and an extended model giving a priority to handoff calls over new calls. Some extensive experiments are conducted to illustrate the usefulness of the proposed traffic model.

• Journal of Electrical Engineering and information Science
• /
• 제2권6호
• /
• pp.56-63
• /
• 1997

Under most system assumptions, closed form solutions of performance measures for ATM switches with input queueing are not available. In this paper, we present expressions and bounds for the derivatives of cell loss probabilities with respect to the arrival rate evaluated at a zero arrival rate. These bounds are used to give an approximation by Taylor expansion, thereby providing an economical way to estimate cell loss probabilities in light traffic.

• Journal of Communications and Networks
• /
• 제3권4호
• /
• pp.383-395
• /
• 2001

Recent measurement and simulation studies have revealed that wide area network traffic displays complex statistical characteristics-possibly multifractal scaling-on fine timescales, in addition to the well-known properly of self-similar scaling on coarser timescales. In this paper we investigate the performance and network engineering significance of these fine timescale features using measured TCP anti MPEG2 video traces, queueing simulations and analytical arguments. We demonstrate that the fine timescale features can affect performance substantially at low and intermediate utilizations, while the longer timescale self-similarity is important at intermediate and high utilizations. We relate the fine timescale structure in the measured TCP traces to flow controls, and show that UDP traffic-which is not flow controlled-lacks such fine timescale structure. Likewise we relate the fine timescale structure in video MPEG2 traces to sub-frame encoding. We show that it is possibly to construct a relatively parsimonious multi-fractal cascade model of fine timescale features that matches the queueing performance of both the TCP and video traces. We outline an analytical method ta estimate performance for traffic that is self-similar on coarse timescales and multi-fractal on fine timescales, and show that the engineering problem of setting safe operating points for planning or admission controls can be significantly influenced by fine timescale fluctuations in network traffic. The work reported here can be used to model the relevant characteristics of wide area traffic across a full range of engineering timescales, and can be the basis of more accurate network performance analysis and engineering.