Content discovery for information-centric networking
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lee, Munyoung | - |
dc.contributor.author | Song, Junghwan | - |
dc.contributor.author | Cho, Kideok | - |
dc.contributor.author | Pack, Sangheon | - |
dc.contributor.author | Kwon, Ted Taekyoung | - |
dc.contributor.author | Kangasharju, Jussi | - |
dc.contributor.author | Choi, Yanghee | - |
dc.date.accessioned | 2021-09-04T15:16:07Z | - |
dc.date.available | 2021-09-04T15:16:07Z | - |
dc.date.created | 2021-06-16 | - |
dc.date.issued | 2015-06-04 | - |
dc.identifier.issn | 1389-1286 | - |
dc.identifier.uri | https://scholar.korea.ac.kr/handle/2021.sw.korea/93285 | - |
dc.description.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. (C) 2014 Elsevier B.V. All rights reserved. | - |
dc.language | English | - |
dc.language.iso | en | - |
dc.publisher | ELSEVIER SCIENCE BV | - |
dc.title | Content discovery for information-centric networking | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Pack, Sangheon | - |
dc.identifier.doi | 10.1016/j.comnet.2014.10.006 | - |
dc.identifier.scopusid | 2-s2.0-84946103991 | - |
dc.identifier.wosid | 000357227000001 | - |
dc.identifier.bibliographicCitation | COMPUTER NETWORKS, v.83, pp.1 - 14 | - |
dc.relation.isPartOf | COMPUTER NETWORKS | - |
dc.citation.title | COMPUTER NETWORKS | - |
dc.citation.volume | 83 | - |
dc.citation.startPage | 1 | - |
dc.citation.endPage | 14 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalResearchArea | Engineering | - |
dc.relation.journalResearchArea | Telecommunications | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Hardware & Architecture | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Information Systems | - |
dc.relation.journalWebOfScienceCategory | Engineering, Electrical & Electronic | - |
dc.relation.journalWebOfScienceCategory | Telecommunications | - |
dc.subject.keywordAuthor | Information-centric networking | - |
dc.subject.keywordAuthor | Content discovery | - |
dc.subject.keywordAuthor | Bloom filter | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
145 Anam-ro, Seongbuk-gu, Seoul, 02841, Korea+82-2-3290-2963
COPYRIGHT © 2021 Korea University. All Rights Reserved.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.