• Title/Summary/Keyword: queueing performance

Search Result 337, Processing Time 0.026 seconds

Performance Analysis of Output Queued Batcher-Banyan Switch for ATM Network (ATM 망에 적용 가능한 출력단 버퍼형 Batcher-Banyan 스위치의 성능분석)

  • Keol-Woo Yu;Kyou Ho Lee
    • Journal of the Korea Society for Simulation
    • /
    • v.8 no.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}$.

  • PDF

PERFORMANCE ANALYSIS OF CONGESTION CONTROL ALGORITHM IN COMMON CHANNEL SIGNALING NETWORKS

  • Park, Chul-Geun;Ahn, Seong-Joon;Lim, Jong-Seul
    • Journal of applied mathematics & informatics
    • /
    • v.12 no.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.

A Video Traffic Model based on the Shifting-Level Process (Part I : Modeling and the Effects of SRD and LRD on Queueing Behavior) (Shifting-Level Process에 기반한 영상트래픽 모델 (1부: 모델링과 대기체계 영향 분석))

  • 안희준;강상혁;김재균
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.24 no.10B
    • /
    • pp.1971-1978
    • /
    • 1999
  • In this paper, we study the effects of long-range dependence (LRD) in VBR video traffic on queueing system. This paper consists of Part I and II. In Part I, we present a (LRD) video traffic model based on the shifting-level (SL) process. We observe that the ACF of an empirical video trace is accurately captured by the shifting-level process with compound correlation (SLCC): an exponential function in short range and a hyperbolic function in long range. We present an accurate parameter matching algorithm for video traffic. In the Part II, we offer the queueing analysis of SL/D/1/K called ‘quantization reduction method’. Comparing the queueing performances of the DAR(1) model and the SLCC with that of a real video trace, we identify the effects of SRD and LRD in VBR video traffic on queueing performance. Simulation results show that Markoivian models can estimate network performances fairly accurately under a moderate traffic load and buffer condition, whereas LRD may have a significant effect on queueing behavior under a heavy traffic load and large buffer condition.

  • PDF

Analysis of a Queueing System with Two Types of Arrival Patterns (두 종류의 도착형태를 갖는 대기행렬 체계의 분석)

  • Lee, Hwa-Gi;Yun, Eun-Sang
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.14 no.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.

  • PDF

Performance Analysis of a Loss Retrial BMAP/PH/N System

  • Kim Che-Soong;Oh Young-Jin
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.9 no.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.

  • PDF

A Queueing Model for Traffic Control in Leaky Bucket System (Leaky Bucket 시스템에서 트래픽제어에 관한 대기행렬모형)

  • 횡철희;이호우;윤승현;안부용;박노익
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.22 no.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).

  • PDF

A simulation/analytic approach for queueing network analysis

  • Yoon, Bok-Sik
    • Proceedings of the Korea Society for Simulation Conference
    • /
    • 2001.10a
    • /
    • 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.

  • PDF

Queueing Traffic Model of Giving a Priority to Handoff Calls in OFDMA Wireless Communication Systems (핸드오프호를 고려한 OFDMA 무선통신시스템의 확률적 트래픽모형)

  • Paik, Chun-Hyun
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.36 no.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.

Efficient Estimation of Cell Loss Probabilities for ATM Switches with Input Queueing via Light Traffic Derivatives

  • Kim, Young-Beom;Jung Hur
    • Journal of Electrical Engineering and information Science
    • /
    • v.2 no.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.

  • PDF

Distributed Implementation of Delay Guaranteed Fair Queueing(DGFQ) in Multimedia Ad Hoc Wireless Networks (멀티미디어 Ad Hoc 무선망에서 지연시간 보장 공정큐잉(DGFQ)의 분산적 구현)

  • Yang Hyun-Ho
    • The Journal of the Korea Contents Association
    • /
    • v.5 no.4
    • /
    • pp.245-253
    • /
    • 2005
  • The multimedia ad hoc wireless network is quite an attractive issue since it offers a flexible solution to enable delivery of multimedia services to mobile end users without fixed backbone networks. However, with the unique design challenges of ad hoc wireless networks, it is a non-trivial issue to provide bounded delay guarantee, with fair share of resources. In this paper, we proposed distributed implementation of the delay guaranteed fair queueing (DGFQ) scheme in multimedia ad hoc wireless networks. Through the the results of performance evaluation, we can conclude that DGFQ also performs well to control bounded delay in multimedia ad hoc wireless networks.

  • PDF