Physical Communication 44 (2021) 101238

Contents lists available at ScienceDirect

Physical Communication
journal homepage: www.elsevier.com/locate/phycom

Full length article

Replacement based content popularity and cache gain for 6G

Content-Centric network
∗
Yancheng Ji a , , Xiao Zhang a , Wenfei Liu b , Guoan Zhang a
a
School of Information Science and Technology, Nantong University, Nantong 226000, China
b
School of Foreign Languages, Hubei Polytechnic University, Huangshi 435000, China

article info a b s t r a c t

Article history: In Content-Centric network (CCN), the capacity of router nodes caches the contents to satisfy the
Received 20 May 2020 requests from subsequent consumers, and reduce the network overhead. Considering the limited cache
Received in revised form 23 September 2020 capacity, the update of cached contents becomes a key element affecting the caching performance for
Accepted 11 November 2020
the future 6G network. In this paper, a replacement strategy based content popularity and cache gain
Available online 20 November 2020
(PGR) is proposed for 6G-CCN. In the proposed scheme, the popularity of contents in the current
Keywords: cycle is determined according to the time interval and frequency of consumers’ requests. In addition,
Content-Centric network the distance between the router node and consumer affects the gain of caching. Further considering
Content popularity the dynamic popularity of content and gain of caching, a realistic content value function is provided.
Cache gain When the cache space reaches the upper bound, for the router node, the existing content with
Content replacement
lower value will be replaced by newly arrived content with a higher value. Simulation results show
that, compared with the conventional least frequently used (LFU) and least recently used (LRU), the
proposed replacement strategy can effectively improve the space utilization and cache hit rate of router
nodes, as well as reduce the average hops of consumers’ content acquisition for 6G-CCN.
© 2020 Elsevier B.V. All rights reserved.

1. Introduction achieve unlimited caching of contents. Therefore, when the cache

The expansion of network scale and rise of new network
technologies have not only brought about a surge in business
traffic, but also have been accompanied by problems such as
network scalability, mobility, and security [1]. At the same time,
consumers are more concerned about the quality and speed of
contents acquisition than the source and transmission. The tradi-
tional solution is to build an overlay network at the application
layer, such as content distribution network (CDN) [2], peer-to-
peer network (P2P) [3] and vehicular network [4], which allevi-
ates the problem of content distribution and shares to a certain
extent, but not well adapted to various network applications. The
content-centric network (CCN) [5] takes contents as the center
of network, uses the name of content replaces the IP address as
the identification of content routing and forwarding, which has
become a typical representative of the new network architecture.
In CCN, each router node (referred to as router node (RN) here-
inafter) has a cache capability. By caching the content in an RN
closer to the consumer to satisfy subsequent consumers’ requests,
improve the content transmission rate, and reduce network over-
head [6]. Due to the limitation of cache space, it is difficult to
∗ Corresponding author.
E-mail addresses: jiyancheng@ntu.edu.cn (Y. Ji), 17110015@yjs.ntu.edu.cn
(X. Zhang), liuwenfei@hbpu.edu.cn (W. Liu), gzhang@ntu.edu.cn (G. Zhang).
space usage reaches the upper limit or the cached content is no
longer popular, the relatively minor contents need to be deleted
or replace to leave the space for more important or popular con-
tent. How to delete or update the cached content is the problem
that needs to be considered in the cache replacement strategy,
and it is also the focus and hot spot of CCN cache performance
improvement research.
Least Recently Used (LRU) [7] and Least Frequently Used
(LFU) [8] are the traditional replacement strategy in CCN. LRU
takes the interval between the current consumer’s request for
cached content and the last as the reference for the choice of
replacement content. If a content had recently been requested,
LRU thinks that it is more likely to be requested again in the
future, so using the newly arrived content to replace the one
that has not been requested for a long time. LRU is easier to
implement than other replacement strategies, but does not take
the actual popularity of content into account. A content with high
popularity is likely to be replaced by the newly arrived, even if
its popularity is not high. LFU believes that the frequency of con-
sumers request for content can be considered as the popularity
of contents. When the cache space of the RN reaches the upper
limit and new content arrives, the cached content with the least
frequency of requests will be replaced. LFU has a defect that the
cached content which was requested frequently in the past still
occupies cache space even if it is no longer popular, resulting

https://doi.org/10.1016/j.phycom.2020.101238
1874-4907/© 2020 Elsevier B.V. All rights reserved.
Y. Ji, X. Zhang, W. Liu et al.
in low cache space utilization. Similar to the first-in-first-out
principle of the queue, FIFO [9] replaces the first cached content.
The algorithm is simple, but the cache hit rate is low. SIZE [10]
preferentially replaces content with a large number of bytes, but
does not take the popularity of content into account, which may
cause the low-popular content of small bytes to remain in the
cache space for a long time, reducing the cache hit rate. LRU-
SP [11] considers the size and popularity of the content to try to
make the cache hit rate higher, which effectively reduces cache
pollution issues. Arianfar [12] proposed a random algorithm that
selects replacement content by requesting access history in the
last few seconds of each SRAM entry. Although this type of cache
replacement strategy is easy to implement, but it lacks purpose
and rationality. Wang proposed an improved Hetero [13] strategy
based on the Greedy Dual-Size strategy [14], where the Greedy
Dual-Size strategy comprehensively considers the content size,
cache cost and content age, and sets the weight for each content
in the cache space, replacing the content with the smallest weight
each time. However, this strategy does not consider the number
of times that the cached content has been accessed in the past.
This strategy takes the number of hops that a consumer needs
to take to obtain content as a cost, and replaces the least cost
content with each replacement. Although this strategy takes the
overhead of caching content into account and can reduce the cost
of content acquisition to a certain extent, but it does not take the
popularity of the content into account, which cannot reflect the
current situation of the content.
Clearly, LRU replaces the content that has not been requested
for the longest time. It is easy to see that the recently accessed
content has a higher probability of being accessed in the near
future. On the other hand, the proposed algorithm only con-
siders the time when the data object is requested during the
last time when the content is popular. When the distribution
changes, the adaptation performance will correspondingly de-
crease. By counting the request frequency of cached content in
the past period of time, LFU believes that the higher the fre-
quency, the higher the use value. Therefore, when the cache space
is insufficient, the content with the lowest request frequency is
always replaced. This algorithm has a cache pollution problem,
i.e., the content with high frequency in the past still occupies
the cache space even if it is no longer requested, which reduces
the utilization of the cache space. Although LRU and LFU take
the popularity of content into account and increase the hit rate
of cached to a certain extent, they ignore the dynamic changes
of popularity over time, and cannot reflect the current content
popularity in real time. In addition, they do not consider the
benefits of caching content. Based on these observations, this
paper proposes a novel replacement strategy based on content
popularity and cache gain (PGR). The proposed scheme combines
the time interval and frequency of requested content; adopts a
dynamic popularity estimation method to reduce the high oc-
cupancy of cache space caused by dynamic changes in content
popularity; and increases cache revenue to reduce network over-
head, enabling CCN network obtain higher cache performance.
The implementations and contributions of this manuscript are
summarized in the following:
• Considering the dynamic change of content popularity over
time, PGR considers the interval and frequency of consumers
requests to define content popularity, updates the content
popularity in real time, caches content that meets con-
sumer’s preferences in time, and keeps cached content fresh.
• The performance gain of caching contents is mainly deter-
mined by the cost of transmission and caching. PGR places
contents at the RNs which closer to the consumers to obtain
higher cache gains, and reduce network overhead.
2
Physical Communication 44 (2021) 101238
Fig. 1. The forwarding of Interest Packet.
• We compare the proposed PGR scheme with LRU and LFU
in terms of cache hit rate and the average hops of con-
sumers’ content acquisition. The simulation results show
that, the proposed PGR scheme outperforms the LRU and
LFU significantly, improve the overall performance of the
CCN.
The remainder of this paper is organized as follows. In Sec-
tion 2, we provide a brief discussion on CCN scheme. Section 3
includes the basis idea and design of the proposed PGR scheme.
Simulations and analytical results are presented in Section 4.
Finally, we conclude this work.
2. The architecture of CCN
The essential difference between CCN and TCP/IP is that, CCN
uses the name of content as an identifier for information trans-
mission. Consumers’ requests driven the network communica-
tions. In CCN, there is two types of transmission packets: Interest
Packet and Data Packet. The consumer sends an Interest Packet
carrying the requested content name and forwards it through
RNs. When the Interest Packet arrives at the content provider,
the Data Packet containing the requested content name, content,
and signature of the content provider will be sent to the con-
sumer along the reverse path with the Interest Packet routing
to meet the consumer’s needs. In the entire communication, nei-
ther the Interest Packet nor the Data Packet carries any address
information of host or interface.
Contents broadcasting in the network are mainly completed
by three key data structures: content store (CS), pending interest
table (PIT) and forwarding information base (FIB) [15]. The CS
caches the passing Data Packets to satisfy the subsequent Inter-
est Packets. The PIT is used to record the Interest Packets and
corresponding interface information that have been forwarded
but have not been met. By this way, CCN can achieve the same
information aggregation, avoid sending the same Interest Packets
frequently and wasting network resources. The FIB stores the
next-hop interface information that reaches the content provider
(source server or RN) and is used to complete the forwarding of
Interest Packets.
As shown in Fig. 1, when an Interested Packet arrives at a RN, it
is first checking whether the CS has cached the requested content.
If it has, the Data Packet will be sent to the consumer and the
Interest Packet will be discarded. Otherwise, check whether there
is the same entry in the PIT, and if so, add the arrival interface
information of the requested content to the PIT, and discard the
Interest Packets at the same time to achieve the aggregation
of the information. Otherwise, the maximum matching query is
performed in the FIB, according to the information of FIB, the
Interest Packet is forwarded to the next hop, and a new PIT table
is established.
Fig. 2 shows the forwarding of Data packet. When a RN re-
ceives a Data Packet, if it has the requested content in the CS, send
the Data Packet to the consumer without caching. Otherwise,
check whether the requested content entry exists in the PIT. If
it exists, forwarding the Data Packets to consumers according to
Y. Ji, X. Zhang, W. Liu et al.
Fig. 2. The forwarding of Data Packet.
the Interest Packet arrival interface information (one or more),
and deleting the entry in the PIT. The cache placement policy de-
termines whether caching the contents [16]. If no entry matching
the Data Packet is found in the PIT, it may be that the consumer
has abandoned the request or exceeds the life of the Interest
Packet, in these cases, discard the Data Packet directly.
The advantages of 6G-CCN can be summarized as: (1) The
data can be obtained from any cache, not from the fixed channel,
therefore, there is no data channel security in a CNN network.
(2) Compared with TCP/IP network, CCN has higher flexibility,
security and robustness without performance loss. (3) Due to the
ability of natural traffic regulation, when forwarding the data,
CCN can choose the forwarding strategy according to the link
condition to balance the whole network traffic. Therefore, one can
conclude that CCN will simplify and empower network efficiency
and improve the security, which is envisioned as a potential
networking candidate for future 6G communications. Moreover,
originally, researchers began to study how to use the charac-
teristics of SDN to deploy CCN problems from 2012. Currently,
a number of design solutions have been proposed, especially
the routing and caching technologies of CCN under SDN have
been fully developed. Therefore, it is believed that the proposed
scheme can be further applied in SDN.
3. The basic idea and design of PGR
The interval between consumers request for the content re-
flects the changes of consumers’ needs for cached content. If the
interval is short, it means that consumers request the content
more frequently and the popularity of the content is high. The
benefits of caching contents in RNs are determined by the cost of
transmission and caching. The closer to consumers, the least cost
of transmission, the more benefits of caching contents. Evaluate
the value of cached content by combining content popularity and
cache gains. When the space of the RN is saturated and new con-
tent arrives, the value of the content is calculated and compared
with the cached content. If it is greater than the minimum cached
content value, it is replaced with new content, otherwise forward
the new content directly to the consumer. It is worth noting that,
for the replacement, according to the time label of the content,
the time interval between the last two requests can be obtained,
and the current popularity of the content can be calculated by
combining the number of times the user requests the content in
the period. The higher the popularity, the more in line with con-
sumer preferences, the higher the possibility of being cached. The
proposed strategy takes the real-time changes of content pop-
ularity into account, and caches content that meets consumers’
preferences at RNs which closer to consumers. While increasing
the cache hit rate, it reduces the network traffic overhead and
improves the caching performance of 6G-CCN.
3.1. Content popularity
The popularity of content can clearly reflect the consumer’s
demand for content. In a static network environment, the popu-
larity of content is less affected by time. It is mainly determined
3
Physical Communication 44 (2021) 101238
by the frequency (number of times) that consumers request con-
tent. The higher the frequency (number of times), the more
popular the content is. However, in the actual network, the needs
of consumers are time-varying. For example, some contents are
affected by current affairs or unexpected situations in the current
period of time, causing consumers to pay more attention, but
as time goes by, consumers’ attention shifts, the content no
longer receives attention, and its popularity decreases. Therefore,
affected by current affairs or consumers needs, the popularity of
content changes dynamically, so a dynamic model of popularity
is needed to count the popularity of content in a cycle.
Using the estimation algorithm proposed in [17], the popu-
larity of content in the current cycle is calculated based on the
popularity of the content in the previous cycle and the number of
times the consumers requested the content in the current cycle.
pk (T ) = β × pk (T − 1) + (1 − β ) × fk , (1)
where pk (T ) represents the popularity of content k in the current
cycle, pk (T − 1) is the popularity of content k in the previous cycle,
fk is the number of content requests in the current cycle, β is the
attenuation factor, 0 < β < 1, which represents the proportion
of the previous cycle popularity in the current cycle.
3.2. Cache gain
Rather than forwarding consumers’ requests to the origin
server in traditional networks, in CCN consumers can directly
obtain contents from the RNs. Therefore, paying less cost of
caching can get more benefits, which reduce network traffic
overhead effectively.
The cost of contents delivery and caching determine the bene-
fits of caching contents. This paper mainly considers the number
of hops for contents transmission. Therefore, it is necessary to add
a field in the Interest Packet and the Data Packet to record the
number of hops that the content passes through in the network
transmission. The cost of content transmission is affected by
the distance between the RN and the consumer. The closer the
distance is, the less the number of hops for content acquisition,
the lower the transmission cost, and the higher the cache benefit.
Therefore, this point should also be considered when selecting
alternative content.
If the requested content k has not been cached within a certain
period, the cost of transmission of the requested content to be
forwarded to the consumer is:
Tk_0 (T ) = fk × pnk × HS , (2)
where pnkis the cost of one hop of content transmission, HS
indicates the number of hops from the consumer to source server.
The cost of caching required for the RN to cache the content k
is:
Ck (T ) = pnk × HR + psk , (3)
where psk
is the cost of caching contents in RN; HR represents the
number of hops from the cache node to the source server. When
the cache hit, the transmission cost of content k is:
Tk_1 (T ) = Ck (T ) + fk × pnk × (HS − HR )
= pnk × [fk × (HS − HR ) + HR ] + psk . (4)
Then, the benefits of caching content k in the RN during this
period is:
Gk (T ) = Tk_0 (T ) − T k_1(T )
= (fk − 1) × pnk × HR − psk (5)
From (5), it can be seen that the benefit of caching content is
affected by the content popularity and the distance from the node
to the consumer. The higher the content popularity and the closer
the consumer, the higher the cache gain.
Y. Ji, X. Zhang, W. Liu et al. Physical Communication 44 (2021) 101238

3.3. The calculation of cached content value Table 1

The processing of Interest Packet.

This paper designs a time tag for each content in RNs based on Algorithm 1: Set forward path

the LRU to record the time when the content was last accessed. Initialize tbefore , tnow , fk , pk (T ), Hs
for routing nodes on the delivery path from consumer
Assuming that tnow is the current time, tbefore is the most recent
to Source sever do
content request time, so the interval is: updata tbefore , tnow
HS ← HS + 1
tinterval = tnow − tbefore . (6) fk ← fk + 1
calculate pk (T )
Based on the above analysis, combining the content popularity
if content k in the CS
and cache gains, the value of content k can be obtained from: then send content back to the consumer
1 discard Interest Packet
Valk (T ) = pk (T ) + Gk (T ). (7) else
etinterval forward the Interest Packet to the next hop
From (7), it can be seen that the smaller tinterval , the greater the towards Source server
end if
probability of content being requested in the current period , so end for
the popularity of content becomes the major factor affecting the
value of content. On the contrary, the bigger tinterval , the lower
the content popularity. If the popularity of cached content within Table 2
The processing of Data Packet.
the RN is relatively small at this time, cached gain becomes an
Algorithm 2: Select the replaced content
important basis for selecting replacement content.
The proposed replacement strategy uses interval and fre- Initialize HR
for routing nodes on the delivery path from Source
quency of the requested content as important factors to deter-
sever to the consumer do
mine the popularity of the content. Update the popularity of if there is enough space
content in real time to ensure that the content in the RN is fresh. then cache the content k in cs
When the difference between content popularity is small, the else
cache gain determines whether the cached content is replaced. get tbefore , tnow , fk , pk (T ), HS , HR
calculate Valk
This strategy not only caches the content that has become more if Valk (T ) > Valmin (T )
popular in the future at RNs, improves the cache hit rate, but also then evict the content with v almin (T )
places the content at nodes closer to the consumer, reducing the and insert content k in CS
traffic overhead in the network. else
forward the Data Packet to the next hop
towards the consumer
3.4. The algorithm flow of the proposed strategy end if
end if
The proposed algorithms are shown in Tables 1 and 2, for end for
interest packet and data packet respectively. For the interest
packet, when it reaches the routing node, update tnow , tbefore , Hs Table 3
and fk calculate pk (T ). Check the CS, if there is request content, Simulation parameters.
return the data packet, otherwise forward the interest packet Parameter Default value Variation range
to the next hop node. On the other hand, for the data packet, Routing nodes 50 –
when it arrives the cache node, if there is enough space to cache, Links 150 –
the content is cached. Otherwise, the cache value of the arriving Bandwidth/Mbps 10 –
content is calculated. If the value is greater than the minimum Contents 10 000 –
Consumers 18 –
cached content, the content is replaced, otherwise it is directly
Source server 1 –
forwarded to the next hop node. Attenuation factor (β ) 0.4 –
Moreover, in these two algorithms, each cached content in the Cache size 10% 2% ∼ 20%
cache space has its cache value. When the cache space reaches Zipf–Mandelbrot (α ) 0.7 0.3 ∼ 1.7
the upper limit and new content arrives, compare the value of Simulation time/s 100 –
Cycle (T)/s 5 –
contents, the content with the smallest cache value is replaced to
meet the storage requirements of the new content. The pseudo
code of the proposed strategy PGR cache replacement algorithm
is as follows: arrival rate obeys the Poisson distribution, λ = 100 req/s. For the
convenience of research, the cache space size of each RN is the
4. Performance analysis and simulation results same, the default is 10% of the total content, and the variation
range is 2% ∼ 20%. The main simulation parameters are shown
4.1. Simulation platform and parameter settings in Table 3. Taking LCE [20] as the cache placement strategy,
comparing the proposed PGR scheme with LRU and LFU.
The simulation environment ndnSIM [18] is a simulation mod-
ule based on NS-3. This module can realize the simulation of the 4.2. Simulation performance index
basic functions of NDN, and can modify the code to replace the
cache and routing strategy. The results are imported into MATLAB This paper mainly uses two indicators to evaluate the impact
for curve drawing and performance analysis. of different parameters on system performance:
The randomly generated network topology is used as the
simulation topology. The total amount of contents in the network (1) Cache hit ratio (CHR): Refer to the probability that the
is 10,000, and each content has the same size. Its popularity consumer request is satisfied by cache nodes instead of
follows the Zipf–Mandelbrot [19] distribution, that the default the source server. It is a typical parameter that reflects
parameter α = 0.7, changes from 0.3 to 1.7. The content request the performance of the cache strategy. The more times
4
Y. Ji, X. Zhang, W. Liu et al. Physical Communication 44 (2021) 101238

Fig. 3. Change in cache hit rate with cache size (α = 0.7).

Fig. 4. Change in average hop count with cache size (α = 0.7).

a consumer’s request to be hit on a RN, the higher the
cache hit rate, which can reduce the load on the side of
source server and improve system performance. Therefore,
we have
n
CHR = , (8)
N
where n represents the number of requests satisfied by
cache nodes, N equals to the total number of contents
requested by consumers.
(2) Average hop count: Refer to the number of hops a con-
sumer takes to get content from a RN or source server. It
5
reflects the distance between the RN and the consumer.
The closer the RN is to consumers, the smaller the number
of hops for consumers to obtain content. This improves the
user experience and reduces network traffic overhead.
4.3. Result analysis
(1) The impact of cache size
Figs. 3 and 4 show that, the cache hit rate and average hop
count are changed with the cache size of the RN when the Zipf–
Mandelbrot distribution parameter α = 0.7. It can be seen from
Fig. 3 that the cache hit rate of the three replacement strategies
Y. Ji, X. Zhang, W. Liu et al.
Fig. 5. Change of cache hit rate with parameter α (cache size is 10% of the total content).
increases with the increase of cache size. The cache hit rate of
the proposed PGR strategy is always higher than LRU and LFU.
As the cache size of a RN increases, the number of contents that
can be cached increases, resulting in a decrease in the number
of consumers requests met by the source server, and the cached
contents hit rate increases. When the cache space reaches the
upper limit, the LRU replaces the content that has not been
requested for a long time with the newly arrived content. The
LRU ignores the popularity of the newly arrived content, and it
may happen that the content with low popularity replaces the
content with high popularity. The LFU takes the number of times
a consumer requests content as content popularity, and high
popularity content replaces low popularity content, but ignores
the popularity changing over time. The early popular content will
be ‘‘expire", but because the popularity of new content is always
lower than it, it always exists at the RN, wasting cache space.
The proposed PGR strategy controls the content popularity with
the interval of requested content. The smaller the interval be-
tween two content requests, the more frequently the consumers
requests the content and the higher the content popularity, so
that the highly popular content is always kept at the RN. This
guarantees that consumers’ requests can be satisfied quickly, and
the hit rate of cached content increases accordingly.
Fig. 4 shows that the average hop count decreases with the
increase in cache size. The larger the cache space allocated to
the RN, the more contents the consumers get from nodes, and
the number of content acquisition hops decreases. The average
hop count of the proposed PGR strategy is significantly smaller
than LFU and LRU, because the strategy takes cache gains into
account. When the popularity of each cached content in the RN
is not much different, the value of the cached content is mainly
determined by the cache gains. The closer to the consumer, the
higher the cache gain, avoiding replacing the content near the
consumer and reducing the number of content acquisition hops.
(2) The impact of Zipf–Mandelbrot distribution parameter α
Figs. 5 and 6 show the changes of cache hit rate and average
hop count with parameter α when the cache size is set to 10% of
6
Physical Communication 44 (2021) 101238
the total content. As can be seen from Fig. 5, when the parameter
α value is small, the popularity of the content is distributed
widely, the popularity of each content is not much different, and
the consumers’ preference for the content are not obvious, so
the content is scattered and cached at RNs in the network. The
LRU and the LFU are based on the content request interval or
content request frequency. It is not sensitive to the changes of
time, cannot accurately quantify the content popularity, resulting
in the RNs caching a large amount of ‘‘outdated" contents, and
the cache hit rate is low. The distribution of content popularity
becomes concentrated as the parameter α increases. Consumers’
preferences are concentrated on a small number of highly popular
content. Therefore, only a small number of less popular content
needs to be provided by the source server, and the cache hit rate
increases. The cache hit rates of the three replacement strategies
also increase as the parameter α increases, but the performance
of the proposed PGR strategy is always better than the other
two. The bigger parameter α , the more obvious the advantage.
This is because the PGR takes the characteristics of popularity
changes with time into account, uses the content request interval
to control the cached content to keep them fresh. It can also be
seen from Fig. 6 that with the increase of the parameter α , the
content popularity distribution is concentrated, the cache space
of routing nodes is effectively used, and the average hop count
decreases as the cache hit rate increases.
5. Conclusions
Since that the cached content needs to be deleted and replaced
when the cache capacity is full in CCN, this paper proposed
a replacement strategy based on content popularity and cache
gain to overcome this issue. The proposed PGR strategy reflects
the change of content popularity with time through the content
request interval, and cache gains control the distance between
contents and consumers. Simulation results showed that the per-
formance of the proposed PGR strategy in terms of the cache
hit rate and average hop count is better than the LRU and LFU
Y. Ji, X. Zhang, W. Liu et al.
Fig. 6. Change of average hop count with parameter α (cache size is 10% of the total content).
schemes. Moreover, for CCN networks, the replacement strategy
has attracted much attention from researchers, but the researches
on the content popularity were based on the entire content,
ignoring the difference between the content chunks, i.e., the
climax part of a song is more popular than the others. In our
future work, we will take the difference popularity between the
content chunks to improve the dynamic characteristics of content
popularity.
Declaration of competing interest
The authors declare that they have no known competing finan-
cial interests or personal relationships that could have appeared
to influence the work reported in this paper.
Acknowledgment
This work was supported by the National Natural Science
Foundation of China under Grant 61971245.
References
[1] J. Pan, R. Jain, S. Paul, et al., MILSA: A new evolutionary architecture for
scalability, mobility, and multihoming in the future internet, IEEE J. Sel.
Areas Commun. 28 (8) (2010) 1344–1362.
[2] J. Choi, J. Han, E. Cho, et al., A survey on content-oriented networking for
efficient content delivery, IEEE Commun. Mag. 49 (3) (2011) 121–127.
[3] A. Morse, Peer-to-peer crowdfunding: Information and the potential for
disruption in consumer lending, Soc. Sci. Electron. Publ. 7 (1) (2015)
463–482.
[4] W. Duan, et al., Emerging technologies for 5G-IoV networks: Applications,
trends and opportunities, IEEE Netw. 34 (5) (2020) 283–289.
[5] V. Jacobson, D.K. Smetters, J.D. Thronton, et al., Networking named content,
in: Proceeding of the 5th International Conference on Emerging Network-
ing Experiments and Technologies (CoNEXT09), Rome, Italy, 2009, pp.
1–12.
[6] J. Zhang, W. Xie, F. Yang, et al., Mobile edge computing and application in
traffic offloading, Telecommun. Sci. 32 (7) (2016) 132–139.
[7] M. Weng, Y. Shang, Y. Tian, The design and implementation of LRU-based
web cache, in: Communications and Networking in China (CHINACOM),
2013 8th International ICST Conference on, IEEE Computer Society, 2013.
7
Physical Communication 44 (2021) 101238
[8] L.B. Sokolinsky, LFU-K: An effective buffer management replacement al-
gorithm, in: International Conference on Database System for Advanced
Applications, Berlin Heidelberg, Germany, 2004, pp. 670–681.
[9] G. Carofiglio, M. Gallo, L. MUscariello, Bandwidth and storage sharing
performance in information centric networking, in: Proceeding of the 2011
ACM SIGCOMM Conference, ACM, New York, 2011, pp. 1–6.
[10] T. Ma, W. Tian, B. Wang, et al., Weather data sharing system: an
agent-based distributed data management, IET Softw. 5 (1) (2011) 21–31.
[11] C. Kai, Y. Kanbayashi, LRU-SP: A Size-Adjusted and Popularity-Aware LRU
Replacement Algorithm for Web Caching, IEEE Computer Society, 2000, pp.
48–53.
[12] S. Arianfar, P. Nikander, J. Ott, et al., On content-centric router design and
implications, in: Re-Arichitecting the Internet Workshop, ACM, 2010, pp.
1–6.
[13] J. Wang, B. Bensaou, Improving content-centric networks performance
with progressive diversity-load driven caching, in: Proceedings of the
2012 1st IEEE International Conference on Communications in China, IEEE,
Piscataway, 2012, pp. 85–90.
[14] P. Cao, S. Irani, Cost-aware WWW proxy caching algorithms, in: Proceed-
ings of the USENIX Symposium on Internet Technologies and Systems,
USENIX Association, Berkeley, 1997, pp. 193–206.
[15] B. Ahlgren, C. Dannewitz, C. Imbrenda, et al., A survey of information-
centric networking, IEEE Commun. Mag. 50 (7) (2012) 26–36.
[16] M. Zhang, H. Luo, H. Zhang, A survey of caching mechanisms in
information-centric networking, IEEE Commun. Surv. Tutor. 17 (3) (2015)
1473–1499.
[17] Y. Zhang, J. Zhao, G. Cao, Roadcast: A popularity aware content sharing
scheme in vanets, ACM SIGMOBILE Mobile Comput. Commun. Rev. 13 (4)
(2010) 1–14.
[18] S. Mastorakis, A. Afanasyev, I. Moiseenko, et al., NdnSIM 2.0: A New
Version of the NDN Simulator for NS-3: NDN-0028, Xerox Palo Alto
Research Center, Palo Alto, USA, 2015.
[19] Q. Jiang, C. Tan, C. Phang, Understanding Chinese online users and their
visits to websites: Application of Zipf’s law, Int. J. Inf. Manage. 33 (5) (2013)
752–763.
[20] N. Laoutaris, S. Syntila, I. Stavrakakis, Meta algorithms for hierarchical web
caches, in: Proceedings of IEEE International Conference on Performance,
Computing, and Communications, IEEE Press, Washington D. C, USA, 2004,
pp. 445–452.
Y. Ji, X. Zhang, W. Liu et al.
Yancheng Ji, Doctor of communication and informa-
tion system, Graduated from the Xidian University
in 2011. He is currently an Associate professor at
the School of Electronics and Information, Nantong
University. His research interests include wireless com-
munication networks, cooperative communication, and
non-orthogonal multiple-access technology.
Xiao Zhang, Graduated from the Nantong University in
2017. Working towards her master’s degree in School
of Electronics and Information, Nantong University. Her
research interests include GPU parallel processing and
Content-Centric network.
Physical Communication 44 (2021) 101238
Wenfei Liu, the master of foreign linguistics and ap-
plied linguistics from Hubei University of Technology
in 2008. He is currently a lecturer in School of Foreign
Languages in Hubei Polytechnic University. His research
interests focus on the translation theory and practice.
Guoan Zhang, Doctor of communication and informa-
tion system, Graduated from the Southeast University
in 2002. He is currently a Professor at the School
of Electronics and Information, Nantong University.
His research interests include wireless communica-
tion networks, and software radio communication
algorithm.