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. © Springer-Verlag Berlin Heidelberg 2008.
CITATION STYLE
Bušić, A., Fourneau, J. M., & Pekergin, N. (2006). Worst case analysis of batch arrivals with the increasing convex ordering. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4054 LNCS, pp. 196–210). Springer Verlag. https://doi.org/10.1007/11777830_14
Mendeley helps you to discover research relevant for your work.