Related papers: Two-choice regulation in heterogeneous closed netw…
Previously, transport networks are usually treated as homogeneous networks, that is, every node has the same function, simultaneously providing and requiring resources. However, some real networks, such as power grid and supply chain…
Service systems often face task-server assignment-constraints due to skill-based routing or geographical conditions. Redundancy scheduling responds to this limited flexibility by replicating tasks to specific servers in agreement with these…
We consider an M/M/1 queueing model where customers can strategically decide to enter or leave the queue. We characterize the class of queueing regimes such that, for any parameters of the model, the socially efficient behavior is an…
We re-visit the global - relative to control policies - stability of multiclass queueing networks. In these, as is known, it is generally insufficient that the nominal utilization at each server is below 100%. Certain policies, although…
The emerging computing continuum paves the way for exploiting multiple computing devices, ranging from the edge to the cloud, to implement the control algorithm. Different computing units over the continuum are characterized by different…
This paper studies the rate of convergence of the power-of-two-choices, a celebrated randomized load balancing algorithm for many-server queueing systems, to its mean field limit. The convergence to the mean-field limit has been proved in…
A two-tier heterogeneous cellular network (HCN) with intra-tier and inter-tier dependence is studied. The macro cell deployment follows a Poisson point process (PPP) and two different clustered point processes are used to model the…
In recent years, there is a growing research about queueing models with customers who choose their service durations. In general, the model assumptions in the existing literature imply that every customer knows his service demand when he…
Queuing systems with redundant requests have drawn great attention because of their promise to reduce the job completion time and variability. Despite a large body of work on the topic, we are still far from fully understanding the benefits…
Widespread use of computer networks and the use of varied technology for the interconnection of computers has made congestion a significant problem. In this report, we summarize our research on congestion avoidance. We compare the concept…
In this paper, we introduce a scalable model for the aggregate electricity demand of a fleet of electric vehicles, which can provide the right balance between model simplicity and accuracy. The model is based on classification of tasks with…
In response to poor quality of service (QoS), users self-regulate, i.e. they immediately release bandwidth and abandon network. However, there are studies that show users are willing to tolerate poor QoS for some time to evaluate if network…
A multiclass queueing system is considered, with heterogeneous service stations, each consisting of many servers with identical capabilities. An optimal control problem is formulated, where the control corresponds to scheduling and routing,…
We consider two-stage tandem queueing systems with one dedicated server in each station and a flexible server that can serve both stations. We assume exponential service times, linear holding costs accrued by jobs present in the system, and…
Motivated by packet routing in computer networks, online queuing systems are composed of queues receiving packets at different rates. Repeatedly, they send packets to servers, each of them treating only at most one packet at a time. In the…
Today's queueing network systems are more rapidly evolving and more complex than those of even a few years ago. The goal of this paper is to study customers' behavior in an unobservable Markovian M/M/1 queue where consumers have to choose…
We consider a single server queueing system with admission control and the possibility to switch dynamically between a low and a high service rate, and examine the benefit of this service rate flexibility. We formulate a discounted Markov…
We propose and study a model of traffic in communication networks. The underlying network has a structure that is tunable between a scale-free growing network with preferential attachments and a random growing network. To model realistic…
This paper considers competitive mobility-on-demand systems where a group of vehicle sharing companies, on one hand, want to collectively regulate the traffic of the user queueing network, and on the other hand, maximize their own profits…
We consider a single server queue that serves a finite population of $n$ customers that will enter the queue (require service) only once, also known as the $\Delta_{(i)}/G/1$ queue. This paper presents a method for analyzing heavy-traffic…