3 citations · 9 across the 21 of their papers we have counts for
4 papers · 1 filter
A New Upper Bound on Cache Hit Probability for Non-anticipative Caching Policies
Nitish K. Panigrahy, Philippe Nain, Giovanni Neglia +1
Caching systems have long been crucial for improving the performance of a wide variety of network and web based online applications. In such systems, end-to-end application perform…
Resource Allocation in One-dimensional Distributed Service Networks with Applications
Nitish K. Panigrahy, Prithwish Basu, Philippe Nain +4
We consider assignment policies that allocate resources to users, where both resources and users are located on a one-dimensional line. First, we consider unidirectional assignment…
Proximity Based Load Balancing Policies on Graphs: A Simulation Study
Nitish K. Panigrahy, Thirupathaiah Vasantam, Prithwish Basu +1
Distributed load balancing is the act of allocating jobs among a set of servers as evenly as possible. There are mainly two versions of the load balancing problem that have been st…
Resource Allocation in One-dimensional Distributed Service Networks
Nitish K. Panigrahy, Prithwish Basu, Philippe Nain +4
We consider assignment policies that allocate resources to users, where both resources and users are located on a one-dimensional line. First, we consider unidirectional assignment…