1 citations · 3 across the 16 of their papers we have counts for
17 papers
Index-Based Scheduling for a Resource-Constrained Quantum Switch
Subhankar Banerjee, Stavros Mitrolaris, Sennur Ulukus
We consider a quantum switch with a finite number of quantum memory registers that aims to serve multipartite entanglement requests among users. We propose scheduling policies…
Preemptive Scheduling for Age of Job Minimization in Task-Specific Machine Networks
Subhankar Banerjee, Sennur Ulukus
We consider a time-slotted job-assignment system consisting of a central server, task-specific networks of machines, and multiple users. Each network specializes in executing a…
Age-Based Scheduling for a Memory-Constrained Quantum Switch
Stavros Mitrolaris, Subhankar Banerjee, Sennur Ulukus
In a time-slotted system, we study the problem of scheduling multipartite entanglement requests in a quantum switch with a finite number of quantum memory registers. Specifically,…
Age of Job Completion Minimization with Stable Queues
Stavros Mitrolaris, Subhankar Banerjee, Sennur Ulukus
We consider a time-slotted job-assignment system with a central server, N users and a machine which changes its state according to a Markov chain (hence called a Markov machine). T…
Equidistant-Sample or Wait-and-Sample to Minimize Age Under Sampling Constraint?
Subhankar Banerjee, Sennur Ulukus
We study a status update system with a source, a sampler, a transmitter, and a monitor. The source governs a stochastic process that the monitor wants to observe in a timely manner…
Tracking and Assigning Jobs to a Markov Machine
Subhankar Banerjee, Sennur Ulukus
We consider a time-slotted communication system with a machine, a cloud server, and a sampler. Job requests from the users are queued on the server to be completed by the machine.…
When to Preempt in a Status Update System?
Subhankar Banerjee, Sennur Ulukus
We consider a time-slotted status update system with an error-free preemptive queue. The goal of the sampler-scheduler pair is to minimize the age of information at the monitor by…
Age-Based Cache Updating Under Timestomping
Subhankar Banerjee, Priyanka Kaswan, Sennur Ulukus
We consider a slotted communication system consisting of a source, a cache, a user and a timestomping adversary. The time horizon consists of total time slots, such that the so…
To Re-transmit or Not to Re-transmit for Freshness
Subhankar Banerjee, Sennur Ulukus, Anthony Ephremides
We consider a time slotted communication network with a base station (BS) and a user. At each time slot a fresh update packet arrives at the BS with probability . When the BS…
The Freshness Game: Timely Communications in the Presence of an Adversary
Subhankar Banerjee, Sennur Ulukus
We consider a communication system where a base station (BS) transmits update packets to users, one user at a time, over a wireless channel. We investigate the age of this stat…
Minimizing the Age of Information Over an Erasure Channel for Random Packet Arrivals With a Storage Option at the Transmitter
Subhankar Banerjee, Sennur Ulukus, Anthony Ephremides
We consider a time slotted communication system consisting of a base station (BS) and a user. At each time slot an update packet arrives at the BS with probability , and the BS…
Age of Information of a Power Constrained Scheduler in the Presence of a Power Constrained Adversary
Subhankar Banerjee, Sennur Ulukus, Anthony Ephremides
We consider a time slotted communication network consisting of a base station (BS), an adversary, users and communication channels. Both the BS and the adversary have ave…
Joint Power and Subcarrier Allocation in Multi-Cell Multi-Carrier NOMA
Subhankar Banerjee, Chung Shue Chen, Marceau Coupechoux +1
Non-orthogonal multiple access (NOMA) is a technology proposed for next generation cellular networks because of its high spectral efficiency and enhanced user connectivity. However…
Game Theoretic Analysis of an Adversarial Status Updating System
Subhankar Banerjee, Sennur Ulukus
We investigate the game theoretic equilibrium points of a status updating system with an adversary that jams the updates in the downlink. We consider the system models with and wit…
Age of Information in the Presence of an Adversary
Subhankar Banerjee, Sennur Ulukus
We consider a communication system where a base station serves users, one user at a time, over a wireless channel. We consider the timeliness of the communication of each user…
Fundamental Limits of Online Network-Caching
Rajarshi Bhattacharjee, Subhankar Banerjee, Abhishek Sinha
Optimal caching of files in a content distribution network (CDN) is a problem of fundamental and growing commercial interest. Although many different caching algorithms are in use…
Fundamental Limits of Age-of-Information in Stationary and Non-stationary Environments
Subhankar Banerjee, Rajarshi Bhattacharjee, Abhishek Sinha
We study the multi-user scheduling problem for minimizing the Age of Information (AoI) in cellular wireless networks under stationary and non-stationary regimes. We derive fundamen…