Trunking Problem

Olavi Hellman
Additional contact information
Olavi Hellman: University of Turku, Turku, Finland

Operations Research, 1964, vol. 12, issue 2, 276-280

Abstract: The infinite system L 1 , L 2 , …, L r , … of parallel channels is receiving traffic by a Poisson input. Each call enters at L 1 , proceeding, if L 1 was occupied, along the line of channels until it arrives at an unoccupied channel. Palm has solved the case of identical exponential channels. In what follows we shall consider identical channels with an arbitrary service-time distribution.

Date: 1964
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.12.2.276 (application/pdf)

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:inm:oropre:v:12:y:1964:i:2:p:276-280

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().