Sciweavers

Share
EPEW
2006
Springer

Worst Case Analysis of Batch Arrivals with the Increasing Convex Ordering

9 years 11 months ago
Worst Case Analysis of Batch Arrivals with the Increasing Convex Ordering
We consider a finite buffer queue with one deterministic server fed by packets arriving in batches. We assume that we are not able to fully describe the batch distribution: only the maximal size and the average number of packets are supposed known. Indeed, these two quantities are simple to measure in a real system. We additionally allow the batch distribution to be state dependent. We analyze the worst case distribution of the queue length and the expectation of lost packets per slot. We show that the increasing convex ordering provides tight bounds for such a system.
Ana Busic, Jean-Michel Fourneau, Nihal Pekergin
Added 14 Oct 2010
Updated 14 Oct 2010
Type Conference
Year 2006
Where EPEW
Authors Ana Busic, Jean-Michel Fourneau, Nihal Pekergin
Comments (0)
books