Sanjit K. Kaul

Sanjit K. Kaul

Auto-generated profile, based on publicly available information

Sanjit K. Kaul

Indraprastha Institute of Information Technology, Delhi (IIIT-Delhi), New Delhi, India

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
17 March 2021 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Closed access
RYRoy D. Yates
Roy D. Yates
YSYin Sun
Yin Sun
DBD. Richard Brown
D. Richard Brown
SKSanjit K. Kaul
Sanjit K. Kaul
EMEytan Modiano
Eytan Modiano
SUSennur Ulukus
Sennur Ulukus
We summarize recent contributions in the broad area of age of information (AoI). In particular, we describe the current state of the art in the design and optimization of low-latency cyberphysical systems and applications in which sources send time-stamped status updates to interested recipients. These applications desire status updates at the recipients to be as timely as possible; however, this is typically constrained by limited system resources. We describe AoI timeliness metrics and present general methods of AoI evaluation analysis that are applicable to a wide variety of sources and systems. Starting from elementary single-server queues, we apply these AoI methods to a range of increasingly complex systems, including energy harvesting sensors transmitting over noisy channels, parallel server systems, queueing networks, and various single-hop and multi-hop wireless networks. We also explore how update age is related to MMSE methods of sampling, estimation and control of stochastic processes. The paper concludes with a review of efforts to employ age optimization in cyberphysical applications.

20 September 2018 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
RYRoy D. Yates
Roy D. Yates
SKSanjit K. Kaul
Sanjit K. Kaul
We examine multiple independent sources providing status updates to a monitor through simple queues. We formulate an Age of Information (AoI) timeliness metric and derive a general result for the AoI that is applicable to a wide variety of multiple source service systems. For first-come first-served and two types of last-come first-served systems with Poisson arrivals and exponential service times, we find the region of feasible average status ages for multiple updating sources. We then use these results to characterize how a service facility can be shared among multiple updating sources. A new simplified technique for evaluating the AoI in finite-state continuous-time queueing systems is also derived. Based on stochastic hybrid systems, this method makes AoI evaluation to be comparable in complexity to finding the stationary distribution of a finite-state Markov chain.

15 October 2018
Verified
Conference Paper
Open access
PDF file
TSTanya Shreedhar
Tanya Shreedhar
SKSanjit K. Kaul
Sanjit K. Kaul
RYRoy D. Yates
Roy D. Yates

1 April 2021 in IEEE/ACM Transactions on Networking
Verified
Journal Article
Closed access
SGSneihil Gopal
Sneihil Gopal
SKSanjit K. Kaul
Sanjit K. Kaul
RCRakesh Chaturvedi
Rakesh Chaturvedi
SRSumit Roy
Sumit Roy
We investigate the coexistence of an age optimizing network (AON) and a throughput optimizing network (TON) that share a common spectrum band. We consider two modes of long run coexistence: (a) networks compete with each other for spectrum access, causing them to interfere and (b) networks cooperate to achieve non-interfering access. To model competition, we define a non-cooperative stage game parameterized by the average age of the AON at the beginning of the stage, derive its mixed strategy Nash equilibrium (MSNE), and analyze the evolution of age and throughput over an infinitely repeated game in which each network plays the MSNE at every stage. Cooperation uses a coordination device that performs a coin toss during each stage to select the network that must access the medium. Networks use the grim trigger punishment strategy, reverting to playing the MSNE every stage forever if the other disobeys the device. We determine if there exists a subgame perfect equilibrium, i.e., the networks obey the device forever as they find cooperation beneficial. We show that networks choose to cooperate only when they consist of a sufficiently small number of nodes, otherwise they prefer to disobey the device and compete.

15 April 2021 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Closed access
RYRoy D. Yates
Roy D. Yates
YSYin Sun
Yin Sun
DBD. Richard Brown
D. Richard Brown
SKSanjit K. Kaul
Sanjit K. Kaul
EMEytan Modiano
Eytan Modiano
SUSennur Ulukus
Sennur Ulukus
With the emergence of real-time cyberphysical systems, status updates are becoming an important form of communication. Vehicular messaging, security reports from homes and offices, surveillance video, and video feedback from remote-controlled systems all represent status updates at networked monitors that need to be as timely as possible. However, this is typically constrained by limited network resources. This tension has led to the introduction of new performance metrics based on the Age of Information (AoI) that capture how timely is one’s knowledge of an entity or process. Optimization based on AoI metrics of both the networks and the senders’ updating policies has yielded new and even surprising results.

28 March 2024 in IEEE/ACM Transactions on Networking
Verified
Journal Article
Closed access
TSTanya Shreedhar
Tanya Shreedhar
SKSanjit K. Kaul
Sanjit K. Kaul
RYRoy D. Yates
Roy D. Yates
We present the age control protocol ACP $+$ , a transport layer protocol that regulates the rate at which update packets carrying information from a source are sent over the Internet to a monitor. The source would like to minimize the average age of information at the monitor. Extensive experimentation helps shed light on age control over the current Internet and its implications for sources sending updates over a shared wireless access to monitors in the cloud. Surprisingly, age minimizing rates over fast Internet paths are about 0.5 Mbps, which is a small fraction, for example, of link rates supported by WiFi wireless access technology. We also show that congestion control algorithms employed by the Transmission Control Protocol (TCP), including hybrid approaches that achieve higher throughputs at lower delays than traditional loss-based congestion control, are unsuitable for age control.