Finite Buffer Polling Models with Routing

Abstract

This paper analyzes a finite buffer polling system with routing. Finite buffers are used to model the limited capacity of the system, and routing is used to represent the need for additional service. the most significant results of the analysis are the derivation of the generating function for queue length when buffer sizes are limited and a representation of the system workload. the queue lengths at polling instants are determined by solving a system of recursive equations; an embedded Markov chain analysis and numerical inversion are used to derive the queue length distributions. This system may be used to represent production models with setups and lost sales or expediting.

Department(s)

Engineering Management and Systems Engineering

Keywords and Phrases

Polling; Queueing; Routing; Setups

International Standard Serial Number (ISSN)

0377-2217

Document Type

Article - Journal

Document Version

Citation

File Type

text

Language(s)

English

Rights

© 2005 Elsevier, All rights reserved.

Publication Date

01 Jan 2005

Link to Full Text

Share

 
COinS