141 citations · 213 across the 13 of their papers we have counts for
4 papers · 1 filter
Persistence of the Jordan center in Random Growing Trees
Sarath Pattathil, Nikhil Karamchandani, Dhruti Shah
The Jordan center of a graph is defined as a vertex whose maximum distance to other nodes in the graph is minimal, and it finds applications in facility location and source detecti…
Distributed Server Allocation for Content Delivery Networks
Sarath Pattathil, Vivek S. Borkar, Gaurav S. Kasbekar
We propose a dynamic formulation of file-sharing networks in terms of an average cost Markov decision process with constraints. By analyzing a Whittle-like relaxation thereof, we p…
Whittle Indexability in Egalitarian Processor Sharing Systems
Vivek S. Borkar, Sarath Pattathil
The egalitarian processor sharing model is viewed as a restless bandit and its Whittle indexability is established. A numerical scheme for computing the Whittle indices is provided…
Opportunistic Scheduling as Restless Bandits
Vivek S. Borkar, Gaurav S. Kasbekar, Sarath Pattathil +1
In this paper we consider energy efficient scheduling in a multiuser setting where each user has a finite sized queue and there is a cost associated with holding packets (jobs) in…