메뉴 건너뛰기




Volumn , Issue , 2008, Pages 279-290

Ditto: A system for opportunistic caching in multi-hop wireless networks

Author keywords

Mesh networks; Multi hop wireless networks; Opportunistic caching; Performance; Throughput

Indexed keywords

AVAILABLE CAPACITIES; CACHED DATUM; CACHING SCHEMES; CONTENT-BASED; INTERNET ACCESS; MESH NETWORKS; MULTI HOPS; MULTI-HOP WIRELESS NETWORKS; OPPORTUNISTIC CACHING; ORDER OF MAGNITUDES; PERFORMANCE; PERFORMANCE GAINS; WIRELESS MESHES; WIRELESS TRANSMISSIONS;

EID: 60149093909     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1409944.1409977     Document Type: Conference Paper
Times cited : (40)

References (25)
  • 2
    • 77956430728 scopus 로고    scopus 로고
    • Efficiency through eavesdropping: Link-layer packet caching
    • San Francisco, CA, Apr
    • M. Afanasyev, D. G. Andersen, and A. C. Snoeren. Efficiency through eavesdropping: Link-layer packet caching. In Proc. 5th USENIX NSDI, San Francisco, CA, Apr. 2008.
    • (2008) Proc. 5th USENIX NSDI
    • Afanasyev, M.1    Andersen, D.G.2    Snoeren, A.C.3
  • 3
    • 32144434200 scopus 로고    scopus 로고
    • Architecture and evaluation of an unplanned 802.11b mesh network
    • Cologne, Germany, Sept
    • J. Bicket, D. Aguayo, S. Biswas, and R. Morris. Architecture and evaluation of an unplanned 802.11b mesh network. In Proc. A CM Mobicom, Cologne, Germany, Sept. 2005.
    • (2005) Proc. A CM Mobicom
    • Bicket, J.1    Aguayo, D.2    Biswas, S.3    Morris, R.4
  • 4
    • 35148896115 scopus 로고    scopus 로고
    • ExOR: Opportunistic multi-hop routing for wireless networks
    • Philadelphia, PA, Aug
    • S. Biswas and R. Morris. ExOR: opportunistic multi-hop routing for wireless networks. In Proc. ACM SIGCOMM, Philadelphia, PA, Aug. 2005.
    • (2005) Proc. ACM SIGCOMM
    • Biswas, S.1    Morris, R.2
  • 5
    • 0032670943 scopus 로고    scopus 로고
    • Web caching and zipf-like distributions: Evidence and implications
    • New York, NY, Mar
    • L. Breslau, P. Cao, L. Fan, G. Phillips, and S. Shenker. Web caching and zipf-like distributions: Evidence and implications. In Proc. IEEE INFOCOM, pages 126-134, New York, NY, Mar. 1999.
    • (1999) Proc. IEEE INFOCOM , pp. 126-134
    • Breslau, L.1    Cao, P.2    Fan, L.3    Phillips, G.4    Shenker, S.5
  • 6
    • 36949027308 scopus 로고    scopus 로고
    • Trading structure for randomness in wireless opportunistic routing
    • Kyoto, Japan, Aug
    • S. Chachulski, M. Jennings, S. Katti, and D. Katabi. Trading structure for randomness in wireless opportunistic routing. In Proc. ACM SIGCOMM, Kyoto, Japan, Aug. 2007.
    • (2007) Proc. ACM SIGCOMM
    • Chachulski, S.1    Jennings, M.2    Katti, S.3    Katabi, D.4
  • 8
    • 34248217516 scopus 로고    scopus 로고
    • Mitigating the gateway bottleneck via transparent cooperative caching in wireless mesh networks
    • S. M. Das, H. Pucha, and C. Y. Hu. Mitigating the gateway bottleneck via transparent cooperative caching in wireless mesh networks. Ad Hoc Networks (Elsevier) Journal, Special Issue on Wireless Mesh Networks, 2007, 2007.
    • (2007) Ad Hoc Networks (Elsevier) Journal , pp. 2007
    • Das, S.M.1    Pucha, H.2    Hu, C.Y.3
  • 9
    • 33751054275 scopus 로고    scopus 로고
    • Duplicate management for reference data
    • RJ10305, IBM, Oct. 2003
    • T. E. Denehy and W. W. Hsu. Duplicate management for reference data. Research Report RJ10305, IBM, Oct. 2003.
    • Research Report
    • Denehy, T.E.1    Hsu, W.W.2
  • 12
    • 0032178083 scopus 로고    scopus 로고
    • Summary cache: A scalable wide-area Web cache sharing protocol
    • Vancouver, British Columbia, Canada, Sept
    • L. Fan, P. Cao, J. Almeida, and A. Z. Broder. Summary cache: A scalable wide-area Web cache sharing protocol. In Proc. ACM SIGOOMM, pages 254-265, Vancouver, British Columbia, Canada, Sept. 1998.
    • (1998) Proc. ACM SIGOOMM , pp. 254-265
    • Fan, L.1    Cao, P.2    Almeida, J.3    Broder, A.Z.4
  • 13
    • 84868868181 scopus 로고    scopus 로고
    • C. Gkantsidis, T. Karagiannis, P. Rodriguez, and M. Vonjović. Planet scale software updates. In Proc. ACM SIGCOMM, Pisa, Italy, Aug. 2006.
    • C. Gkantsidis, T. Karagiannis, P. Rodriguez, and M. Vonjović. Planet scale software updates. In Proc. ACM SIGCOMM, Pisa, Italy, Aug. 2006.
  • 14
    • 36949032096 scopus 로고    scopus 로고
    • K. Jamieson and H. Balakrishnan. PPR: Partial packet recovery for wireless networks. In Proc. A CM SIGCOMM, Kyoto, Japan, Aug. 2007.
    • K. Jamieson and H. Balakrishnan. PPR: Partial packet recovery for wireless networks. In Proc. A CM SIGCOMM, Kyoto, Japan, Aug. 2007.
  • 17
    • 32144432658 scopus 로고    scopus 로고
    • A. K. Miu, H. Balakrishnan, and C. E. Koksal. Improving loss resilience with multi-radio diversity in wireless networks. In Proc. ACM Mobicom, Cologne, Germany, Sept. 2005.
    • A. K. Miu, H. Balakrishnan, and C. E. Koksal. Improving loss resilience with multi-radio diversity in wireless networks. In Proc. ACM Mobicom, Cologne, Germany, Sept. 2005.
  • 19
    • 0036036764 scopus 로고    scopus 로고
    • A. Muthitacharoen, B. Chen, and D. Mazieres. A low-bandwidth network file system. In Proc. 18th ACM Symposium on Operating Systems Principles (SOSP), Banff, Canada, Oct. 2001.
    • A. Muthitacharoen, B. Chen, and D. Mazieres. A low-bandwidth network file system. In Proc. 18th ACM Symposium on Operating Systems Principles (SOSP), Banff, Canada, Oct. 2001.
  • 20
    • 51049105688 scopus 로고    scopus 로고
    • Exploiting similarity for multi-source downloads using file handprints
    • Cambridge, MA, Apr
    • H. Pucha, D. G. Andersen, and M. Kaminsky. Exploiting similarity for multi-source downloads using file handprints. In Proc. 4th USENIX NSDI, Cambridge, MA, Apr. 2007.
    • (2007) Proc. 4th USENIX NSDI
    • Pucha, H.1    Andersen, D.G.2    Kaminsky, M.3
  • 21
    • 0005258822 scopus 로고    scopus 로고
    • A protocol-independent technique for eliminating redundant network traffic
    • Stockholm, Sweden, Sept
    • N. T. Spring and D. Wetherall. A protocol-independent technique for eliminating redundant network traffic. In Proc. ACM SIGCOMM, Stockholm, Sweden, Sept. 2000.
    • (2000) Proc. ACM SIGCOMM
    • Spring, N.T.1    Wetherall, D.2


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