[논문]Content discovery for information-centric networking

Lee, M.; Song, J.; Cho, K.; Pack, S.; Kwon, T.''.; Kangasharju, J.; Choi, Y.

doi:10.1016/j.comnet.2014.10.006

Content discovery for information-centric networking

Computer networks, v.83, 2015년, pp.1 - 14

Lee, M. , Song, J. , Cho, K. , Pack, S. , Kwon, T.''. , Kangasharju, J. , Choi, Y.

Abstract ▼ AI-Helper

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.

주제어

참고문헌 (28)

Cisco Visual Networking Index: Forecast and Methodology, 2012-2017, URL: <http://www.tinyurl.com/VNI2012>, May 2013.
10.1145/1282380.1282402 T. Koponen, M. Chawla, B.-G. Chun, A. Ermolinskiy, K.H. Kim, S. Shenker, I. Stoica, A data-oriented (and beyond) network architecture, in: Proc. of ACM SIGCOMM, 2007.
L. Zhang, D. Estrin, J. Burke, V. Jacobson, J. Thornton, D.K. Smetters, B. Zhang, G. Tsudik, kc claffy, D. Krioukov, D. Massey, C. Papadopolos, T. Abdelzaher, L. Wang, P. Crowley, E. Yeh, Named Data Networking (NDN) Project, Palo Alto Research Center (PARC), Tech. Rep., Oct. 2010.
10.1145/1658939.1658941 V. Jacobson, D.K. Smetter, J.D. Thornton, M.F. Plass, N.H. Briggs, R.L. Braynard, Networking named content, in: Proc. of ACM CoNEXT, 2009.
IEEE Commun. Mag. Cho 49 10 156 2011 10.1109/MCOM.2011.6035830 How can an ISP merge with a CDN?

상세보기
B. Cohen, Incentives build robustness in BitTorrent, in: Proc. of Economics of Peer-to-Peer Systems, 2003.
Z. Ming, M. Xu, D. Wang, Age-based cooperative caching in information-centric networks, in: Proc. of IEEE INFOCOM Workshop NOMEN, 2012.
10.1145/2342488.2342501 I. Psaras, W.K. Chai, G. Pavlou, Probabilistic in-network caching for information-centric networks, in: Proc. of ACM SIGCOMM Workshop ICN, 2012.
10.1109/INFCOMW.2012.6193512 K. Cho, M. Lee, K. Park, T.T. Kwon, Y. Choi, S. Pack, WAVE: popularity-based and collaborative in-network caching for content-oriented networks, in: Proc. of IEEE INFOCOM Workshop NOMEN, 2012.
10.1007/978-3-642-30045-5_3 W.K. Chai, D. He, I. Psaras, G. Pavlou, Cache less for more in information-centric networks, in: Proc. of IFIP Networking, 2012.

상세보기
10.1145/2342488.2342491 R. Chiocchetti, D. Rossi, G. Rossini, G. Carofiglio, D. Perino, Exploit the known or explore the unknown? Hamlet-like doubts in ICN, in: Proc. of ACM SIGCOMM Workshop ICN, 2012.
Elsevier Comput. Networks Eum 57 16 3154 2013 10.1016/j.comnet.2013.08.010 Potential based routing as a secondary best-effort routing for information centric networking (icn)

상세보기
10.1109/icc.2011.5963381 M. Lee, K. Cho, K. Park, T.T. Kwon, Y. Choi, SCAN: scalable content routing for content-aware networking, in: Proc. of IEEE ICC, 2011.
10.1145/1658978.1658992 K. Visala, D. Lagutin, S. Tarkoma, Lanes: an inter-domain data-oriented routing architecture, in: Proc. of the 2009 Workshop on Re-architecting the Internet, 2009.
Elsevier Comput. Commun. Dannewitz 36 7 721 2013 10.1016/j.comcom.2013.01.009 Network of information (netinf) - an information-centric networking architecture

상세보기
Y. Wang, K. Lee, B. Venkataraman, R.L. Shamanna, I. Rhee, S. Yang, Advertising cached contents in the control plane: necessity and feasibility, in: Proc. of IEEE INFOCOM Workshop NOMEN, 2012.
10.1145/2491224.2491232 L. Saino, I. Psaras, G. Pavlou, Hash-routing schemes for information-centric networking, in: Proc. of ACM SIGCOMM Workshop ICN, 2013.
10.1145/2491224.2491227 R. Chiocchetti, D. Perino, G. Carofiglio, D. Rossi, G. Rossini, Inform: a dynamic interest forwarding mechanism for information centric networking, in: Proc. of ACM SIGCOMM Workshop ICN, 2013.
Elsevier Comput. Commun. Yi 36 7 779 2013 10.1016/j.comcom.2013.01.005 A case for stateful forwarding plane

상세보기
10.1109/INFCOM.2005.1498343 A. Kumar, J. Xu, E.W. Zegura, Efficient and scalable query routing for unstructured peer-to-peer networks, in: Proc. of IEEE INFOCOM, 2005.
10.1109/INFCOM.2002.1019375 S.C. Rhea, J. Kubiatowicz, Probabilistic location and routing, in: Proc. of IEEE INFOCOM, 2002.
10.1109/INFCOM.2009.5061946 N. Hua, H. Song, T.V. Lakshman, Variable-stride multi-pattern matching for scalable deep packet inspection, in: Proc. of IEEE INFOCOM, 2009.
Internet Math. Broder 1 4 485 2011 10.1080/15427951.2004.10129096 Network applications of bloom filters: a survey

상세보기
10.1109/ANCS.2013.6665203 W. So, A. Narayanan, D. Oran, Named data networking on a router: fast and dos-resistant forwarding with hash tables, in: Proc. of ANCS, 2013.
Elsevier Comput. Commun. Rossini 36 7 771 2013 10.1016/j.comcom.2013.01.008 Evaluating CCN multi-path interest forwarding strategies

상세보기
10.1145/1921233.1921240 S. Arianfar, P. Nikander, J. Ott, On content-centric router design and implications, in: Proc. of ACM SIGCOMM Workshop ReArch, 2010.
10.1109/INFCOM.1996.493353 E.W. Zegura, K.L. Calvert, S. Bhattacharjee, How to model an internetwork, in: Proc. of IEEE INFOCOM, 1996.
10.1109/ICDCS.2012.35 Y. Wang, K. He, H. Dai, W. Meng, J. Jiang, B. Liu, Y. Chen, Scalable name lookup in ndn using effective name component encoding, in: Proc. of IEEE ICDCS, 2012.

LOADING...

원문 URL 링크

DOI : 10.1016/j.comnet.2014.10.006
Elsevier : 저널 > 논문

*원문 PDF 파일 및 링크정보가 존재하지 않을 경우 KISTI DDS 시스템에서 제공하는 원문복사서비스를 사용할 수 있습니다.

이 논문과 함께 이용한 콘텐츠

[논문] 정보 중심 네트워킹 연구동향

저작권 관리 안내

내보내기 메뉴

내보내기 구분

파일저장
인쇄
메일전송

구성항목

기본정보
상세정보

관리번호, 논문명, 저널/프로시딩명, 저자 , 발행년, 권, 호, 시작페이지, 끝페이지, 발행기관

저장형식

Text(ASCII format)
Excel format
RefWorks Direct Export
RIS format (for Reference Manager, ProCite, EndNote), Scholar's Aids, Mendeley

메일정보

받는사람 (필수): @
보내는사람 (선택): @
제목
내용: KISTI 검색결과 이메일 서비스

안내

총 건의 자료가 검색되었습니다.

다운받으실 자료의 인덱스를 입력하세요. (1-10,000)

검색결과의 순서대로 최대 10,000건 까지 다운로드가 가능합니다.

데이타가 많을 경우 속도가 느려질 수 있습니다.(최대 2~3분 소요)

다운로드 파일은 UTF-8 형태로 저장됩니다.
파일의 내용이 제대로 보이지 않을실 때는 웹브라우저 상단의 보기 -> 인코딩 -> 자동선택 여부를 확인하십시오.

Text(ASCII format)
Excel format

표제어: PCR

동의어: Packet Collision Rate

용어 설명 출처 목록 (6)

용어 설명: PCR은 세균 특이성이 있는 primer를 이용하여 적은 수의 세균이 있을지라도 쉽게 검출할 수 있는 유용한 방법이며, 이를 이용하여 구강 내 치면세균막이나 타액에서 직접 세균을 검출할 수 있게 되었다[8].

AI-Helper ※ AI-Helper는 을 사용합니다.

AI-Helper

안녕하세요, AI-Helper입니다. 좌측 "선택된 텍스트"에서 텍스트를 선택하여 요약, 번역, 용어설명을 실행하세요.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.

연합인증