An Analytical Approximation for the Throughput of a Closed Fork/Join Network with Multi-Station Input Subnetworks

نویسندگان

  • Erkut Sönmez
  • Alan Scheller-Wolf
  • Nicola Secomandi
  • David A. Tepper
چکیده

Fork/join stations are used for modeling synchronization between entities, and fork/join queueing networks are natural models for a variety of communication and manufacturing systems: Parallel computer networks, fabrication/assembly systems, supply chains and material control strategies for manufacturing systems. Exact solutions of general fork/join networks can only be obtained by using numerical methods to analyze the underlying Markov chains. However, this method is computationally feasible only for networks with small population size and number of stations. In this paper, we present a simple approximation method to estimate the throughput of a closed queueing network that features a single fork/join station receiving inputs from multi-station subnetworks. Our technique uses aggregation to estimate the arrival process from input subnetworks. Given the estimated arrival process, we then derive closed form approximate expression for the network throughput by analyzing a simplified Markov chain. A numerical study shows that the proposed approximation is fairly effective, particularly for large network sizes.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Analytical Throughput Approximation for Closed Fork/Join Networks

Queueing networks featuring fork/join stations are natural models for a variety of computer and manufacturing systems, including parallel computer networks, fabrication/assembly systems, supply chains and material control strategies. Unfortunately, an exact solution for a Markovian fork/join network can only be obtained by analyzing the underlying Markov chain using numerical methods and these ...

متن کامل

Two Moment Approximations for Fork/Join Stations with Applications to Modeling Kanban Systems

In queuing models of kanban systems, fork/join stations are used to model the synchronization constraints between parts and kanbans. Efficient analysis of these fork/join stations is quite crucial to analytical performance evaluation of kanban systems. Exact analysis of the fork/join station can be difficult especially if the input processes have general characteristics. We propose a new method...

متن کامل

Analysis of a Fork/Join Synchronization Station with Inputs from Coxian Servers in a Closed Queuing Network

Fork/join stations are commonly used to model the synchronization constraints in queuing models of computer networks, fabrication/assembly systems and material control strategies for manufacturing systems. This paper presents an exact analysis of a fork/join station in a closed queuing network with inputs from servers with two-phase Coxian service distributions, which models a wide range of var...

متن کامل

Approximations for a Fork/Join Station with Inputs from Finite Populations

Fork/join stations model synchronization constraints in queuing network models of many manufacturing and computer systems. We consider a fork/join station with two input buffers and general inputs from finite populations and derive approximate expressions for throughput and mean queue lengths at the input buffers. We assume that the arrivals to the fork/join stations are renewal, but our approx...

متن کامل

A Decomposition Procedure for the Analysis of a Closed Fork/Join Queueing System

.-\.0. iterative approximation algorithm for analyzing a closed queueing system with a K-sibling fork/ join queue is presented. The iterative procedure is based on a combination of nearly complete decomposability and the Gauss-Seidel method. The approximation procedure gives good results for the mean response time and the system throughput. However, it gives results which are an upper bound of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009