5 research outputs found

    Capacity Regions for Network Multiplexers with Heavy-Tailed Fluid On-Off Sources

    No full text
    Consider a network multiplexer with a finite buffer fed by a superposition of independent heterogeneous On-Off sources. An On-Off source consists of a sequence of alternating independent activity and silence periods. During its activity period a source produces fluid with constant rate. For this system, under the assumption that the residual activity periods are intermediately regularly varying, we derive explicit and asymptotically exact formulas for approximating the stationary overflow probability and loss rate. The derived asymptotic formulas, in addition to their analytical tractability, exhibit excellent quantitative accuracy, which is illustrated by a number of simulation experiments. We demonstrate through examples how these results can be used for efficient computing of capacity regions for network switching elements. Furthermore, the results provide important insight into qualitative tradeoffs between the overflow probability, offered traffic load, available capacity, and buffer space. Overall, they provide a new set of tools for designing and provisioning of networks with heavytailed traffic streams. Keywords---Network multiplexer, Finite buffer fluid queue, On-Off process, Heavy-tailed distributions, Subexponential distributions, Long-range dependence I

    Capacity Regions for Network Multiplexers with Heavy-Tailed Fluid On-Off Sources

    No full text
    Abstract — Consider a network multiplexer with a finite buffer fed by a superposition of independent heterogeneous On-Off sources. An On-Off source consists of a sequence of alternating independent activity and silence periods. During its activity period a source produces fluid with constant rate. For this system, under the assumption that the residual activity periods are intermediately regularly varying, we derive explicit and asymptotically exact formulas for approximating the stationary overflow probability and loss rate. The derived asymptotic formulas, in addition to their analytical tractability, exhibit excellent quantitative accuracy, which is illustrated by a number of simulation experiments. We demonstrate through examples how these results can be used for efficient computing of capacity regions for network switching elements. Furthermore, the results provide important insight into qualitative tradeoffs between the overflow probability, offered traffic load, available capacity, and buffer space. Overall, they provide a new set of tools for designing and provisioning of networks with heavytailed traffic streams. Keywords—Network multiplexer, Finite buffer fluid queue, On-Off process, Heavy-tailed distributions, Subexponential distributions, Long-range dependenc

    Analysis of Fluid Queues Using Level Crossing Methods ID: 11563

    Get PDF
    This dissertation is concerned with the application of the level crossing method on fluid queues driven by a background process. The basic assumption of the fluid queue in this thesis is that during the busy period of the driving process, the fluid content fills at net rate r_1, and during the idle period of the driving process, the fluid content, if positive-valued, empties at a rate r_2. Moreover, nonempty fluid content, leaks continuously at a rate r_2. The fluid models considered are: the fluid queue driven by an M/G/1 queue in Chapter 2, the fluid queue driven by an M/G/1 queue with net input and leaking rate depending on fluid level, and type of arrivals in the driving M/G/1 queue, in chapter 3, and the fluid queue driven by an M/G/1 queue with upward fluid jumps in Chapter 4. In addition, a triangle diagram has been introduced in this thesis as a technique to visualize the proportion of time that the content of the fluid queue is increasing or decreasing during nonempty cycles. Finally, we provide several examples on how the probability density function of the fluid level is related to the probability density function of the waiting time of M/G/1 queues with different disciplines
    corecore