We have over 12,000 students, from over 100 countries, within one of the safest campuses in the UK


97% of Lancaster students go into work or further study within six months of graduating

Home > Research > Publications & Outputs > CacheCast: Eliminating Redundant Link Traffic f...
View graph of relations

« Back

CacheCast: Eliminating Redundant Link Traffic for Single Source Multiple Destination Transfers

Research output: Contribution in Book/Report/ProceedingsPaper


Publication date2010
Host publicationICDCS '10: Proceedings of the 2010 IEEE 30th International Conference on Distributed Computing Systems
Place of publicationWashington, DC, USA
PublisherIEEE Computer Society
Number of pages12
ISBN (Print)978-1-4244-7261-1
<mark>Original language</mark>English


Due to the lack of multicast services in the Internet, applications based on single source multiple destinations transfers such as video conferencing, IP radio, IPTV must use unicast or application layer multicast. This in turn has several well-known drawbacks. A basic insight is that 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. A single cache removes redundant data from a packet on the link entry and recovers the data on the link exit. Thus, link caches are transparent to routers. We show through analysis and simulation that CacheCast achieves near multicast efficiency for superposition of unicast connections. We implemented CacheCast in ns-2 and show that it does not violate the current understanding of "fairness" in the Internet.