Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: On the Network-Wide Gain of Memory-Assisted Source Coding   Several studies have identified a significant amount of redundancy in the
network traffic. For example, it is demonstrated that there is a great amount
of redundancy within the content of a server over time. This redundancy can be
leveraged to reduce the network flow by the deployment of memory units in the
network. The question that arises is whether or not the deployment of memory
can result in a fundamental improvement in the performance of the network. In
this paper, we answer this question affirmatively by first establishing the
fundamental gains of memory-assisted source compression and then applying the
technique to a network. Specifically, we investigate the gain of
memory-assisted compression in random network graphs consisted of a single
source and several randomly selected memory units. We find a threshold value
for the number of memories deployed in a random graph and show that if the
number of memories exceeds the threshold we observe network-wide reduction in
the traffic.

31
The categories of this paper are: ao-sci
28
The categories of this paper are: alg-geom
12
The categories of this paper are: nucl-th
9
The categories of this paper are: nlin
27
The categories of this paper are: comp-gas
36
The categories of this paper are: cmp-lg
18
The categories of this paper are: econ
22
The categories of this paper are: chao-dyn
21
The categories of this paper are: adap-org
33
The categories of this paper are: plasm-ph
11
The categories of this paper are: hep-lat
3
The categories of this paper are: physics
6
The categories of this paper are: astro-ph
0
The categories of this paper are: hep-ph
17
The categories of this paper are: q-fin
23
The categories of this paper are: solv-int