Abstract
The information-centric networking (ICN) adopts a content name as a network identifier and utilizes in-network storages to cache the contents. With the name-based routing and content caching, ICN can provide substantial benefits such as faster content retrieval and network traffic reduction by exploiting a nearby (cached) copy of content and reducing duplicated transmissions for the same content request. Prior researches on ICN usually rely on an opportunistic cache-hit (happen-to-meet) to utilize the in-network storages. In the happen-to-meet fashion, only the content cached on the path towards the content source can be utilized, which limits the network-wide usage of the in-network storages. To exploit cached contents better, we propose a content discovery scheme, dubbed SCAN, which can exploit nearby content copies for the efficient delivery. SCAN exchanges the cached content information among the neighbor routers using Bloom filters for the content discovery. With extensive simulations, SCAN shows better performance than a happen-to-meet cache-hit scheme in terms of average hop counts, traffic volume, and load balancing among links.
| Original language | English |
|---|---|
| Pages (from-to) | 1-14 |
| Number of pages | 14 |
| Journal | Computer Networks |
| Volume | 83 |
| DOIs | |
| Publication status | Published - 2015 |
Fingerprint
Keywords
- Bloom filter
- Content discovery
- Information-centric networking
ASJC Scopus subject areas
- Computer Networks and Communications
Cite this
Content discovery for information-centric networking. / Lee, Munyoung; Song, Junghwan; Cho, Kideok; Pack, Sangheon; Kwon, Ted; Kangasharju, Jussi; Choi, Yanghee.
In: Computer Networks, Vol. 83, 2015, p. 1-14.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - Content discovery for information-centric networking
AU - Lee, Munyoung
AU - Song, Junghwan
AU - Cho, Kideok
AU - Pack, Sangheon
AU - Kwon, Ted
AU - Kangasharju, Jussi
AU - Choi, Yanghee
PY - 2015
Y1 - 2015
N2 - The information-centric networking (ICN) adopts a content name as a network identifier and utilizes in-network storages to cache the contents. With the name-based routing and content caching, ICN can provide substantial benefits such as faster content retrieval and network traffic reduction by exploiting a nearby (cached) copy of content and reducing duplicated transmissions for the same content request. Prior researches on ICN usually rely on an opportunistic cache-hit (happen-to-meet) to utilize the in-network storages. In the happen-to-meet fashion, only the content cached on the path towards the content source can be utilized, which limits the network-wide usage of the in-network storages. To exploit cached contents better, we propose a content discovery scheme, dubbed SCAN, which can exploit nearby content copies for the efficient delivery. SCAN exchanges the cached content information among the neighbor routers using Bloom filters for the content discovery. With extensive simulations, SCAN shows better performance than a happen-to-meet cache-hit scheme in terms of average hop counts, traffic volume, and load balancing among links.
AB - The information-centric networking (ICN) adopts a content name as a network identifier and utilizes in-network storages to cache the contents. With the name-based routing and content caching, ICN can provide substantial benefits such as faster content retrieval and network traffic reduction by exploiting a nearby (cached) copy of content and reducing duplicated transmissions for the same content request. Prior researches on ICN usually rely on an opportunistic cache-hit (happen-to-meet) to utilize the in-network storages. In the happen-to-meet fashion, only the content cached on the path towards the content source can be utilized, which limits the network-wide usage of the in-network storages. To exploit cached contents better, we propose a content discovery scheme, dubbed SCAN, which can exploit nearby content copies for the efficient delivery. SCAN exchanges the cached content information among the neighbor routers using Bloom filters for the content discovery. With extensive simulations, SCAN shows better performance than a happen-to-meet cache-hit scheme in terms of average hop counts, traffic volume, and load balancing among links.
KW - Bloom filter
KW - Content discovery
KW - Information-centric networking
UR - http://www.scopus.com/inward/record.url?scp=84946103991&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84946103991&partnerID=8YFLogxK
U2 - 10.1016/j.comnet.2014.10.006
DO - 10.1016/j.comnet.2014.10.006
M3 - Article
AN - SCOPUS:84946103991
VL - 83
SP - 1
EP - 14
JO - Computer Networks
JF - Computer Networks
SN - 1389-1286
ER -