Library

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    The matched queueing network PH/M/c→oPH/PH/1 (1993)
    Springer
    Queueing systems 13 (1993), S. 315-333 
    Details
    ISSN: 1572-9443
    Keywords: Matched queueing network ; Markov process ; PH-renewal process ; PH-distribution ; state probability ; virtual waiting time
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract We consider a matched queueing network PH/M/c→oPH/PH/1, where the output of the first subsystem PH/M/c is regarded as one of the inputs of the second subsystem and matched with another input of PH-renewal process, and they are served by a single server with PH-service-distribution. The stationary state probabilities, the distribution of the virtual waiting times in the two subsystems, and the distribution of the total virtual waiting time are derived.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01149259
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...