Repository logo
Communities & Collections
Research Outputs
Fundings & Projects
People
Statistics
New user? Click here to register.Have you forgotten your password?
  1. Home
  2. KMITL
  3. Publication
  4. Cache Node Placement Scheme Considering Maximum Traffic in Content-Centric Networks
Loading...
Thumbnail Image

Cache Node Placement Scheme Considering Maximum Traffic in Content-Centric Networks

Author(s)
Pavarangkoon, Praphan
Nakajima, Shohei
Kitsuwan, Nattapong
Date Issued
January 1, 2023
Type
Conference Paper
DOI
10.1109/ICOIN56518.2023.10048983
Abstract
This paper proposes a cache node placement scheme considering the maximum traffic in content-centric networks (CCNs). The cache node placement problem is considered to satisfy the user's requirement in CCNs. Traffic utilization is one of the most common requirements. Reduced traffic allows more additional traffic on links. In this paper, a scheme to minimize the maximum traffic and the number of hops is proposed. The mathematical model for the cache node placement problem is formulated. The dynamic routing is considered in this model. Numerical result shows that the proposed scheme outperforms the conventional scheme. It suggests that the proposed scheme provides reference values to support the implementation of heuristic algorithms for the cache node placement problem.
Citation
International Conference on Information Networking, 2023-January, 393-395, 2023
Subjects

Content-centric netwo...

maximum traffic

optimization

Metrics
Get Involved!
  • Source Code
  • Documentation
  • Slack Channel
Make it your own

DSpace-CRIS can be extensively configured to meet your needs. Decide which information need to be collected and available with fine-grained security. Start updating the theme to match your Institution's web identity.

Need professional help?

The original creators of DSpace-CRIS at 4Science can take your project to the next level, get in touch!

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science

  • Accessibility settings
  • Privacy policy
  • End User Agreement
  • Send Feedback