1998 | OriginalPaper | Buchkapitel
The Queue GI/G/1
verfasst von : N. U. Prabhu
Erschienen in: Stochastic Storage Processes
Verlag: Springer New York
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
We consider the single-server queueing system where successive customers arrive at the epochs t0 (= 0), t1, t2,... and demand services times v1, v2,.... The interarrival times are then given by u n = t n — t n-1 (n≥1). Let Xk = Vk — uk (k ≥ 1), and So = 0, S n = X 1 +X 2 + … + X n (n ≥ 1). We assume that the Xkare mutually independent random variables with a common distribution; the basic process underlying this queueing model is the random walk {Sn}. To see this, let Wn be the waiting time of the nth customer and I n the idle period (if any) that just terminates upon the arrival of this customer. Then clearly for n≥ 01$$ W_{n + 1} = \left( {X_{n + 1} + W_n } \right)^ + , I_{n + 1} = \left( {X_{n + 1} + W_n } \right)^ - $$.