On a Reduced Load Equivalence under Heavy Tail Assumptions | Zendy

Rajeev Agrawal | Zendy; Armand M. Makowski | Zendy; Philippe Nain | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

On a Reduced Load Equivalence under Heavy Tail Assumptions

Author(s) -

Rajeev Agrawal,

Armand M. Makowski,

Philippe Nain

Publication year - 1998

Publication title -

digital repository at the university of maryland (university of maryland college park)

Language(s) - English

Resource type - Reports

DOI - 10.21236/ada440808

Subject(s) - equivalence (formal languages) , constant (computer programming) , mathematics , process (computing) , distribution (mathematics) , mathematical analysis , computer science , discrete mathematics , programming language , operating system

: We propose a general framework for obtaining asymptotic distributional bounds on the stationary backlog WA1+A2,c in a buffer fed by a combined fluid process A1+A2 and drained at a constant rate c. The fluid process A1 is an (independent) on-off source with average and peak rates p1 and r1, respectively, and with distribution G for the activity periods. The fluid process A2 of average rate p2 is arbitrary but independent of A1.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research