Related papers: A Queueing System for Modeling a File Sharing Prin…
The culture of sharing instead of ownership is sharply increasing in individuals behaviors. Particularly in transportation, concepts of sharing a ride in either carpooling or ridesharing have been recently adopted. An efficient optimization…
We study a two-type server queueing system where flexible Type-I servers, upon their initial interaction with jobs, decide in real time whether to process them independently or in collaboration with dedicated Type-II servers. Independent…
We use an Ornstein--Uhlenbeck (OU) process to approximate the queue length process in a $GI/GI/n+M$ queue. This one-dimensional diffusion model is able to produce accurate performance estimates in two overloaded regimes: In the first…
A heterogeneous closed network with one-server queues with finite capacity and one infinite-server queue is studied. A target application is bike-sharing systems. Heterogeneity is taken into account through clusters whose queues have the…
We study distribution testing in the standard access model and the conditional access model when the memory available to the testing algorithm is bounded. In both scenarios, the samples appear in an online fashion and the goal is to test…
We provide a queueing-theoretic framework for job replication schemes based on the principle "\emph{replicate a job as soon as the system detects it as a \emph{straggler}}". This is called job \emph{speculation}. Recent works have analyzed…
This paper investigates a partially observable queueing system with $N$ nodes in which each node has a dedicated arrival stream. There is an extra arrival stream to balance the load of the system by routing its customers to the shortest…
Solving free riding and selecting a reliable service provider in P2P networks has been separately investigated in last few years. Using trust has shown to be one of the best ways of solving these problems. But using this approach to…
This paper studies the effect of an overdispersed arrival process on the performance of an infinite-server system. In our setup, a random environment is modeled by drawing an arrival rate $\Lambda$ from a given distribution every $\Delta$…
This paper considers the problem of transferring a file from one source node to multiple receivers in a peer-to-peer (P2P) network. The objective is to minimize the weighted sum download time (WSDT) for the one-to-many file transfer.…
Frameworks, such as MapReduce and Hadoop are abundant nowadays. They seek to reap benefits of parallelization, albeit subject to a synchronization constraint at the output. Fork-Join (FJ) queuing models are used to analyze such systems.…
This paper considers the queueing performance of a system that transmits coded data over a time-varying erasure channel. In our model, the queue length and channel state together form a Markov chain that depends on the system parameters.…
Cache-aided content delivery is studied in a multi-server system with $P$ servers and $K$ users, each equipped with a local cache memory. In the delivery phase, each user connects randomly to any $\rho$ out of $P$ servers. Thanks to the…
Admission control can be employed to avoid congestion in queueing networks subject to overload. In distributed networks the admission decisions are often based on imperfect measurements on the network state. This paper studies how the lack…
Algorithms for scheduling structured parallel computations have been widely studied in the literature. For some time now, Work Stealing is one of the most popular for scheduling such computations, and its performance has been studied in…
We consider the coupling of a single server queue and a storage model defined as a Queue/Store model in Draief et al. 2004. We establish that if the input variables, arrivals at the queue and store, satisfy large deviations principles and…
We study simple interacting particle systems on heterogeneous networks, including the voter model and the invasion process. These are both two-state models in which in an update event an individual changes state to agree with a neighbor.…
The bike sharing systems are fast increasing as a public transport mode in urban short trips, and have been developed in many major cities around the world. A major challenge in the study of bike sharing systems is that large-scale and…
We study a many-server queuing system with general service time distribution and state dependent service rates. The dynamics of the system are modeled using measure valued processes which keep track of the residual service times. Under…
One of the fundamental problems in the realm of peer-to-peer systems is that of determining their service capacities. In this paper, we focus on P2P scalability issues and propose models to compute the achievable throughput under distinct…