Section 11.5

G/G/1

[3/100%]
Show
LaTeX
Problem 11.5.1

Show that, for a G/G/1G / G / 1 queue, the starting times of the busy periods of the server constitute a renewal process.

?
Problem 11.5.2

Consider a G/M(μ)/1\mathrm{G} / \mathrm{M}(\mu ) / 1 queue in equilibrium, together with the dual (unstable) M(μ)/G/1\mathrm{M}(\mu ) / \mathrm{G} / 1 queue. Show that the idle periods of the latter queue are exponentially distributed. Use the theory of duality of queues to deduce for the former queue that: (a) the waiting-time distribution is a mixture of an exponential distribution and an atom at zero, and (b) the equilibrium queue length is geometric.

?
Problem 11.5.3

Consider G/M(μ)/1\mathrm{G} / \mathrm{M}(\mu ) / 1, and let GG be the distribution function of S−XS-X where SS and XX are typical (independent) service and interarrival times. Show that the Wiener-Hopf equation

F(x)=∫−∞xF(x−y)dG(y),x≥0 F(x) = \int _{-\infty }^{x} F(x-y) d G(y), \quad x \geq 0

for the limiting waiting-time distribution FF is satisfied by F(x)=1−ηe−μ(1−η)x,x≥0F(x) = 1-\eta e^{-\mu (1-\eta ) x}, x \geq 0. Here, η\eta is the smallest positive root of the equation x=MX(μ(x−1))x = M_{X}(\mu (x-1)), where MXM_{X} is the moment generating function of XX.

?