skip to main content

Search for: All records

Creators/Authors contains: "Ma, Qian"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. Free, publicly-accessible full text available November 1, 2024
  2. null (Ed.)
  3. null (Ed.)
    We study fair content allocation strategies in caching networks through a utility-driven framework, where each request achieves a utility of its caching gain rate. The resulting problem is NP-hard. Submodularity allows us to devise a deterministic allocation strategy with an optimality guarantee factor arbitrarily close to 1-1/e. When 0 < α ≤ 1, we further propose a randomized strategy that attains an improved optimality guarantee, (1 - 1/e)1-α, in expectation. Through extensive simulations over synthetic and real-world network topologies, we evaluate the performance of our proposed strategies and discuss the effect of fairness. 
    more » « less
  4. null (Ed.)