ACM Home Page
Please provide us with feedback. Feedback
Ditto: a system for opportunistic caching in multi-hop wireless networks
Full text PdfPdf (1.46 MB)
Source
International Conference on Mobile Computing and Networking archive
Proceedings of the 14th ACM international conference on Mobile computing and networking table of contents
San Francisco, California, USA
SESSION: Multi-hop wireless networks table of contents
Pages 279-290  
Year of Publication: 2008
ISBN:978-1-60558-096-8
Authors
Fahad R. Dogar  Carnegie Mellon University, Pittsburgh, PA, USA
Amar Phanishayee  Carnegie Mellon University, Pittsburgh, PA, USA
Himabindu Pucha  Carnegie Mellon University, Pittsburgh, PA, USA
Olatunji Ruwase  Carnegie Mellon University, Pittsburgh, PA, USA
David G. Andersen  Carnegie Mellon University, Pittsburgh, PA, USA
Sponsors
SIGMOBILE: ACM Special Interest Group on Mobility of Systems, Users, Data and Computing
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 20,   Downloads (12 Months): 302,   Citation Count: 3
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1409944.1409977
What is a DOI?

ABSTRACT

This paper presents the design, implementation, and evaluation of Ditto, a system that opportunistically caches overheard data to improve subsequent transfer throughput in wireless mesh networks. While mesh networks have been proposed as a way to provide cheap, easily deployable Internet access, they must maintain high transfer throughput to be able to compete with other last-mile technologies. Unfortunately, doing so is difficult because multi-hop wireless transmissions interfere with each other, reducing the available capacity on the network. This problem is particularly severe in common gateway-based scenarios in which nearly all transmissions go through one or a few gateways from the mesh network to the Internet.

Ditto exploits on-path as well as opportunistic caching based on overhearing to improve the throughput of data transfers and to reduce load on the gateways. It uses content-based naming to provide application independent caching at the granularity of small chunks, a feature that is key to being able to cache partially overheard data transfers. Our evaluation of Ditto shows that it can achieve significant performance gains for cached data, increasing throughput by up to 7x over simpler on-path caching schemes, and by up to an order of magnitude over no caching.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
MAP: Purdue University Wireless Mesh Network Testbed. https://engineering.purdue.edu/MESH.
 
2
3
4
 
5
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.
6
7
 
8
 
9
T. E. Denehy and W. W. Hsu. Duplicate management for reference data. Research Report RJ10305, IBM, Oct. 2003.
 
10
 
11
F. Douglis and A. Iyengar. Application-specific delta-encoding via resemblance detection. In Proceedings of the USENIX Annual Technical Conference, San Antonio, Texas, June 2003.
12
13
14
15
 
16
Meraki Wireless Network. http://meraki.com/.
17
 
18
19
 
20
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.
21
 
22
Squid Web Proxy Cache. http://www.squid-cache.org/.
 
23
 
24
N. Tolia, M. Kozuch, M. Satyanarayanan, B. Karp, A. Perrig, and T. Bressoud. Opportunistic use of content addressable storage for distributed file systems. In Proc. USENIX Annual Technical Conference, pages 127--140, San Antonio, TX, June 2003.
25


Collaborative Colleagues:
Fahad R. Dogar: colleagues
Amar Phanishayee: colleagues
Himabindu Pucha: colleagues
Olatunji Ruwase: colleagues
David G. Andersen: colleagues