A Storage Process with Alternating Lévy Input
Abstract
In this paper, we study a queueing process for which the dynamics are changed once the workload in the queue exceeds a predefined threshold, and these new dynamics stay in force until the queue is emptied, at which point the previous dynamics are again reinstalled. For general spectrally positive Lévy processes in each case, we derive expressions for the workload at an independent exponentially distributed random time horizon and study in detail properties of the workload in stationarity. We work out explicit formulas as well as expressions for the optimal changing threshold for special cases of the underlying process dynamics and a chosen set of involved switching, holding, and service cost functions. Funding: The research of O. Boxma and M. Mandjes has been partly funded by the Nederlandse Organisatie voor Wetenschappelijk Onderzoek Gravitation [Project Networks, Grant 024.002.003]. The research of O. Kella is partially funded by Israel Science Foundation [Grant 3336/24] and the Vigevani Chair in Statistics.
Authors 4
-
Swiss Finance Institute · University of Lausanne
Affiliation as printed
Faculty of Business and Economics, University of Lausanne and Swiss Finance Institute, 1015 Lausanne, Switzerland
-
Eindhoven University of Technology
Affiliation as printed
EURANDOM and Department of Mathematics and Computer Science, Eindhoven University of Technology, 5612 AZ Eindhoven, Netherlands
-
Hebrew University of Jerusalem
Affiliation as printed
Department of Statistics and Data Science, The Hebrew University of Jerusalem, Jerusalem 9190501, Israel
-
Michel Mandjes Aachen
Leiden University · University of Amsterdam
Affiliation as printed
Mathematical Institute, Leiden University, 2311 EZ Leiden, Netherlands; and Korteweg-de Vries Institute for Mathematics, University of Amsterdam, 1012 WP Amsterdam, Netherlands
Cited by 0 stored of 0
No patents citing this paper on Lens.org (checked 2026-10-11).