The loss of serving in the dark

We study the following balls and bins stochastic process: There is a buffer with B bins, and there is a stream of balls X=〈X1,X2,…,XT〉 such that Xi is the number of balls that arrive before time i but after time i−1. Once a ball arrives, it is stored in one of the unoccupied bins. If all the bins ar...

Full description

Bibliographic Details

Published in:	Information processing letters Vol. 180; p. 106334
Main Authors:	Azar, Yossi, Cohen, Ilan Reuven, Gamzu, Iftah
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.02.2023
Subjects:	Oblivious algorithms Online algorithms Prompt mechanisms Randomized algorithms Scheduling Oblivious algorithms Online algorithms Randomized algorithms Scheduling Prompt mechanisms
ISSN:	0020-0190, 1872-6119
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!