Open Networks of Exponential Queues

Moshe Haviv
Additional contact information
Moshe Haviv: The Hebrew University

Chapter Chapter 9 in Queues, 2013, pp 139-150 from Springer

Abstract: Abstract Part of the model described here coincides with the one described in Example 9 in Chap. 8. For the sake of completeness we start here from scratch. Suppose M single-server service stations are located in a network. To station i there requires an external Poisson arrival process with rate λ i , 1 ≤ i ≤ M. Each time a job visits station i it requires a service of a length that follows an exponential distribution with parameter μ i , 1 ≤ i ≤ M. In each station service a job is provided on a first-come first-served (FCFS) basis1. Once a job completes its service in station i, it moves to station j with probability P ij .

Keywords: Exponential Queueing; First-come First-served (FCFS); Time-reversed Process; Partial Balance Equations; Arrival Theorem (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:isochp:978-1-4614-6765-6_9

Ordering information: This item can be ordered from
http://www.springer.com/9781461467656

DOI: 10.1007/978-1-4614-6765-6_9

Access Statistics for this chapter

More chapters in International Series in Operations Research & Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().