Skip to main content

CCN Hotspot Cache Placement Strategy Based on Genetic Algorithm

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 10658))

Abstract

Content-centric networks provide effective support for content services through a caching mechanism, so the caching of the placement strategy has become a hot research. In this paper, the problem of content placement in CCN is taken as the starting point, focusing on the allocation of caching resources for district partitioning according to the number of users given the content of predictable hotspots. When the hot topic breaks out, the first to the user from the content of the nearest as the goal, from the user’s point of view as its characteristics, nested using improved genetic algorithms to select hotspot cache placement points, and a CCN hotspot cache placement strategy based on genetic algorithm is proposed. In the simulation experiment, the cache placement strategy proposed in this paper is compared with other traditional strategies in network performance. The simulation results show that the strategy can effectively reduce the access hops and average access latency, reduce the server load and improve the user satisfaction.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Xu, G.: Content center network cache placement strategy. Beijing University of Posts and Telecommunications (2015)

    Google Scholar 

  2. Li, Y., Lin, T., Tang, H., et al.: A chunk caching location and searching scheme in content centric networking, pp. 2655–2659. IEEE (2012)

    Google Scholar 

  3. Cui, X., Liu, J.: Code strategy in content center network based on node and replacement rate. J. Electron. Inf. Technol. 36(01), 1–7 (2014)

    Google Scholar 

  4. Cho, K., Lee, M., Park, K., et al.: Wave: popularity-based and collaborative in-network caching for content-oriented networks. In: Proceedings of IEEE Conference on Computer Communications Workshops, pp. 316–321. IEEE (2012)

    Google Scholar 

  5. Psaras, I., Chai, W.K., Pavlou, G.: Probabilistic in-network caching for information - centric networks. In: Proceedings of the Second Edition of the ICN Workshop on Information-Centric Networking, pp. 55–60. ACM (2012)

    Google Scholar 

  6. Hu, Q., Wu, M.: A caching random placement strategy for content center networks. J. Xidian Univ. 41(06), 131–136 + 187 (2014)

    Google Scholar 

  7. Liu, T.: Study on time-delay optimization technology of network access in content center. Information Engineering University, PLA (2013)

    Google Scholar 

  8. Laoutaris, N., Syntila, S., Stavrakakis, I.: Meta algorithms for hierarchical web caches. In: Proceedings of IEEE International Conference on Performance, Computing, and Communications, pp. 445–452. IEEE (2004)

    Google Scholar 

  9. Laoutaris, N., Che, H., Stavrakakis, I.: The LCD interconnection of LRU caches and its analysis. Perform. Eval. 63(7), 609–634 (2006)

    Article  Google Scholar 

  10. Guo, C., Hui, Y., Ming, Z.: Design and implementation of cooperative cache strategy for opportunity network node. Comput. Eng. 36(18), 85–87 (2010)

    Google Scholar 

  11. Altmeyer, S., Cucu-Grosjean, L., Davis, R.I., et al.: Progress on Static Probabilistic Timing Analysis for Systems with Random Cache Replacement Policies (2013)

    Google Scholar 

  12. Shuqiang, H., Gaocai, W.: Study on optimization scheme of wireless network node deployment in smart city. J. Comput. Res. Dev. 51(02), 278–289 (2014)

    Google Scholar 

  13. Xiandong, C., Jiang, L., et al.: Caching strategy of content center network based on node number and replacement rate. J. Electron. Inf. Technol. 36(01), 1–7 (2014)

    Google Scholar 

  14. Shuqiang, H., Gaocai, W., et al.: A method of geometric k-center gateway deployment of wireless mesh networks. Chin. J. Comput. 36(7), 1475–1484 (2013)

    MathSciNet  Google Scholar 

  15. Ximing, L., Chan, Z., Donghuang, Y.: Novel genetic algorithm based on species selection for solving constrained nonlinear programming problem. Central South Univ.: Nat. Sci. Ed. 40(1), 185–189 (2009)

    Google Scholar 

Download references

Acknowledgments

This research is supported in part by the National Natural Science Foundation of China under Grant No. 61562006, in part by the Natural Science Foundation of Guangxi Province under Grant No. 2016GXNSFBA380181 and in part by the Key Laboratory of Guangxi University.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Hongjia Wu .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Wu, H., Wang, N., Wang, G. (2017). CCN Hotspot Cache Placement Strategy Based on Genetic Algorithm. In: Wang, G., Atiquzzaman, M., Yan, Z., Choo, KK. (eds) Security, Privacy, and Anonymity in Computation, Communication, and Storage. SpaCCS 2017. Lecture Notes in Computer Science(), vol 10658. Springer, Cham. https://doi.org/10.1007/978-3-319-72395-2_32

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-72395-2_32

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-72394-5

  • Online ISBN: 978-3-319-72395-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics