Probability-based heuristic content placement method for ICN caching

A probability-based heuristic caching strategy(PCP)was proposed.The major idea was that relevant informa-tion was collected when the interest and data packet are transmitted.When the data packet is returned back,on-path cache nodes decide whether to cache the content with certain probability.The pro...

Full description

Bibliographic Details
Published in:Tongxin xuebao
Main Authors: Hai-bo WU, Jun LI, Jiang ZHI
Format: Article
Language:Chinese
Published: Editorial Department of Journal on Communications 2016-05-01
Subjects:
Online Access:http://www.joconline.com.cn/thesisDetails#10.11959/j.issn.1000-436x.2016093
_version_ 1849688060963323904
author Hai-bo WU
Jun LI
Jiang ZHI
author_facet Hai-bo WU
Jun LI
Jiang ZHI
author_sort Hai-bo WU
collection DOAJ
container_title Tongxin xuebao
description A probability-based heuristic caching strategy(PCP)was proposed.The major idea was that relevant informa-tion was collected when the interest and data packet are transmitted.When the data packet is returned back,on-path cache nodes decide whether to cache the content with certain probability.The probability is associated with the content popu-larity and placement benefit,i.e.,proportional to content popularity and content placement benefit.The experimental re-sults indicate PCP can achieve salient performance gain in terms of cache service ratio,cache hit ratio,access latency ra-tio,compared with current strategies.Meanwhile,PCP's overhead is affordable.
format Article
id doaj-art-2b65157161ea4e2b8ec450f2e1b2dec4
institution Directory of Open Access Journals
issn 1000-436X
language zho
publishDate 2016-05-01
publisher Editorial Department of Journal on Communications
record_format Article
spelling doaj-art-2b65157161ea4e2b8ec450f2e1b2dec42025-08-20T02:09:31ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2016-05-0137627259700923Probability-based heuristic content placement method for ICN cachingHai-bo WUJun LIJiang ZHIA probability-based heuristic caching strategy(PCP)was proposed.The major idea was that relevant informa-tion was collected when the interest and data packet are transmitted.When the data packet is returned back,on-path cache nodes decide whether to cache the content with certain probability.The probability is associated with the content popu-larity and placement benefit,i.e.,proportional to content popularity and content placement benefit.The experimental re-sults indicate PCP can achieve salient performance gain in terms of cache service ratio,cache hit ratio,access latency ra-tio,compared with current strategies.Meanwhile,PCP's overhead is affordable.http://www.joconline.com.cn/thesisDetails#10.11959/j.issn.1000-436x.2016093information-centric networking;in-network caching;content placement;cooperative caching
spellingShingle Hai-bo WU
Jun LI
Jiang ZHI
Probability-based heuristic content placement method for ICN caching
information-centric networking;in-network caching;content placement;cooperative caching
title Probability-based heuristic content placement method for ICN caching
title_full Probability-based heuristic content placement method for ICN caching
title_fullStr Probability-based heuristic content placement method for ICN caching
title_full_unstemmed Probability-based heuristic content placement method for ICN caching
title_short Probability-based heuristic content placement method for ICN caching
title_sort probability based heuristic content placement method for icn caching
topic information-centric networking;in-network caching;content placement;cooperative caching
url http://www.joconline.com.cn/thesisDetails#10.11959/j.issn.1000-436x.2016093
work_keys_str_mv AT haibowu probabilitybasedheuristiccontentplacementmethodforicncaching
AT junli probabilitybasedheuristiccontentplacementmethodforicncaching
AT jiangzhi probabilitybasedheuristiccontentplacementmethodforicncaching