Cloud computing today is dominated by multi-server jobs. These are jobs that request multiple servers simultaneously and hold onto all of these for the duration job. Multi-server add a lot complexity to traditional one-server-per-job model: an arrival might not "fit'' into available have queue, blocking later arrivals leaving idle. From queueing perspective, almost nothing understood about job ...

We study optimal service pricing in server farms where customers arrive according to a renewal process and have independent identical ($i.i.d.$) exponential times $i.i.d.$ valuations of the service. The provider charges time varying fee aiming at maximizing its revenue rate. that find free servers fees lesser than their valuation join for else they leave without waiting. consider both finite in...

Private information retrieval (PIR) protocols ensure that a user can download file from database without revealing any on the identity of requested to servers storing database. While existing strictly impose no is leaked file’s identity, this work initiates study tradeoffs be achieved by relaxing perfect privacy requirement. We refer such as weakly-private (WPIR) protocols. In particular...

-The performance in terms of reliability of multi-server computer networks motivates this paper. The probability limit theorem is derived on the virtual waiting time of job in nodes in a multi-server open queueing network and applied to a reliability model for multi-server computer networks where we relate the time of failure of a multi-server computer network to the system parameters. Key-Word...

This paper concerns discrete-time queueing systems operating under a first-come-first-served queueing discipline, with deterministic service times of one slot and subject to independent server interruptions. We derive a relationship between the probability generating functions of the system contents during an arbitrary slot and of the system delay of an arbitrary customer. This relationship is ...