Related papers: Stability conditions for a discrete-time decentral…

This paper studies a spatial queueing system on a circle, polled at random locations by a myopic server that can only observe customers in a bounded neighborhood. The server operates according to a greedy policy, always serving the nearest…

Code-division multiple-access (CDMA) has the potential to support traffic sources with a wide range of quality of service (QoS) requirements. The traffic carrying capacity of CDMA channels under QoS constraints (such as delay guarantee) is,…

We analyse an ALOHA-type random multiple-access protocol where users have local interactions. We show that the fluid model of the system workload satisfies a certain differential equation. We obtain a sufficient condition for the stability…

We study synchronization in the context of network traffic on a $2-d$ communication network with local clustering and geographic separations. The network consists of nodes and randomly distributed hubs where the top five hubs ranked…

We consider single-hop topologies with saturated transmitting nodes, using IEEE~802.11 DCF for medium access. However, unlike the conventional WiFi, we study systems where one or more of the protocol parameters are different from the…

Throughput-optimal transmission scheduling in wireless networks has been a well considered problem in the literature, and the method for achieving optimality, MaxWeight scheduling, has been known for several decades. This algorithm achieves…

We consider processing networks where multiple dispatchers are connected to single-server queues by a bipartite compatibility graph, modeling constraints that are common in data centers and cloud networks due to geographic reasons or data…

Motivated by medium access control for resource-challenged wireless Internet of Things (IoT), we consider the problem of queue scheduling with reduced queue state information. In particular, we consider a time-slotted scheduling model with…

We consider a load balancing system consisting of $n$ single-server queues working in parallel, with heterogeneous service rates. Jobs arrive to a central dispatcher, which has to dispatch them to one of the queues immediately upon arrival.…

We consider a system of several collocated nodes sharing a time slotted wireless channel, and seek a MAC (medium access control) that (i) provides low mean delay, (ii) has distributed control (i.e., there is no central scheduler), and (iii)…

We explore the achievable delay performance in wireless random-access networks. While relatively simple and inherently distributed in nature, suitably designed queue-based random-access schemes provide the striking capability to match the…

In this paper, we study the problem of cooperative communications in cognitive radio systems where the secondary user has limited relaying room for the overheard primary packets. More specifically, we characterize the stable throughput…

We consider networks where each node represents a server with a queue. An active node deactivates at unit rate. An inactive node activates at a rate that depends on its queue length, provided none of its neighbors is active. For complete…

Consider the workload process for a single server queue with deterministic service times in which customers arrive according to a scheduled traffic process. A scheduled arrival sequence is one in which customers are scheduled to arrive at…

We consider traffic flow dynamics for a network of signalized intersections, where the outflow from every link is constrained to be equal to a given capacity function if the queue length is positive, and equal to the minimum of cumulative…

The equilibrium properties of allocation algorithms for networks with a large number of nodes with finite capacity are investigated. Every node is receiving a flow of requests and when a request arrives at a saturated node, i.e. a node…

In this thesis, we study the queueing systems with heterogeneous servers and service rate uncertainty under the Halfin-Whitt heavy traffic regime. First, we analyse many server queues with abandonments when service rates are i.i.d. random…

Recent control trends are increasingly relying on communication networks and wireless channels to close the loop for Internet-of-Things applications. Traditionally these approaches are model-based, i.e., assuming a network or channel model…

We consider the problem of forming a distributed queue in the adversarial dynamic network model of Kuhn, Lynch, and Oshman (STOC 2010) in which the network topology changes from round to round but the network stays connected. This is a…

In asymptotic regimes, both in time and space (network size), the derivation of network capacity results is grossly simplified by brushing aside queueing behavior in non-Jackson networks. This simplifying double-limit model, however, lends…