Haya Kaspi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Haya Kaspi has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- David Perry
Holon Institute of Technology P.O. Box 305 5810201 Holon Israel
1 shared publication - David Perry
University of Haifa
1 shared publication - Kavita Ramanan
Carnegie Mellon University
1 shared publication - Kavita Ramanan
Brown University
1 shared publication - Offer Kella
The Hebrew University of Jerusalem
1 shared publication - Offer Kella
Department of Statistics and data science, The Hebrew University of Jerusalem, Jerusalem 9190501, Israel
1 shared publication
Latest Publications
- Open Access
SPDE Limits of Many Server Queues
A many-server queueing system is considered in which customers with independent and identically distributed service times enter service in the order of arrival. The state of the system is represented by a process that describes the total number of customers in the system, as well as a measure-valued process that keeps track of the ages of customers in service, leading to a Markovian description of the dynamics. Under suitable assumptions, a functional central limit theorem is established for the sequence of (centered and scaled) state processes as the number of servers goes to infinity. The limit process describing the total number in system is shown to be an Ito diffusion with a constant diffusion coefficient that is insensitive to the service distribution. The limit of the sequence of (centered and scaled) age processes is shown to be a Hilbert space valued diffusion that can also be characterized as the unique solution of a stochastic partial differential equation that is coupled with the Ito diffusion. Furthermore, the limit processes are shown to be semimartingales and to possess a strong Markov property.
Open AccessSPDE Limits of Many Server Queues
A many-server queueing system is considered in which customers with independent and identically distributed service times enter service in the order of arrival. The state of the system is represented by a process that describes the total number of customers in the system, as well as a measure-valued process that keeps track of the ages of customers in service, leading to a Markovian description of the dynamics. Under suitable assumptions, a functional central limit theorem is established for the sequence of (centered and scaled) state processes as the number of servers goes to infinity. The limit process describing the total number in system is shown to be an Ito diffusion with a constant diffusion coefficient that is insensitive to the service distribution. The limit of the sequence of (centered and scaled) age processes is shown to be a Hilbert space valued diffusion that can also be characterized as the unique solution of a stochastic partial differential equation that is coupled with the Ito diffusion. Furthermore, the limit processes are shown to be semimartingales and to possess a strong Markov property.
- Open Access
Law of Large Numbers Limits for Many Server Queues
This work considers a many-server queueing system in which customers with i.i.d., generally distributed service times enter service in the order of arrival. The dynamics of the system is represented in terms of a process that describes the total number of customers in the system, as well as a measure-valued process that keeps track of the ages of customers in service. Under mild assumptions on the service time distribution, as the number of servers goes to infinity, a law of large numbers (or fluid) limit is established for this pair of processes. The limit is characterised as the unique solution to a coupled pair of integral equations, which admits a fairly explicit representation. As a corollary, the fluid limits of several other functionals of interest, such as the waiting time, are also obtained. Furthermore, in the time-homogeneous setting, the fluid limit is shown to converge to its equilibrium. Along the way, some results of independent interest are obtained, including a continuous mapping result and a maximality property of the fluid limit. A motivation for studying these systems is that they arise as models of computer data systems and call centers.
Open AccessLaw of Large Numbers Limits for Many Server Queues
This work considers a many-server queueing system in which customers with i.i.d., generally distributed service times enter service in the order of arrival. The dynamics of the system is represented in terms of a process that describes the total number of customers in the system, as well as a measure-valued process that keeps track of the ages of customers in service. Under mild assumptions on the service time distribution, as the number of servers goes to infinity, a law of large numbers (or fluid) limit is established for this pair of processes. The limit is characterised as the unique solution to a coupled pair of integral equations, which admits a fairly explicit representation. As a corollary, the fluid limits of several other functionals of interest, such as the waiting time, are also obtained. Furthermore, in the time-homogeneous setting, the fluid limit is shown to converge to its equilibrium. Along the way, some results of independent interest are obtained, including a continuous mapping result and a maximality property of the fluid limit. A motivation for studying these systems is that they arise as models of computer data systems and call centers.
- 1 January 2005
- Published by Cambridge University Press (CUP) in Probability in the Engineering and Informational Sciences
- Vol. 19 (1) , 1-14
ON/OFF STORAGE SYSTEMS WITH STATE-DEPENDENT INPUT, OUTPUT, AND SWITCHING RATES
We consider a storage model that can be on or off. When on, the content increases at some state-dependent rate and the system can switch to the off state at a state-dependent rate as well. When off, the content decreases at some state-dependent rate (unless it is at zero) and the system can switch to the on position at a state-dependent rate. This process is a special case of a piecewise deterministic Markov process. We identify the stationary distribution and conditions for its existence and uniqueness.
- 1 January 2005
- Published by Cambridge University Press (CUP) in Probability in the Engineering and Informational Sciences
- Vol. 19 (1) , 1-14
ON/OFF STORAGE SYSTEMS WITH STATE-DEPENDENT INPUT, OUTPUT, AND SWITCHING RATES
We consider a storage model that can be on or off. When on, the content increases at some state-dependent rate and the system can switch to the off state at a state-dependent rate as well. When off, the content decreases at some state-dependent rate (unless it is at zero) and the system can switch to the on position at a state-dependent rate. This process is a special case of a piecewise deterministic Markov process. We identify the stationary distribution and conditions for its existence and uniqueness.
- 1 March 1996
- Published by Springer Nature in Queueing Systems
- Vol. 24 (1-4) , 37-57
Dam processes with state dependent batch sizes and intermittent production processes with state dependent rates
- 1 March 1996
- Published by Springer Nature in Queueing Systems
- Vol. 24 (1-4) , 37-57
Dam processes with state dependent batch sizes and intermittent production processes with state dependent rates