메뉴 건너뛰기




Volumn , Issue , 2013, Pages 1629-1634

Scalable VANET content routing using hierarchical bloom filters

Author keywords

Bloom filters; Content routing; Hierarchical routing; VANET

Indexed keywords

BLOOM FILTERS; CONTENT DISCOVERIES; CONTENT ROUTING; HIERARCHICAL BLOOM FILTERS; HIERARCHICAL ROUTINGS; LARGE POPULATION; REACTIVE SCHEMES; VANET;

EID: 84883664914     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IWCMC.2013.6583800     Document Type: Conference Paper
Times cited : (25)

References (22)
  • 7
    • 0001341422 scopus 로고    scopus 로고
    • DSR: The dynamic source routing protocol for multihop wireless ad hoc networks
    • Dec
    • D. B. Johnson, D. A. Maltz, and J. Broch, "DSR: the dynamic source routing protocol for multihop wireless ad hoc networks," in Ad hoc networking, Dec. 2000, pp. 139-172.
    • (2000) Ad Hoc Networking , pp. 139-172
    • Johnson, D.B.1    Maltz, D.A.2    Broch, J.3
  • 10
    • 0003902865 scopus 로고    scopus 로고
    • Epidemic routing for partially-connected ad hoc networks
    • Amin Vahdat and David Becker
    • Amin Vahdat and David Becker. 2000. Epidemic routing for partially-connected ad hoc networks. Technical report.
    • (2000) Technical Report
  • 13
    • 36349022690 scopus 로고    scopus 로고
    • Does internet media traffic really follow zipf-like distribution?
    • Jun
    • L. Guo, E. Tan, S. Chen, Z. Xiao, and X. Zhang, "Does internet media traffic really follow zipf-like distribution?" SIGMETRICS Perform. Eval. Rev., vol. 35, no. 1, pp. 359-360, Jun. 2007.
    • (2007) SIGMETRICS Perform. Eval. Rev. , vol.35 , Issue.1 , pp. 359-360
    • Guo, L.1    Tan, E.2    Chen, S.3    Xiao, Z.4    Zhang, X.5
  • 14
    • 0032670943 scopus 로고    scopus 로고
    • Web caching and zipf-like distributions: Evidence and implications
    • Mar., 1
    • L. Breslau, P. Cao, L. Fan, G. Phillips, and S. Shenker, "Web caching and zipf-like distributions: evidence and implications," in INFOCOM '99, vol. 1, Mar. 1999, pp. 126-134 vol.1.
    • (1999) INFOCOM '99 , vol.1 , pp. 126-134
    • Breslau, L.1    Cao, P.2    Fan, L.3    Phillips, G.4    Shenker, S.5
  • 15
    • 0014814325 scopus 로고
    • Space/time trade-offs in hash coding with allowable errors
    • (July 1970)
    • Burton H. Bloom. 1970. Space/time trade-offs in hash coding with allowable errors. Commun. ACM 13, 7 (July 1970), 422-426.
    • (1970) Commun. ACM 13 , vol.7 , pp. 422-426
    • Bloom, B.H.1
  • 16
    • 33644905483 scopus 로고    scopus 로고
    • Network applications of bloom filters: A survey
    • A. Broder and M. Mitzenmacher, "Network applications of bloom filters: A survey," in Internet Mathematics, vol. 1, 2002, pp. 636-646.
    • (2002) Internet Mathematics , vol.1 , pp. 636-646
    • Broder, A.1    Mitzenmacher, M.2
  • 17
    • 0034206002 scopus 로고    scopus 로고
    • Summary cache: A scalable wide-area web cache sharing protocol
    • (June 2000)
    • Li Fan, Pei Cao, Jussara Almeida, and Andrei Z. Broder. 2000. Summary cache: a scalable wide-area web cache sharing protocol. IEEE/ACM Trans. Netw. 8, 3 (June 2000), 281-293.
    • (2000) IEEE/ACM Trans. Netw. , vol.8 , Issue.3 , pp. 281-293
    • Fan, L.1    Cao, P.2    Almeida, J.3    Broder, A.Z.4
  • 18
    • 47249156168 scopus 로고    scopus 로고
    • ASAP: An advertisement-based search algorithm for unstructured peer-to-peer systems
    • P. Gu, J. Wang, and H. Cai, "ASAP: An advertisement-based search algorithm for unstructured peer-to-peer systems," Parallel Processing, International Conference on, vol. 0, pp. 8, 2007.
    • (2007) Parallel Processing, International Conference on , pp. 8
    • Gu, P.1    Wang, J.2    Cai, H.3


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