메뉴 건너뛰기




Volumn , Issue , 2014, Pages 839-844

COBRA: Lean intra-domain routing in NDN

Author keywords

[No Author keywords available]

Indexed keywords


EID: 84957585056     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ccnc.2014.6994403     Document Type: Conference Paper
Times cited : (32)

References (15)
  • 1
    • 84863804608 scopus 로고    scopus 로고
    • A survey of information-centric networking
    • Jul
    • B. Ahlgren et al., "A survey of information-centric networking," Communications Magazine, IEEE, vol. 50, no. 7, pp. 26-36, Jul. 2012.
    • (2012) Communications Magazine, IEEE , vol.50 , Issue.7 , pp. 26-36
    • Ahlgren, B.1
  • 2
    • 84883669157 scopus 로고    scopus 로고
    • A case for stateful forwarding plane
    • Jul
    • C. Yi et al., A Case for Stateful Forwarding Plane, PARC Technical Report NDN-0002, Jul. 2012.
    • (2012) PARC Technical Report NDN-0002
    • Yi, C.1
  • 3
    • 85015214568 scopus 로고    scopus 로고
    • Nlsr: Named-data link state routing protocol
    • Hong Kong, China, Aug
    • A. Hoque et al., "NLSR: Named-data Link State Routing Protocol," in Proc. ACM SIGCOMM ICN Workshop, Hong Kong, China, Aug. 2013.
    • (2013) Proc. ACM SIGCOMM ICN Workshop
    • Hoque, A.1
  • 4
    • 84862066100 scopus 로고    scopus 로고
    • Advertising cached contents in the control plane: Necessity and feasibility
    • Orlando, (FL), USA, Mar
    • Y. Wang et al., "Advertising cached contents in the control plane: Necessity and feasibility," in Proc. IEEE INFOCOM WKSHPS, Orlando, (FL), USA, Mar. 2012.
    • (2012) Proc. IEEE INFOCOM WKSHPS
    • Wang, Y.1
  • 5
    • 84883694387 scopus 로고    scopus 로고
    • Inform: A dynamic interest forwarding mechanism for information centric networking
    • Hong Kong, China, Aug
    • D. Chiocchetti et al., "INFORM: a dynamic INterest FORwarding Mechanism for Information Centric Networking," in Proc. ACM SIGCOMM ICN Workshop, Hong Kong, China, Aug. 2013.
    • (2013) Proc. ACM SIGCOMM ICN Workshop
    • Chiocchetti, D.1
  • 6
    • 80052181974 scopus 로고    scopus 로고
    • Scan: Scalable content routing for content-aware networking
    • Kyoto, Japan, Jun
    • M. Lee et al., "SCAN: Scalable Content Routing for Content-Aware Networking." in Proc. IEEE ICC, Kyoto, Japan, Jun. 2011.
    • (2011) Proc. IEEE ICC
    • Lee, M.1
  • 7
    • 84866608335 scopus 로고    scopus 로고
    • A multi-level DHT routing framework with aggregation
    • Helsinki, Finland, Aug
    • H. Liu et al., "A multi-level DHT routing framework with aggregation," in Proc. ACM ICN Workshop, Helsinki, Finland, Aug. 2012.
    • (2012) Proc. ACM ICN Workshop
    • Liu, H.1
  • 8
    • 70349659322 scopus 로고    scopus 로고
    • Breadcrumbs: Efficient, best-effort content location in cache networks
    • Rio de Janeiro, Brazil, Apr
    • E. J. Rosensweig and J. Kurose, "Breadcrumbs: Efficient, best-effort content location in cache networks," in Proc. IEEE INFOCOM, Rio de Janeiro, Brazil, Apr. 2009.
    • (2009) Proc. IEEE INFOCOM
    • Rosensweig, E.J.1    Kurose, J.2
  • 9
    • 34250668863 scopus 로고    scopus 로고
    • Approximately detecting duplicates for streaming data using stable bloom filters
    • Chicago (IL), USA, Jun
    • F. Deng and D. Rafiei, "Approximately detecting duplicates for streaming data using stable bloom filters," in Proc. of ACM SIGMOD, Chicago (IL), USA, Jun. 2006.
    • (2006) Proc. of ACM SIGMOD
    • Deng, F.1    Rafiei, D.2
  • 11
    • 0031383380 scopus 로고    scopus 로고
    • Self-similarity in world wide web traffic: Evidence and possible causes
    • Dec
    • M. E. Crovella and A. Bestavros, "Self-similarity in World Wide Web traffic: evidence and possible causes," IEEE/ACM Trans. Netw., vol. 5, no. 6, pp. 835-846, Dec. 1997.
    • (1997) IEEE/ACM Trans. Netw , vol.5 , Issue.6 , pp. 835-846
    • Crovella, M.E.1    Bestavros, A.2
  • 12
    • 33644905483 scopus 로고    scopus 로고
    • Network applications of bloom filters: A survey
    • A. Broder and M. Mitzenmacher, "Network applications of bloom filters: A survey," Internet Mathematics, vol. 1, pp. 636-646, 2002.
    • (2002) Internet Mathematics , vol.1 , pp. 636-646
    • Broder, A.1    Mitzenmacher, M.2
  • 13
    • 84866624001 scopus 로고    scopus 로고
    • Exploit the known or explore the unknown?: Hamlet-like doubts in ICN
    • Helsinki, Finland, Aug
    • R. Chiocchetti et al., "Exploit the known or explore the unknown?: Hamlet-like doubts in ICN," in Proc. ACM ICN Workshop, Helsinki, Finland, Aug. 2012.
    • (2012) Proc. ACM ICN Workshop
    • Chiocchetti, R.1
  • 14
    • 84862063490 scopus 로고    scopus 로고
    • On sizing CCN content stores by exploiting topological information
    • Orlando (FL), USA, Mar
    • D. Rossi and G. Rossini, "On sizing CCN content stores by exploiting topological information," in Proc. IEEE NOMEN Workshop, Orlando (FL), USA, Mar. 2012.
    • (2012) Proc. IEEE NOMEN Workshop
    • Rossi, D.1    Rossini, G.2
  • 15
    • 85063832699 scopus 로고    scopus 로고
    • Information-centric networking: Baseline scenariosscenarios
    • K. Pentikousis et al., "Information-centric Networking: Baseline Scenarios," Internet Draft, Oct. 2013, Expires: April 24, 2014. [Online]. Available: http://www.ietf.org/id/draft-irtf-icnrg-scenarios-01.txt
    • (2014) Internet Draft, Oct. 2013, Expires: April 24
    • Pentikousis, K.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.