Prioritized probabilistic caching algorithm in content centric networks
Conference proceedings article
ผู้เขียน/บรรณาธิการ
กลุ่มสาขาการวิจัยเชิงกลยุทธ์
ไม่พบข้อมูลที่เกี่ยวข้อง
รายละเอียดสำหรับงานพิมพ์
รายชื่อผู้แต่ง: Sirichotedumrong W., Kumwilaisak W., Tarnoi S., Thatphithakkul N.
ผู้เผยแพร่: Springer
ปีที่เผยแพร่ (ค.ศ.): 2016
Volume number: 463
หน้าแรก: 255
หน้าสุดท้าย: 265
จำนวนหน้า: 11
ISBN: 9783319404141
นอก: 2194-5357
eISSN: 2194-5357
ภาษา: English-Great Britain (EN-GB)
บทคัดย่อ
We propose a new prioritized probabilistic caching scheme for content-centric networks (CCN) to selectively cache more important data more than the others by using heterogeneous caching probabilities. The proposed caching algorithm is used along with Least Recently Used (LRU) cache replacement policy. The caching algorithm allows each CCN node to cache data based on popularity and priority of the data. The popularity of data is determined based on the number of corresponding interest packets sent by content requesters. The priority of data is dictated by the influence of the data to the quality of content reconstructed from the data. With these popularity and priority, the caching probability can be computed by weighing summation. We conduct computer simulations to evaluate the performance of the proposed caching algorithm. Results show that the proposed caching algorithm outperforms a universal caching scheme in terms of content quality at a requester and caching performance such as cache-hit percentage and server load reduction. ฉ Springer International Publishing Switzerland 2016.
คำสำคัญ
Caching probability, Content-centric networks, Prioritized probabilistic caching scheme, Universal caching scheme
ติดต่อสอบถามเพิ่มเติมได้ที่