Related papers: Lingering Issues in Distributed Scheduling
We consider both leaderless and leader-follower, possibly nonlinear, networks affected by time-varying communication delays. For such systems, we give a set of sufficient conditions that guarantee the convergence of the network towards some…
A general open problem in networking is: what are the fundamental limits to the performance that is achievable with some given amount of resources? More specifically, if each node in the network has information about only its $1$-hop…
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 study an uplink multi secondary user (SU) cognitive radio system having average delay constraints as well as an instantaneous interference constraint to the primary user (PU). If the interference channels from the SUs to the PU have…
This paper deals with partially-observed optimal control problems for the state governed by stochastic differential equation with delay. We develop a stochastic maximum principle for this kind of optimal control problems using a variational…
We study an admissions control problem, where a queue with service rate $1-p$ receives incoming jobs at rate $\lambda\in(1-p,1)$, and the decision maker is allowed to redirect away jobs up to a rate of $p$, with the objective of minimizing…
This work studies the performance of an event-based control approach, namely level-triggered sampling, in a standard multidimensional single-integrator setup. We falsify a conjecture from the literature that the deployed $p$-norm in the…
This work studies online scheduling algorithms for buffer management, develops new algorithms, and analyzes their performances. Packets arrive at a release time r, with a non-negative weight w and an integer deadline d. At each time step,…
Multi-hop random access networks have received much attention due to their distributed nature which facilitates deploying many new applications over the sensor and computer networks. Recently, utility maximization framework is applied in…
The overall performance of a distributed system is highly dependent on the communication efficiency of the system. Although network resources (links, bandwidth) are becoming increasingly more available, the communication performance of data…
It is shown that the performance of the maximal scheduling algorithm in wireless ad hoc networks under the hypergraph interference model can be further away from optimal than previously known. The exact worst-case performance of this…
Emergence of new types of services has led to various traffic and diverse delay requirements in fifth generation (5G) wireless networks. Meeting diverse delay requirements is one of the most critical goals for the design of 5G wireless…
Most of the early input-queued switch research focused on establishing throughput optimality of the max-weight scheduling policy, with some recent research showing that max-weight scheduling is optimal with respect to total expected delay…
Saddle-point or primal-dual methods have recently attracted renewed interest as a systematic technique to design distributed algorithms which solve convex optimization problems. When implemented online for streaming data or as dynamic…
We consider scheduling in a quantum switch with stochastic entanglement generation, finite quantum memories, and decoherence. The objective is to design a scheduling algorithm with polynomial-time computational complexity that stabilizes a…
The paper aims to discuss statistical properties of the multi-agent based model of competitive growth. Each of the agents is described by growth (or decay) rule of its virtual "mass" with the rate affected by the interaction with other…
We consider a single server queueing system with two classes of jobs: eager jobs with small sizes that require service to begin almost immediately upon arrival, and tolerant jobs with larger sizes that can wait for service. While blocking…
We focus on the downlink of a cellular system, which corresponds to the bulk of the data transfer in such wireless systems. We address the problem of opportunistic multiuser scheduling under imperfect channel state information, by…
Multi-hop random access networks have received much attention due to their distributed nature which facilitates deploying many new applications over the sensor and computer networks. Recently, utility maximization framework is applied in…
We consider the problem of dynamically scheduling J jobs on N processors for non-preemptive execution where the value of each job (or the reward garnered upon completion) decays over time. All jobs are initially available in a buffer and…