activity
20192026
most citedNo-regret Algorithms for Fair Resource Allocation

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

collaborators
Showing cs.ITShow all

5 papers · 1 filter

cs.IT2021

Optimizing Age-of-Information in Adversarial Environments with Channel State Information

Avijit Mandal, Rajarshi Bhattacharjee, Abhishek Sinha

This paper considers a multi-user downlink scheduling problem with access to the channel state information at the transmitter (CSIT) to minimize the Age-of-Information (AoI) in a n…

cs.IT2020

Optimizing Age-of-Information in Adversarial and Stochastic Environments

Abhishek Sinha, Rajarshi Bhattacharjee

We design efficient online scheduling policies to maximize the freshness of information delivered to the users in a cellular network under both adversarial and stochastic channel a…

cs.IT2020

Competitive Algorithms for Minimizing the Maximum Age-of-Information

Rajarshi Bhattacharjee, Abhishek Sinha

In this short paper, we consider the problem of designing a near-optimal competitive scheduling policy for mobile users, to maximize the freshness of available information unif…

cs.IT2020★ 1 cited

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…

cs.IT2020

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…