An Efficient Probe-Based Routing for Content-Centric Networking

With the development of new technologies and applications, such as the Internet of Things, smart cities, 5G, and edge computing, traditional Internet Protocol-based (IP-based) networks have been exposed as having many problems. Information-Centric Networking (ICN), Named Data Networking (NDN), and C...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Sensors (Basel, Switzerland) Jg. 22; H. 1; S. 341
Hauptverfasser:	Tsai, Pei-Hsuan, Zhang, Jun-Bin, Tsai, Meng-Hsun
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Switzerland MDPI AG 04.01.2022 MDPI
Schlagworte:	Algorithms Analysis content exploration Content provider Content-Centric Networking Information services Information services industry Information-Centric Networking Innovations Interfaces Internet Internet of Things Internet Protocol Investigations Named Data Networking next generation networking Response time Routers routing Traffic congestion Transmission Control Protocol/Internet Protocol (Computer network protocol) content exploration Information-Centric Networking routing next generation networking Content-Centric Networking Named Data Networking
ISSN:	1424-8220, 1424-8220
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Abstract	With the development of new technologies and applications, such as the Internet of Things, smart cities, 5G, and edge computing, traditional Internet Protocol-based (IP-based) networks have been exposed as having many problems. Information-Centric Networking (ICN), Named Data Networking (NDN), and Content-Centric Networking (CCN) are therefore proposed as an alternative for future networks. However, unlike IP-based networks, CCN routing is non-deterministic and difficult to optimize due to frequent in-network caching replacement. This paper presents a novel probe-based routing algorithm that explores real-time in-network caching to ensure the routing table storing the optimal paths to the nearest content provider is up to date. Effective probe-selections, Pending Interest Table (PIT) probe, and Forwarding Information Base (FIB) probe are discussed and analyzed by simulation with different performance measurements. Compared with the basic CCN, in terms of qualitative analysis, the additional computational overhead of our approach is O(NCS + Nrt + NFIB ∗ NSPT) and O(NFIB) on processing interest packets and data packets, respectively. However, in terms of quantitative analysis, our approach reduces the number of timeout interests by 6% and the average response time by 0.6 s. Furthermore, although basic CCN and our approach belong to the same Quality of Service (QoS) category, our approach outperforms basic CCN in terms of real values. Additionally, our probe-based approach performs better than RECIF+PIF and EEGPR. Owing to speedup FIB updating by probes, our approach provides more reliable interest packet routing when accounting for router failures. In summary, the results demonstrate that compared to basic CCN, our probe-based routing approach raises FIB accuracy and reduces network congestion and response time, resulting in efficient routing.
AbstractList	With the development of new technologies and applications, such as the Internet of Things, smart cities, 5G, and edge computing, traditional Internet Protocol-based (IP-based) networks have been exposed as having many problems. Information-Centric Networking (ICN), Named Data Networking (NDN), and Content-Centric Networking (CCN) are therefore proposed as an alternative for future networks. However, unlike IP-based networks, CCN routing is non-deterministic and difficult to optimize due to frequent in-network caching replacement. This paper presents a novel probe-based routing algorithm that explores real-time in-network caching to ensure the routing table storing the optimal paths to the nearest content provider is up to date. Effective probe-selections, Pending Interest Table (PIT) probe, and Forwarding Information Base (FIB) probe are discussed and analyzed by simulation with different performance measurements. Compared with the basic CCN, in terms of qualitative analysis, the additional computational overhead of our approach is O(NCS + Nrt + NFIB ∗ NSPT) and O(NFIB) on processing interest packets and data packets, respectively. However, in terms of quantitative analysis, our approach reduces the number of timeout interests by 6% and the average response time by 0.6 s. Furthermore, although basic CCN and our approach belong to the same Quality of Service (QoS) category, our approach outperforms basic CCN in terms of real values. Additionally, our probe-based approach performs better than RECIF+PIF and EEGPR. Owing to speedup FIB updating by probes, our approach provides more reliable interest packet routing when accounting for router failures. In summary, the results demonstrate that compared to basic CCN, our probe-based routing approach raises FIB accuracy and reduces network congestion and response time, resulting in efficient routing.With the development of new technologies and applications, such as the Internet of Things, smart cities, 5G, and edge computing, traditional Internet Protocol-based (IP-based) networks have been exposed as having many problems. Information-Centric Networking (ICN), Named Data Networking (NDN), and Content-Centric Networking (CCN) are therefore proposed as an alternative for future networks. However, unlike IP-based networks, CCN routing is non-deterministic and difficult to optimize due to frequent in-network caching replacement. This paper presents a novel probe-based routing algorithm that explores real-time in-network caching to ensure the routing table storing the optimal paths to the nearest content provider is up to date. Effective probe-selections, Pending Interest Table (PIT) probe, and Forwarding Information Base (FIB) probe are discussed and analyzed by simulation with different performance measurements. Compared with the basic CCN, in terms of qualitative analysis, the additional computational overhead of our approach is O(NCS + Nrt + NFIB ∗ NSPT) and O(NFIB) on processing interest packets and data packets, respectively. However, in terms of quantitative analysis, our approach reduces the number of timeout interests by 6% and the average response time by 0.6 s. Furthermore, although basic CCN and our approach belong to the same Quality of Service (QoS) category, our approach outperforms basic CCN in terms of real values. Additionally, our probe-based approach performs better than RECIF+PIF and EEGPR. Owing to speedup FIB updating by probes, our approach provides more reliable interest packet routing when accounting for router failures. In summary, the results demonstrate that compared to basic CCN, our probe-based routing approach raises FIB accuracy and reduces network congestion and response time, resulting in efficient routing. With the development of new technologies and applications, such as the Internet of Things, smart cities, 5G, and edge computing, traditional Internet Protocol-based (IP-based) networks have been exposed as having many problems. Information-Centric Networking (ICN), Named Data Networking (NDN), and Content-Centric Networking (CCN) are therefore proposed as an alternative for future networks. However, unlike IP-based networks, CCN routing is non-deterministic and difficult to optimize due to frequent in-network caching replacement. This paper presents a novel probe-based routing algorithm that explores real-time in-network caching to ensure the routing table storing the optimal paths to the nearest content provider is up to date. Effective probe-selections, Pending Interest Table (PIT) probe, and Forwarding Information Base (FIB) probe are discussed and analyzed by simulation with different performance measurements. Compared with the basic CCN, in terms of qualitative analysis, the additional computational overhead of our approach is O(NCS + Nrt + NFIB ∗ NSPT) and O(NFIB) on processing interest packets and data packets, respectively. However, in terms of quantitative analysis, our approach reduces the number of timeout interests by 6% and the average response time by 0.6 s. Furthermore, although basic CCN and our approach belong to the same Quality of Service (QoS) category, our approach outperforms basic CCN in terms of real values. Additionally, our probe-based approach performs better than RECIF+PIF and EEGPR. Owing to speedup FIB updating by probes, our approach provides more reliable interest packet routing when accounting for router failures. In summary, the results demonstrate that compared to basic CCN, our probe-based routing approach raises FIB accuracy and reduces network congestion and response time, resulting in efficient routing. With the development of new technologies and applications, such as the Internet of Things, smart cities, 5G, and edge computing, traditional Internet Protocol-based (IP-based) networks have been exposed as having many problems. Information-Centric Networking (ICN), Named Data Networking (NDN), and Content-Centric Networking (CCN) are therefore proposed as an alternative for future networks. However, unlike IP-based networks, CCN routing is non-deterministic and difficult to optimize due to frequent in-network caching replacement. This paper presents a novel -based routing algorithm that explores real-time in-network caching to ensure the routing table storing the optimal paths to the nearest content provider is up to date. Effective -selections, Pending Interest Table (PIT) , and Forwarding Information Base (FIB) are discussed and analyzed by simulation with different performance measurements. Compared with the basic CCN, in terms of qualitative analysis, the additional computational overhead of our approach is O( + + ∗ ) and O( ) on processing interest packets and data packets, respectively. However, in terms of quantitative analysis, our approach reduces the number of timeout interests by 6% and the average response time by 0.6 s. Furthermore, although basic CCN and our approach belong to the same Quality of Service (QoS) category, our approach outperforms basic CCN in terms of real values. Additionally, our -based approach performs better than RECIF+PIF and EEGPR. Owing to speedup FIB updating by probes, our approach provides more reliable interest packet routing when accounting for router failures. In summary, the results demonstrate that compared to basic CCN, our -based routing approach raises FIB accuracy and reduces network congestion and response time, resulting in efficient routing.
Audience	Academic
Author	Zhang, Jun-Bin Tsai, Pei-Hsuan Tsai, Meng-Hsun
AuthorAffiliation	2 Department of Computer Science and Information Engineering, National Cheng Kung University, Tainan City 701, Taiwan; p78083025@ncku.edu.tw 1 Institute of Manufacturing Information and Systems, National Cheng Kung University, Tainan City 701, Taiwan
AuthorAffiliation_xml	– name: 2 Department of Computer Science and Information Engineering, National Cheng Kung University, Tainan City 701, Taiwan; p78083025@ncku.edu.tw – name: 1 Institute of Manufacturing Information and Systems, National Cheng Kung University, Tainan City 701, Taiwan
Author_xml	– sequence: 1 givenname: Pei-Hsuan orcidid: 0000-0001-6227-7652 surname: Tsai fullname: Tsai, Pei-Hsuan – sequence: 2 givenname: Jun-Bin orcidid: 0000-0001-8639-7528 surname: Zhang fullname: Zhang, Jun-Bin – sequence: 3 givenname: Meng-Hsun orcidid: 0000-0001-7549-5245 surname: Tsai fullname: Tsai, Meng-Hsun
BackLink	https://www.ncbi.nlm.nih.gov/pubmed/35009883$$D View this record in MEDLINE/PubMed
BookMark	eNplUk1vFDEMjVARbRcO_AE0Ehc4TJvvyVxAy6pApQoQgnOUSZwly2xSkhkQ_55st63aokhOZD8_-8U-RgcxRUDoOcEnjPX4tFCKCWacPEJHhFPequo4uPM-RMelbDCmjDH1BB0ygXGvFDtCb5exOfM-2ABxar7kNED7zhRwzdc0TyGuG59ys0pxqvF2VU0OtvkE05-Uf9bwU_TYm7HAs-t7gb6_P_u2-thefP5wvlpetFZ0fGoFdrhzvSPCYGqlAME6gJ5zZxUGpbwY3MCZZcAHIIZLSno2MPAEoBrBFuh8z-uS2ejLHLYm_9XJBH3lSHmtTZ6CHUF3ePCWewpESM6lGpQgxlDrBiwlrlUW6M2e63IetuDsTpQZ75Hej8TwQ6_Tb6063ncYV4JX1wQ5_ZqhTHobioVxNBHSXDSVRPWEMLrr--UD6CbNOdavukJRqZRUFXWyR61NFRCiT7WurcfBNtg6bB-qf9kpQnsicFcTXtyVcNv7zWAr4HQPsDmVksFrGyYzhbRTFEZNsN6tjr5dnZrx-kHGDen_2H9iJsDr
CitedBy_id	crossref_primary_10_1155_2022_4560072 crossref_primary_10_1007_s11276_023_03544_w crossref_primary_10_1109_ACCESS_2023_3243006 crossref_primary_10_1109_ACCESS_2023_3301961 crossref_primary_10_1109_TNSE_2025_3555743 crossref_primary_10_1016_j_comnet_2023_110104 crossref_primary_10_3390_math12050649 crossref_primary_10_3390_network5020010
Cites_doi	10.1109/TPDS.2013.304 10.1016/j.comnet.2018.05.027 10.1109/GLOCOM.2012.6503549 10.1587/transinf.2018NTL0002 10.17487/rfc2460 10.1109/ICOIN.2018.8343126 10.23940/ijpe.19.08.p19.21902198 10.1109/ICS51289.2020.00060 10.1007/978-3-030-34496-2 10.1109/MCOM.2018.1701086 10.1007/s10776-019-00477-0 10.1109/INFCOM.2009.5062201 10.1016/j.cosrev.2018.11.001 10.1109/icc.2011.5963380 10.1155/2019/6373960 10.1016/j.comnet.2019.107032 10.1016/j.peva.2005.05.003 10.5120/cae2019652838 10.17487/rfc4787 10.1109/CCNC.2019.8651713 10.1016/j.comnet.2013.08.010 10.1002/dac.2787 10.1016/j.comnet.2019.04.003 10.1145/167954.166243 10.1109/INFCOMW.2012.6193507 10.17487/rfc1518 10.1109/INFCOM.2013.6566743 10.3390/electronics9010039 10.1145/2660129.2660153 10.3390/info9100243 10.1088/1742-6596/1802/3/032116 10.1145/2491224.2491231 10.1002/cpe.4461 10.1016/j.comcom.2005.08.009 10.1145/2491224.2491234
ContentType	Journal Article
Copyright	COPYRIGHT 2022 MDPI AG 2022 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. 2022 by the authors. 2022
Copyright_xml	– notice: COPYRIGHT 2022 MDPI AG – notice: 2022 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. – notice: 2022 by the authors. 2022
DBID	AAYXX CITATION NPM 3V. 7X7 7XB 88E 8FI 8FJ 8FK ABUWG AFKRA AZQEC BENPR CCPQU DWQXO FYUFA GHDGH K9. M0S M1P PHGZM PHGZT PIMPY PJZUB PKEHL PPXIY PQEST PQQKQ PQUKI 7X8 5PM DOA
DOI	10.3390/s22010341
DatabaseName	CrossRef PubMed ProQuest Central (Corporate) Health & Medical Collection ProQuest Central (purchase pre-March 2016) Medical Database (Alumni Edition) Hospital Premium Collection Hospital Premium Collection (Alumni Edition) ProQuest Central (Alumni) (purchase pre-March 2016) ProQuest Central (Alumni) ProQuest Central UK/Ireland ProQuest Central Essentials ProQuest Central ProQuest One Community College ProQuest Central Korea Health Research Premium Collection Health Research Premium Collection (Alumni) ProQuest Health & Medical Complete (Alumni) Health & Medical Collection (Alumni Edition) Medical Database ProQuest Central Premium ProQuest One Academic Publicly Available Content Database ProQuest Health & Medical Research Collection ProQuest One Academic Middle East (New) ProQuest One Health & Nursing ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Academic (retired) ProQuest One Academic UKI Edition MEDLINE - Academic PubMed Central (Full Participant titles) DOAJ Directory of Open Access Journals
DatabaseTitle	CrossRef PubMed Publicly Available Content Database ProQuest One Academic Middle East (New) ProQuest Central Essentials ProQuest Health & Medical Complete (Alumni) ProQuest Central (Alumni Edition) ProQuest One Community College ProQuest One Health & Nursing ProQuest Central ProQuest Health & Medical Research Collection Health Research Premium Collection Health and Medicine Complete (Alumni Edition) ProQuest Central Korea Health & Medical Research Collection ProQuest Central (New) ProQuest Medical Library (Alumni) ProQuest One Academic Eastern Edition ProQuest Hospital Collection Health Research Premium Collection (Alumni) ProQuest Hospital Collection (Alumni) ProQuest Health & Medical Complete ProQuest Medical Library ProQuest One Academic UKI Edition ProQuest One Academic ProQuest One Academic (New) ProQuest Central (Alumni) MEDLINE - Academic
DatabaseTitleList	MEDLINE - Academic CrossRef Publicly Available Content Database PubMed
Database_xml	– sequence: 1 dbid: DOA name: DOAJ Directory of Open Access Journals url: https://www.doaj.org/ sourceTypes: Open Website – sequence: 2 dbid: NPM name: PubMed url: http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?db=PubMed sourceTypes: Index Database – sequence: 3 dbid: PIMPY name: Publicly Available Content Database url: http://search.proquest.com/publiccontent sourceTypes: Aggregation Database
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering
EISSN	1424-8220
ExternalDocumentID	oai_doaj_org_article_70bfc4f2e1564468b851aa2cdb0660b4 PMC8749700 A781291507 35009883 10_3390_s22010341
Genre	Journal Article
GroupedDBID	--- 123 2WC 53G 5VS 7X7 88E 8FE 8FG 8FI 8FJ AADQD AAHBH AAYXX ABDBF ABUWG ACUHS ADBBV ADMLS AENEX AFFHD AFKRA AFZYC ALMA_UNASSIGNED_HOLDINGS BENPR BPHCQ BVXVI CCPQU CITATION CS3 D1I DU5 E3Z EBD ESX F5P FYUFA GROUPED_DOAJ GX1 HH5 HMCUK HYE IAO ITC KQ8 L6V M1P M48 MODMG M~E OK1 OVT P2P P62 PHGZM PHGZT PIMPY PJZUB PPXIY PQQKQ PROAC PSQYO RNS RPM TUS UKHRP XSB ~8M 3V. ABJCF ALIPV ARAPS HCIFZ KB. M7S NPM PDBOC 7XB 8FK AZQEC DWQXO K9. PKEHL PQEST PQUKI 7X8 PUEGO 5PM
ID	FETCH-LOGICAL-c574t-50d07d9d15a02c65e537ee944dc80e88f5bdb43c3e4be1a462193b3ef1eeef153
IEDL.DBID	DOA
ISICitedReferencesCount	8
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000758728900001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	1424-8220
IngestDate	Mon Nov 10 04:35:22 EST 2025 Tue Nov 04 01:52:52 EST 2025 Fri Sep 05 14:19:13 EDT 2025 Tue Oct 07 07:07:48 EDT 2025 Tue Nov 04 18:30:31 EST 2025 Wed Feb 19 02:28:28 EST 2025 Tue Nov 18 19:58:33 EST 2025 Sat Nov 29 07:11:29 EST 2025
IsDoiOpenAccess	true
IsOpenAccess	true
IsPeerReviewed	true
IsScholarly	true
Issue	1
Keywords	content exploration Information-Centric Networking routing next generation networking Content-Centric Networking Named Data Networking
Language	English
License	Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c574t-50d07d9d15a02c65e537ee944dc80e88f5bdb43c3e4be1a462193b3ef1eeef153
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 content type line 23
ORCID	0000-0001-7549-5245 0000-0001-8639-7528 0000-0001-6227-7652
OpenAccessLink	https://doaj.org/article/70bfc4f2e1564468b851aa2cdb0660b4
PMID	35009883
PQID	2618268868
PQPubID	2032333
ParticipantIDs	doaj_primary_oai_doaj_org_article_70bfc4f2e1564468b851aa2cdb0660b4 pubmedcentral_primary_oai_pubmedcentral_nih_gov_8749700 proquest_miscellaneous_2618911325 proquest_journals_2618268868 gale_infotracacademiconefile_A781291507 pubmed_primary_35009883 crossref_citationtrail_10_3390_s22010341 crossref_primary_10_3390_s22010341
PublicationCentury	2000
PublicationDate	20220104
PublicationDateYYYYMMDD	2022-01-04
PublicationDate_xml	– month: 1 year: 2022 text: 20220104 day: 4
PublicationDecade	2020
PublicationPlace	Switzerland
PublicationPlace_xml	– name: Switzerland – name: Basel
PublicationTitle	Sensors (Basel, Switzerland)
PublicationTitleAlternate	Sensors (Basel)
PublicationYear	2022
Publisher	MDPI AG MDPI
Publisher_xml	– name: MDPI AG – name: MDPI
References	Sheneela (ref_9) 2018; 142 Haifeng (ref_40) 2015; 28 Sato (ref_24) 2019; 102 ref_14 ref_36 ref_13 ref_12 ref_34 ref_11 ref_33 ref_32 Nidhi (ref_8) 2019; 31 Lal (ref_2) 2019; 16 Laoutaris (ref_20) 2006; 63 ref_18 ref_17 Eum (ref_29) 2013; 57 ref_16 ref_38 Bastos (ref_3) 2019; 157 ref_37 Sen (ref_35) 2015; 24 Xiaoyan (ref_7) 2020; 166 Bagula (ref_10) 2006; 29 Yu (ref_19) 2018; 56 ref_25 ref_21 ref_43 Li (ref_23) 2020; 27 ref_42 ref_41 Qazi (ref_1) 2019; 2019 Yang (ref_31) 2021; 1802 Siddiqa (ref_30) 2019; 31 ref_28 Psaras (ref_22) 2013; 25 ref_27 ref_26 Nurhaida (ref_15) 2019; 7 Deepinder (ref_39) 1993; 23 ref_5 ref_4 ref_6
References_xml	– volume: 25 start-page: 2920 year: 2013 ident: ref_22 article-title: In-network cache management and resource allocation for information-centric networks publication-title: IEEE T. Parall. Distr. doi: 10.1109/TPDS.2013.304 – ident: ref_28 – volume: 142 start-page: 93 year: 2018 ident: ref_9 article-title: A dynamic caching strategy for CCN-based MANETs publication-title: Comput. Netw. doi: 10.1016/j.comnet.2018.05.027 – ident: ref_11 doi: 10.1109/GLOCOM.2012.6503549 – volume: 102 start-page: 998 year: 2019 ident: ref_24 article-title: Hash-based cache distribution and search schemes in Content-Centric Networking publication-title: IEICE Trans. Inf. Syst. doi: 10.1587/transinf.2018NTL0002 – ident: ref_16 doi: 10.17487/rfc2460 – ident: ref_32 doi: 10.1109/ICOIN.2018.8343126 – volume: 16 start-page: 108 year: 2019 ident: ref_2 article-title: An efficient update strategy for content synchronization in Content-Centric Networking (CCN) publication-title: China Commun. – ident: ref_6 doi: 10.23940/ijpe.19.08.p19.21902198 – ident: ref_26 – ident: ref_33 doi: 10.1109/ICS51289.2020.00060 – volume: 24 start-page: 2742 year: 2015 ident: ref_35 article-title: CPHR: In-network caching for Information-Centric Networking with partitioning and hash-routing publication-title: IEEE/ACM Trans. Netw. – ident: ref_14 doi: 10.1007/978-3-030-34496-2 – volume: 56 start-page: 82 year: 2018 ident: ref_19 article-title: Content protection in Named Data Networking: Challenges and potential solutions publication-title: IEEE Commun. Mag. doi: 10.1109/MCOM.2018.1701086 – volume: 27 start-page: 184 year: 2020 ident: ref_23 article-title: Hierarchical Information-Centric Networking Framework publication-title: Int. J. Wirel. Inf. Netw. doi: 10.1007/s10776-019-00477-0 – ident: ref_27 doi: 10.1109/INFCOM.2009.5062201 – volume: 31 start-page: 39 year: 2019 ident: ref_8 article-title: Caching methodologies in Content centric networking (CCN): A survey publication-title: Comput. Sci. Rev. doi: 10.1016/j.cosrev.2018.11.001 – ident: ref_21 doi: 10.1109/icc.2011.5963380 – volume: 2019 start-page: 6373960 year: 2019 ident: ref_1 article-title: Optimal content caching in content-centric networks publication-title: Wirel. Commun. Mob. Comput. doi: 10.1155/2019/6373960 – volume: 166 start-page: 107032 year: 2020 ident: ref_7 article-title: An on-demand off-path cache exploration based multipath forwarding strategy publication-title: Comput. Netw. doi: 10.1016/j.comnet.2019.107032 – volume: 63 start-page: 609 year: 2006 ident: ref_20 article-title: The LCD interconnection of LRU caches and its analysis publication-title: Perform. Eval. doi: 10.1016/j.peva.2005.05.003 – volume: 7 start-page: 12 year: 2019 ident: ref_15 article-title: Performance Comparison based on Open Shortest Path First (OSPF) Routing Algorithm for IP Internet Networks publication-title: Commun. Appl. Electron. doi: 10.5120/cae2019652838 – ident: ref_42 – ident: ref_17 doi: 10.17487/rfc4787 – ident: ref_36 doi: 10.1109/CCNC.2019.8651713 – volume: 57 start-page: 3154 year: 2013 ident: ref_29 article-title: Potential based routing as a secondary best-effort routing for Information Centric Networking (ICN) publication-title: Comput. Netw. doi: 10.1016/j.comnet.2013.08.010 – volume: 28 start-page: 1709 year: 2015 ident: ref_40 article-title: Traffic matrix estimation: Advanced-Tomogravity method based on a precise gravity model publication-title: Int. J. Commun. Syst. doi: 10.1002/dac.2787 – volume: 157 start-page: 11 year: 2019 ident: ref_3 article-title: A diversity-based search-and-routing approach for named-data networking publication-title: Comput. Netw. doi: 10.1016/j.comnet.2019.04.003 – volume: 23 start-page: 53 year: 1993 ident: ref_39 article-title: Open shortest path first (OSPF) routing protocol simulation publication-title: ACM SIGCOMM Comput. Commun. Rev. doi: 10.1145/167954.166243 – ident: ref_4 – ident: ref_5 doi: 10.1109/INFCOMW.2012.6193507 – ident: ref_18 doi: 10.17487/rfc1518 – ident: ref_34 doi: 10.1109/INFCOM.2013.6566743 – ident: ref_13 – ident: ref_37 doi: 10.3390/electronics9010039 – ident: ref_38 doi: 10.1145/2660129.2660153 – ident: ref_41 doi: 10.3390/info9100243 – volume: 1802 start-page: 032116 year: 2021 ident: ref_31 article-title: Intelligent Content-Centric Networking Routing Strategy: A Bacterial Quorum Inspired Pattern publication-title: J. Phys. Conf. Ser. doi: 10.1088/1742-6596/1802/3/032116 – ident: ref_43 – ident: ref_25 doi: 10.1145/2491224.2491231 – volume: 31 start-page: e4461 year: 2019 ident: ref_30 article-title: CCN: A novel energy efficient greedy routing protocol for green computing publication-title: Concurr. Comput. Pract. Exp. doi: 10.1002/cpe.4461 – volume: 29 start-page: 879 year: 2006 ident: ref_10 article-title: Hybrid routing in next generation IP networks publication-title: Comput. Commun. doi: 10.1016/j.comcom.2005.08.009 – ident: ref_12 doi: 10.1145/2491224.2491234
SSID	ssj0023338
Score	2.3922775
Snippet	With the development of new technologies and applications, such as the Internet of Things, smart cities, 5G, and edge computing, traditional Internet...
SourceID	doaj pubmedcentral proquest gale pubmed crossref
SourceType	Open Website Open Access Repository Aggregation Database Index Database Enrichment Source
StartPage	341
SubjectTerms	Algorithms Analysis content exploration Content provider Content-Centric Networking Information services Information services industry Information-Centric Networking Innovations Interfaces Internet Internet of Things Internet Protocol Investigations Named Data Networking next generation networking Response time Routers routing Traffic congestion Transmission Control Protocol/Internet Protocol (Computer network protocol)
SummonAdditionalLinks	– databaseName: Health & Medical Collection dbid: 7X7 link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1Lb9QwEB5B4QAH3o9AQQEhwcWqE9uxc6q2qBWnVQ8g7S3yE1aqsmV329_fmSSbbgTiwiWHeA6TjGfmGz--AfiUnOABoxyzMjkmtfLM2lQxDAupsroUMcqu2YSez81iUZ8PC26b4VjlLiZ2gTqsPK2RHyHSRyRsTGWOL38z6hpFu6tDC427cI_aZtM814vbgktg_dWzCQks7Y82JW39CllMclBH1f9nQN7LSNPTknvp5-zx_yr-BB4NwDOf9TPlKdyJ7TN4uEdH-ByOZ21-2lFKoA75OV0UYieY5UJO54ZQJEeEm3d8Vu2WdevCS5_P-4PkOPwCfpydfv_6jQ0NFphXWm6Z4oHrUIdCWV76SkUldIy1lMEbHo1JygUnhRdRulhYWWF4E07EVMSIDyVewkG7auNryGMgVp2AxVNKMhQGUUDkhQ-e16b0sczgy-6XN35gH6cmGBcNViFknWa0TgYfR9HLnnLjb0InZLdRgFiyuxer9c9mcLpGc5e8TGUkRhxZGYfw0trSB4dAizuZwWeyekO-jMp4O1xJwE8iVqxmphH-1ASZMzjcGbcZnHzT3Fo2gw_jMLon7bnYNq6uehnMJ6JUGbzq59Gos1DE5mpEBnoywyYfNR1pl786CnCjZa05f_Nvtd7Cg5Jua9CKkTyEg-36Kr6D-_56u9ys33e-cgNN2h7V priority: 102 providerName: ProQuest
Title	An Efficient Probe-Based Routing for Content-Centric Networking
URI	https://www.ncbi.nlm.nih.gov/pubmed/35009883 https://www.proquest.com/docview/2618268868 https://www.proquest.com/docview/2618911325 https://pubmed.ncbi.nlm.nih.gov/PMC8749700 https://doaj.org/article/70bfc4f2e1564468b851aa2cdb0660b4
Volume	22
WOSCitedRecordID	wos000758728900001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVAON databaseName: DOAJ Directory of Open Access Journals customDbUrl: eissn: 1424-8220 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0023338 issn: 1424-8220 databaseCode: DOA dateStart: 20010101 isFulltext: true titleUrlDefault: https://www.doaj.org/ providerName: Directory of Open Access Journals – providerCode: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources customDbUrl: eissn: 1424-8220 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0023338 issn: 1424-8220 databaseCode: M~E dateStart: 20010101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre – providerCode: PRVPQU databaseName: Health & Medical Collection customDbUrl: eissn: 1424-8220 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0023338 issn: 1424-8220 databaseCode: 7X7 dateStart: 20010101 isFulltext: true titleUrlDefault: https://search.proquest.com/healthcomplete providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: eissn: 1424-8220 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0023338 issn: 1424-8220 databaseCode: BENPR dateStart: 20010101 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVPQU databaseName: Publicly Available Content Database customDbUrl: eissn: 1424-8220 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0023338 issn: 1424-8220 databaseCode: PIMPY dateStart: 20010101 isFulltext: true titleUrlDefault: http://search.proquest.com/publiccontent providerName: ProQuest
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV3Ni9QwFH_o6sE9iN9W16GKoJeyaT6a9CQzMosediiiMJ5KPtkB6crO7B79231JO2WKghcvOSSPkr6X95W8_ALwNhhGHFq5QvNgCi6FLbQOVYFmIVRaUuY9T49NyNVKrdd1c_DUV6wJ6-GBe8adSmKC5YH6iGrCK2UwRNCaWmfQWRKTkECJrPfJ1JBqMcy8ehwhhkn96ZbGQ1_Gy4n3SSD9f5riA180rZM8cDxnD-D-EDHm836mD-GW7x7B8QGO4GP4MO_yZcKCwE_kTbzhUyzQPbk8FvwgSY6haZ6AqLpdkTZ0NzZf9RXgOPwEvp0tv378VAwvIxRWSL4rBHFEutqVQhNqK-EFk97XnDuriFcqCOMMZ5Z5bnypeYV2iRnmQ-k9NoI9haPusvPPIfcuwuE4zHpC4K5U6L49Ka2zpFbUeprB-z3HWjvAhsfXK360mD5E5rYjczN4M5L-7LEy_ka0iGwfCSK8depAobeD0Nt_CT2Dd1FobVRCnIzVw10C_KUIZ9XOJcYtdYx1MzjZy7UdtHPbYtaIWZVSlcrg9TiMehUPS3TnL697GnQEjIoMnvXLYJwzExGGVbEM5GSBTH5qOtJtLhJ2t5K8loS8-B9ceAn3aLyMETeE-Akc7a6u_Su4a292m-3VDG7LtUytmsGdxXLVfJklJcH2_NcS-5rP58333z3FFvk
linkProvider	Directory of Open Access Journals
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Lb9QwEB5VBQl64P0IFAgIBBerju3EzgFVW2jVqmXVQ5H2lia2Q1dC2bK7BfGn-I3M5NWNQNx64JJDPAc7-fzNjB_fALwuC8kdshzLVVkwpWPL8rxMGNJCmeRaSO9VXWxCj8dmMkmP1-BXdxeGjlV2nFgTtZtZWiPfwkgfI2FjErN9_o1R1SjaXe1KaDSwOPQ_f2DKtnh_8BH_7xsh9nZPPuyztqoAs7FWSxZzx7VLXRTnXNgk9rHU3qdKOWu4N6aMC1coaaVXhY9yleCcloX0ZeQ9PqhKBFL-NeRxTcmenlwmeBLzvUa9SMqUby0EbTVLFQ18Xl0a4E8HsOIBh6czV9zd3u3_7UPdgVttYB2OmplwF9Z8dQ82VuQW78P2qAp3a8kMHHN4TBeh2A56cRfSuSg0CTGCD2u9rmrJ6nXvqQ3HzUF5bH4An69kBA9hvZpV_jGE3pFqkMPksCyViwxGOZ5H1lmeGmG9COBd94sz26qrU5GPrxlmWYSGrEdDAK960_NGUuRvRjuEk96AVMDrF7P5l6wllUzzorSqFJ4Uf1RiCgyf81xYV2AgyQsVwFtCWUZchZ2xeXvlAodEql_ZSGN4l1JKEMBmB6asJbFFdomkAF72zUg_tKeUV3520digv5QiDuBRg9u-zzImtVojA9ADRA8GNWyppme1xLnRKtWcP_l3t17Ajf2TT0fZ0cH48CncFHQzhVbH1CasL-cX_hlct9-X08X8eT1PQzi9arz_BjvmfSo
linkToPdf	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Lj9MwEB6tugjBgfcjsEBAILhEdWwndg5o1WW3olqoegBpOYXED6iE0qXtgvhr_DpmkjQ0AnHbA5cc4jnYyed52DPfADz1pWAWtVxUSF9GUiUmKgqfRqgWfFooLpyTdbMJNZ3qk5NstgM_N7UwlFa50Ym1orYLQ2fkQ_T00RPWOtVD36ZFzA7H-6dfI-ogRTetm3YaDUSO3Y_vGL6tXk4O8V8_43x89O7V66jtMBCZRMl1lDDLlM1snBSMmzRxiVDOZVJao5nT2ielLaUwwsnSxYVMcX-LUjgfO4cP6hiB6n8XXXLJB7A7m7ydfejCPYHRX8NlJETGhitOF89Cxj0LWDcK-NMcbNnDfq7mlvEbX_2fP9s1uNK63OGo2SPXYcdVN-DyFhHjTdgfVeFRTaaB6w9nVCIVHaB9tyFlTKFIiL59WDN5VeuoPhGfm3DapNDj8C14fy4ruA2DalG5uxA6S3xCFsNG76WNNfo_jsXGGpZpbhwP4MXmd-em5V2n9h9fcoy_CBl5h4wAnnSipw3ZyN-EDggznQDxg9cvFstPeatucsVKb6TnjriAZKpLdKyLghtboovJShnAc0JcTloMJ2OKthgDl0R8YPlIoeOXUbAQwN4GWHmr3lb5b1QF8LgbRsVEt01F5RZnjQxaUsGTAO40GO7mLBLisdUiANVDd29R_ZFq_rkmP9dKZoqxe_-e1iO4iDDP30ymx_fhEqeSFTo2k3swWC_P3AO4YL6t56vlw3bThvDxvAH_C0Wzh3k
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=An+Efficient+Probe-Based+Routing+for+Content-Centric+Networking&rft.jtitle=Sensors+%28Basel%2C+Switzerland%29&rft.au=Tsai%2C+Pei-Hsuan&rft.au=Zhang%2C+Jun-Bin&rft.au=Tsai%2C+Meng-Hsun&rft.date=2022-01-04&rft.issn=1424-8220&rft.eissn=1424-8220&rft.volume=22&rft.issue=1&rft.spage=341&rft_id=info:doi/10.3390%2Fs22010341&rft.externalDBID=n%2Fa&rft.externalDocID=10_3390_s22010341
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1424-8220&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1424-8220&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1424-8220&client=summon