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

dc.contributor.authorPraphan Pavarangkoon
dc.contributor.authorShohei Nakajima
dc.contributor.authorNattapong Kitsuwan
dc.date.accessioned2026-05-08T19:23:15Z
dc.date.issued2023-1-11
dc.description.abstractThis 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.
dc.identifier.doi10.1109/icoin56518.2023.10048983
dc.identifier.urihttps://dspace.kmitl.ac.th/handle/123456789/18959
dc.subjectCaching and Content Delivery
dc.subjectCooperative Communication and Network Coding
dc.subjectPeer-to-Peer Network Technologies
dc.titleCache Node Placement Scheme Considering Maximum Traffic in Content-Centric Networks
dc.typeArticle

Files

Collections