Abstract
File transfers are and will in the future be responsible for a substantial part of the Internet traffic. However, with present solutions transfers of popular files lead to a lot of redundant data transfers in the network. In this paper, we investigate how a link level caching scheme can reduce the number of redundant data transfers. We serve requests from clients that download a file concurrently, but arrived at different times in such a way that they get at a given point in time the same data chunk of the file. This enables link caches to efficiently remove the redundancy. The data chunks are rearranged at the client to compose the original file. Through implementation and experimental studies we show that this approach clearly outperforms traditional file servers in terms of file server capacity and bandwidth consumption; especially when encoding the original file with fountain codes.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
The records can be temporally inconsistent due to link transmission errors. For further information please refer to [9].
References
Byers, J., Horn, G., Luby, M., Mitzenmacher, M., Shaver, W.: Flid-dl: congestion control for layered multicast. IEEE J. Sel. Areas Commun. 20(8), 1558–1570 (2002)
Byers, J., Luby, M., Mitzenmacher, M.: A digital fountain approach to asynchronous reliable multicast. IEEE J. Sel. Areas Commun. 20(8), 1528–1540 (2002)
Gill, P., Shi, L., Mahanti, A., Li, Z., Eager, D.L.: Scalable on-demand media streaming for heterogeneous clients. ACM Trans. Multimedia Comput. Commun. Appl. 5(1), 8:1–8:24 (2008). http://doi.acm.org/10.1145/1404880.1404888
Huang, C., Li, J., Ross, K.W.: Can internet video-on-demand be profitable? SIGCOMM Comput. Commun. Rev. 37(4), 133–144 (2007)
MacKay, D.: Fountain codes. IEE Proc. Commun. 152(6), 1062–1068 (2005)
Mitzenmacher, M.: Digital fountains: a survey and look forward. In: Information Theory Workshop, 2004, pp. 271–276. IEEE, October 2004
Postel, J., Reynolds, J.: File Transfer Protocol. RFC 959 (Standard), October 1985. http://www.ietf.org/rfc/rfc959.txt, updated by RFCs 2228, 2640, 2773, 3659, 5797
Srebrny, P., Plagemann, T., Goebel, V., Mauthe, A.: CacheCast: eliminating redundant link traffic for single source multiple destination transfer. In: Proceedings of the 2010 30th IEEE International Conference on Distributed Computing Systems (ICDCS). IEEE Computer Society, June 2010
Srebrny, P., Plagemann, T., Goebel, V., Mauthe, A.: No more déjà vu - eliminating redundancy with cachecast: feasibility and performance gains. IEEE/ACM Trans. Networking 21(6), 1736–1749 (2013)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Srebrny, P., Sørbø, D.H.L., Plagemann, T. (2015). Tiny Network Caches with Large Performance Gains for Popular Downloads. In: Aguayo-Torres, M., Gómez, G., Poncela, J. (eds) Wired/Wireless Internet Communications. WWIC 2015. Lecture Notes in Computer Science(), vol 9071. Springer, Cham. https://doi.org/10.1007/978-3-319-22572-2_14
Download citation
DOI: https://doi.org/10.1007/978-3-319-22572-2_14
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-22571-5
Online ISBN: 978-3-319-22572-2
eBook Packages: Computer ScienceComputer Science (R0)