activity
20202026
most cited3-Competitive Policy for Minimizing Age of Information in Multi-Source M/G/1 Queuing Model

5 citations · 7 across the 8 of their papers we have counts for

collaborators

8 papers

quant-ph2026

Universal Hamiltonian control in a planar trimon circuit

Vivek Maurya, Daria Kowsari, Kumar Saurav +4

Multimode circuits provide an avenue for flexible control of single and multi-qubit gates. In this work we implement a multimode circuit known as a trimon integrated in a planar ge…

cs.LG2025

Monitoring State Transitions in Markovian Systems with Sampling Cost

Kumar Saurav, Ness B. Shroff, Yingbin Liang

We consider a node-monitor pair, where the node's state varies with time. The monitor needs to track the node's state at all times; however, there is a fixed cost for each state qu…

cs.IT2022

Minimizing Age of Information under Arbitrary Arrival Model with Arbitrary Packet Size

Kumar Saurav, Rahul Vaze

We consider a single source-destination pair, where information updates arrive at the source at arbitrary time instants. For each update, its size, i.e. the service time required f…

cs.IT2022★ 1 cited

Scheduling to Minimize Age of Information with Multiple Sources

Kumar Saurav, Rahul Vaze

We consider a G/G/1 queueing system with a single server, where updates arrive from different sources stochastically with possibly different update inter-generation time distributi…

cs.IT2022★ 5 cited

3-Competitive Policy for Minimizing Age of Information in Multi-Source M/G/1 Queuing Model

Kumar Saurav

We consider a multi-source network with a common monitor, where fresh updates are generated at each source, following a Poisson process. At any time, at most one source can transmi…

cs.IT2021★ 1 cited

Minimizing the Sum of Age of Information and Transmission Cost under Stochastic Arrival Model

Kumar Saurav, Rahul Vaze

We consider a node-monitor pair, where updates are generated stochastically (according to a known distribution) at the node that it wishes to send to the monitor. The node is assum…

cs.IT2021

Online Energy Minimization Under A Peak Age of Information Constraint

Kumar Saurav, Rahul Vaze

We consider a node where packets of fixed size (in bits) are generated at arbitrary intervals. The node is required to maintain the peak age of information (AoI) at the monitor bel…

cs.IT2020

Game of Ages

Kumar Saurav, Rahul Vaze

We consider a distributed IoT network, where each node wants to minimize its age of information and there is a cost to make any transmission. A collision model is considered, where…