Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: FairCache: Introducing Fairness to ICN Caching - Technical Report   Information-centric networking extensively uses universal in-network caching.
However, developing an efficient and fair collaborative caching algorithm for
selfish caches is still an open question. In addition, the communication
overhead induced by collaboration is especially poorly understood in a general
network setting such as realistic ISP and Autonomous System networks. In this
paper, we address these two problems by modeling the in-network caching problem
as a Nash bargaining game. We show that the game is a convex optimization
problem and further derive the corresponding distributed algorithm. We
analytically investigate the collaboration overhead on general graph
topologies, and theoretically show that collaboration has to be constrained
within a small neighborhood due to its cost growing exponentially. Our proposed
algorithm achieves at least 16% performance gain over its competitors on
different network topologies in the evaluation, and guarantees provable
convergence, Pareto efficiency and proportional fairness.

20
The categories of this paper are: acc-phys
32
The categories of this paper are: atom-ph
10
The categories of this paper are: q-bio
35
The categories of this paper are: mtrl-th
5
The categories of this paper are: gr-qc
0
The categories of this paper are: hep-ph
3
The categories of this paper are: physics
25
The categories of this paper are: patt-sol
11
The categories of this paper are: hep-lat
26
The categories of this paper are: bayes-an
30
The categories of this paper are: q-alg
6
The categories of this paper are: astro-ph
37
The categories of this paper are: supr-con
7
The categories of this paper are: hep-th
23
The categories of this paper are: solv-int
17
The categories of this paper are: q-fin