• Title/Summary/Keyword: queueing modeling

Search Result 62, Processing Time 0.024 seconds

Optimization of Buffers Capacity in Tandem Queueing Systems with Batch Markovian Arrivals Process

  • Kim, Che-Soong;Lee, Seok-Jun
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.12 no.2
    • /
    • pp.16-23
    • /
    • 2007
  • Tandem queueing systems well suit for modeling many telecommunication systems. Recently, very general $BMAP/G/1/N/1{\to}{\bullet}/PH/1/M-1$ type tandem queues were constructively studied. In this paper we illustrate application of the obtained results for optimization of a buffer pool design.

  • PDF

Modeling Optimal Lane Configuration at the Toll Plaza by Nonlinear Integer Programming Incorporated with an M/G/1 Queueing Process

  • Kim, Seong-Moon
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2006.11a
    • /
    • pp.403-406
    • /
    • 2006
  • This paper provides an M/G/1 queueing model for the operations management problem at the toll plaza. This queueing process is incorporated with two non-linear integer programming models - the user cost minimization model during the peak times and the operating cost minimization model during the off-peak hours.

  • PDF

Knowledge-Based Approach for Computer-Aided Simulation Modeling (컴퓨터에 의해 수행되어지는 시뮬레이션 모델링을 위한 지식베이스 접근방법)

  • Lee, Young-Hae;Kim, Nam-Young
    • IE interfaces
    • /
    • v.2 no.2
    • /
    • pp.51-62
    • /
    • 1989
  • A computer-aided simulation modeling system has been developed to allow the automatic construction of complete discrete simulation models for queueing systems. Three types of knowledge are used in the specification and construction of a simulation modeling: Knowledge of queueing system, simulation modeling, and a target simulation language. This knowledge has been incorporated into the underlying rule base in the form of extraction and construction rule, and implemented via the expert system building tool, OPS5. This paper suggested a knowledge based approach for automatic programming to enable a user who lacks modeling knowledge and simulation language expertize to quickly build executable models.

  • PDF

Effect of First and Second Order Channel Statistics on Queueing Performance (채널의 1차 2차 통계적 특성이 큐의 성능에 미치는 영향)

  • Kim, Young-Yong
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.8 no.4
    • /
    • pp.288-291
    • /
    • 2002
  • We characterize multipath fading channel dynamics at the packet level and analyze the corresponding data queueing performance in various environments. We identify the similarity between wire-line queueing analysis and wireless network per-formance analysis. The second order channel statistics, i.e. channel power spectrum, is fecund to play an important role in the modeling of multipath fading channels. However, it is identified that the first order statistics, i.e. channel CDF also has significant impact on queueing performance. We use a special Markov chain, so-called CMPP, throughout this paper.

Transient Queueing Approximation for Modeling Computer Networks (컴퓨터 통신망의 모델링을 위한 비정상 상태에서의 큐잉 근사화)

  • Lee, Bong-Hwan
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.32A no.4
    • /
    • pp.15-23
    • /
    • 1995
  • In this paper, we evaluate the performance of a transient queueing approximation when it is applied to modeling computer communication networks. An operational computer network that uses the ISO IS-IS(Intermediate System-Intermediate System) routing protocol is modeled as a Jackson network. The primary goal of the approximation pursued in the study was to provide transient queue statistics comparable in accuracy to the results from conventional Monte Carlo simulations. A closure approximation of the M/M/1 queueing system was extended to the general Jackson network in order to obtain transient queue statistics. The performance of the approximation was compared to a discrete event simulation under nonstationary conditions. The transient results from the two simulations are compared on the basis of queue size and computer execution time. Under nonstationary conditions, the approximations for the mean and variance of the number of packets in the queue erer fairly close to the simulation values. The approximation offered substantial speed improvements over the discrete event simulation. The closure approximation provided a good alternative Monte Carlo simulation of the computer networks.

  • PDF

An Analysis of Stochastic Network${\cdot}$Using Q-GERT (Q-GERT를 이용한 확률적 네트워크의 분석)

  • Kang, Suk-Ho;Kim, Won-Kyung
    • Journal of the military operations research society of Korea
    • /
    • v.5 no.1
    • /
    • pp.155-162
    • /
    • 1979
  • GERT modeling is in a dynamic stage of development. One of the most exciting and useful new developments in GERT modeling and Simulation is the modeling technology and computer package called Q-GERT. As the name implies, this provides the capability to analyze complex networks of queueing systems. The modeling approach is quite similar to GERT, but includes queue nodes called 'Select' nodes, which allow a considerable amount of logic to be included in the analysis of complex networks of multichannel, multiphase queueing systems should find the Q-OERT package of considerable interest.

  • PDF

A Performance Evaluation of Fully Asynchronous Disk Array Using Simulation Method (시뮬레이션 기법을 이용한 완전 비동기 디스크 어레이 성능 평가)

  • 오유영
    • Journal of the Korea Society for Simulation
    • /
    • v.8 no.2
    • /
    • pp.29-43
    • /
    • 1999
  • As real-time processing of data with large storage space is required in the era of multimedia, disk arrays are generally used as storage subsystems which be able to provide improved I/O performance. To design the cost-effective disk array, it is important to develop performance models which evaluate the disk array performance. Both queueing theory and simulation are applicable as the method of performance evaluation through queueing modeling. But there is a limit to the analytical method using queueing theory due to the characteristics of disk array requests being serviced in the parallel and concurrent manner. So in this paper we evaluate the disk array performance using simulation method which abstract disk array systems in the low level. Performance results were evaluated through simulation, so that mean response time, mean queueing delay, mean service time, mean queue length for disk array requests and utilization, throughput for disk array systems, can be utilized for capacity planning in the phase of disk array design.

  • PDF

A Performance Modeling of Wireless Sensor Networks as a Queueing Network with On and Off Servers

  • Ali, Mustafa K. Mehmet;Gu, Hao
    • Journal of Communications and Networks
    • /
    • v.11 no.4
    • /
    • pp.406-415
    • /
    • 2009
  • In this work, we consider performance modeling of a wireless sensor network with a time division multiple access (TDMA) media access protocol with slot reuse. It is assumed that all the nodes are peers of each other and they have two modes of operation, active and sleep modes. We model the sensor network as a Jackson network with unreliable nodes with on and off states. Active and sleep modes of sensor nodes are modeled with on and off states of unreliable nodes. We determine the joint distribution of the sensor node queue lengths in the network. From this result, we derive the probability distribution of the number of active nodes and blocking probability of node activation. Then, we present the mean packet delay, average sleep period of a node and the network throughput. We present numerical results as well as simulation results to verify the analysis. Finally, we discuss how the derived results may be used in the design of sensor networks.

A Study on Modeling of FMS using Closed Queueing Network (폐쇄형 대기행렬 네트워크에 의한 FMS 모델링)

  • Jeong, Seok-Chan;Cho, Kyu-Kab
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.21 no.2
    • /
    • pp.153-165
    • /
    • 1995
  • Many closed queueing network models have been used as an effective tool to make a preliminary design of FMS. Although a loading/unloading function is an important factor to effect the utilization and throughput of FMS as well as a transfer function and a processing function, the Solberg's model did not clarify the loading/unloading function. In this paper, we propose a closed queueing network model for analyzing a flexible manufacturing system that consists of a load/unload station, a material handling system and a group of workstations for processing jobs, and define the expected utilization and the expected throughput of the FMS. As applications of the proposed model, the cases of a material handling system consisting of a conveyor and the FMS including an inspection station are also formulated.

  • PDF

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