
A New Upper Bound on Cache Hit Probability for Nonanticipative Caching Policies
Caching systems have long been crucial for improving the performance of ...
read it

Matching through Embedding in Dense Graphs
Finding optimal matchings in dense graphs is of general interest and of ...
read it

Resource Allocation in Onedimensional Distributed Service Networks with Applications
We consider assignment policies that allocate resources to users, where ...
read it

On the Analysis of Spatially Constrained Power of Two Choice Policies
We consider a class of power of two choice based assignment policies for...
read it

Proximity Based Load Balancing Policies on Graphs: A Simulation Study
Distributed load balancing is the act of allocating jobs among a set of ...
read it

Resource Allocation in Onedimensional Distributed Service Networks
We consider assignment policies that allocate resources to users, where ...
read it

A queueingtheoretic model for resource allocation in onedimensional distributed service network
We consider assignment policies that allocate resources to requesting us...
read it

Network Cache Design under Stationary Requests: Exact Analysis and Poisson Approximation
The design of caching algorithms to maximize hit probability has been ex...
read it

Network Cache Design under Stationary Requests: Challenges, Algorithms and Experiments
The design of caching algorithms to maximize hit probability has been ex...
read it

Optimizing Timerbased Policies for General Cache Networks
Caching algorithms are usually described by the eviction method and anal...
read it

What, When and Where to Cache: A Unified Optimization Approach
Caching algorithms are usually described by the eviction method and anal...
read it
Nitish K. Panigrahy
is this you? claim profile