activity
20202026
most citedAge of Information in the Presence of an Adversary

1 citations · 2 across the 9 of their papers we have counts for

collaborators
Showing cs.ITShow all

13 papers · 1 filter

cs.IT2026

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…

cs.IT2026

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…

cs.IT2026

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,…

cs.IT2025

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…

cs.IT2025

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…

cs.IT2025

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.…