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:

    With fingers weary and worn,
    With eyelids heavy and red,
    A woman sat, in unwomanly rags
    Plying her needle and thread—
    Stitch! stitch! stitch!
    In poverty, hunger, and dirt,
    Thomas Hood (1799–1845)

    To treat a “big” subject in the intensely summarized fashion demanded by an evening’s traffic of the stage when the evening, freely clipped at each end, is reduced to two hours and a half, is a feat of which the difficulty looms large.
    Henry James (1843–1916)