Abstract

Content-Centric Networking (CCN), one of the most promising Future Internet architectures, is ahot research topic because of its advantages of content delivery over the Internet. Based on the Least RecentlyUsed (LRU) replacement policy in CCN, the closed-form expression of the miss-probability is first derived byconsidering the sequence of arriving requests under single cache scenario, and then extended to linear andbinary tree topologies. Consequently, the virtual round trip time (VRTT) is determined to be influenced bycache capacity and link bandwidth. The simulation results show that the proposed miss-probability modelaccords with realistic CCN network conditions, being much better than the existing model.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.