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
    Strong approximations for priority queues; head-of-the-line-first discipline (1992)
    Springer
    Queueing systems 10 (1992), S. 213-233 
    Details
    ISSN: 1572-9443
    Keywords: Priority queue ; strong approximation ; Wiener process
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract In this paper, we obtain strong approximation theorems for a single server queue withr priority classes of customers and a head-of-the-line-first discipline. By using priority queues of preemptive-resume discipline as modified systems, we prove strong approximation theorems for the number of customers of each priority in the system at timet, the number of customers of each priority that have departed in the interval [0,t], the work load in service time of each priority class facing the server at timet, and the accumulated time in [0,t] during which there are neither customers of a given priority class nor customers of priority higher than that in the system.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01159207
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    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
  • 3
    Electronic Resource
    Electronic Resource
    Heavy traffic limit theorems for a sequence of shortest queueing systems (1995)
    Springer
    Queueing systems 21 (1995), S. 217-238 
    Details
    ISSN: 1572-9443
    Keywords: Queueing system ; heavy traffic ; reflecting Brownian motion ; weak convergence
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract A sequence of shortest queueing systems is considered in this paper. We give weak convergence theorems for the queue length and waiting time processes when the sequence of traffic intensities associated with the sequence of shortest queueing systems approaches the critical value (ρ=1) at appropriate rates.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01158582
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    A survey of queueing theory (1990)
    Springer
    Annals of operations research 24 (1990), S. 29-43 
    Details
    ISSN: 1572-9338
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract This paper is intended to give a survey of the main results of queueing theory in China. It consists of five parts: (1) the transient behaviour of typical queueing systems; (2) classical problems; (3) approximation theory; (4) model structure; (5) applications.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02216814
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 5
    Electronic Resource
    Electronic Resource
    Transient solutions for multidimensional denumerable state Markov processes (1996)
    Springer
    Queueing systems 23 (1996), S. 317-329 
    Details
    ISSN: 1572-9443
    Keywords: Transient solutions ; multidimensional denumerable state Markov process ; uniformization technique ; uniform error
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract The computational problem of transient solutions for denumerable state Markov Processes (MP's) has been solved by Hsu and Yuan [12], who derived an efficient algorithm with uniform error. However, when the state space of an MP is of two or more dimensions, even for computational methods dealing with stationary solutions, only the case where one of the dimensions is infinite and all the others are finite has been studied. In this paper, we study transient solutions for multidimensional denumerable state MP's and give an algorithm with uniform error. Some numerical results are presented.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01206564
    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...