Fork-join Queue - Stationary Distribution - Heavy Traffic/diffusion Approximation

Heavy Traffic/diffusion Approximation

When the server is heavily loaded (service rate of the queue is only just larger than arrival rate) the queue length process can be approximated by a reflected Brownian motion which converges to the same stationary distribution as the original queueing process.

Read more about this topic:  Fork-join Queue, Stationary Distribution

Famous quotes containing the words heavy and/or traffic:

    “Before the last went, heavy with dew,
    Back to the place from which she came
    Where the bird was before it flew,
    Where the flower was before it grew,
    Where bird and flower were one and the same.”
    —Robert Frost (1874–1963)

    “The two hours’ traffic of our stage.”
    —William Shakespeare (1564–1616)