By Topic

No More Déjà Vu—Eliminating Redundancy With CacheCast: Feasibility and Performance Gains

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Srebrny, P.H. ; Dept. of Inf., Univ. of Oslo, Oslo, Norway ; Plagemann, T. ; Goebel, V. ; Mauthe, A.

Due to the lack of multicast services in the Internet, applications based on single-source, multiple-destination transfers such as video conferencing, IP radio, and IPTV must use unicast. This type of traffic exhibits high redundancy with temporal clustering of duplicated packets. The redundancy originates from multiple transfers of the same data chunk over the same link. We propose CacheCast, a link-layer caching mechanism that eliminates the redundant data transmissions using small caches on links. CacheCast's underlying principles are simplicity and reliability. It is a fully distributed and incrementally deployable architecture. It consists of small caches on links that act independently and a server support that simplifies the link cache operation. Our analysis indicates that transfers of the same data to multiple destinations with CacheCast can achieve near-multicast efficiency in terms of consumed link bandwidth. The implementation of CacheCast proves its feasibility, efficiency, and the improvements of the server.

Published in:

Networking, IEEE/ACM Transactions on  (Volume:21 ,  Issue: 6 )