Home > Research > Publications & Outputs > No more deja vu - eliminating redundancy with C...
View graph of relations

No more deja vu - eliminating redundancy with CacheCast: feasibility and performance gains

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Published

Standard

No more deja vu - eliminating redundancy with CacheCast: feasibility and performance gains. / Srebrny, Piotr; Plagemann, T.; Goebel, Vera; et al.
In: IEEE/ACM Transactions on Networking , Vol. 21, No. 6, 12.2013, p. 1736-1749.

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Harvard

Srebrny, P, Plagemann, T, Goebel, V & Mauthe, A 2013, 'No more deja vu - eliminating redundancy with CacheCast: feasibility and performance gains', IEEE/ACM Transactions on Networking , vol. 21, no. 6, pp. 1736-1749. https://doi.org/10.1109/TNET.2012.2236104

APA

Srebrny, P., Plagemann, T., Goebel, V., & Mauthe, A. (2013). No more deja vu - eliminating redundancy with CacheCast: feasibility and performance gains. IEEE/ACM Transactions on Networking , 21(6), 1736-1749. https://doi.org/10.1109/TNET.2012.2236104

Vancouver

Srebrny P, Plagemann T, Goebel V, Mauthe A. No more deja vu - eliminating redundancy with CacheCast: feasibility and performance gains. IEEE/ACM Transactions on Networking . 2013 Dec;21(6):1736-1749. Epub 2013 Jan 10. doi: 10.1109/TNET.2012.2236104

Author

Srebrny, Piotr ; Plagemann, T. ; Goebel, Vera; et al. / No more deja vu - eliminating redundancy with CacheCast : feasibility and performance gains. In: IEEE/ACM Transactions on Networking . 2013 ; Vol. 21, No. 6. pp. 1736-1749.

Bibtex

@article{c62547dc406240eb9e49a80b9a6a035c,
title = "No more deja vu - eliminating redundancy with CacheCast: feasibility and performance gains",
abstract = "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.",
author = "Piotr Srebrny and T. Plagemann and Vera; Goebel and Andreas Mauthe",
year = "2013",
month = dec,
doi = "10.1109/TNET.2012.2236104",
language = "English",
volume = "21",
pages = "1736--1749",
journal = "IEEE/ACM Transactions on Networking ",
issn = "1063-6692",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "6",

}

RIS

TY - JOUR

T1 - No more deja vu - eliminating redundancy with CacheCast

T2 - feasibility and performance gains

AU - Srebrny, Piotr

AU - Plagemann, T.

AU - Goebel, Vera;

AU - Mauthe, Andreas

PY - 2013/12

Y1 - 2013/12

N2 - 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.

AB - 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.

U2 - 10.1109/TNET.2012.2236104

DO - 10.1109/TNET.2012.2236104

M3 - Journal article

VL - 21

SP - 1736

EP - 1749

JO - IEEE/ACM Transactions on Networking

JF - IEEE/ACM Transactions on Networking

SN - 1063-6692

IS - 6

ER -