![Page 1: Piotr Srebrny 1. Problem statement Packet caching Thesis claims Contributions Related works Critical review of claims Conclusions Future](https://reader035.vdocuments.us/reader035/viewer/2022062322/5697c0271a28abf838cd66e9/html5/thumbnails/1.jpg)
Piotr Srebrny
1
![Page 2: Piotr Srebrny 1. Problem statement Packet caching Thesis claims Contributions Related works Critical review of claims Conclusions Future](https://reader035.vdocuments.us/reader035/viewer/2022062322/5697c0271a28abf838cd66e9/html5/thumbnails/2.jpg)
Problem statementPacket cachingThesis claimsContributionsRelated worksCritical review of claimsConclusionsFuture work
2
![Page 3: Piotr Srebrny 1. Problem statement Packet caching Thesis claims Contributions Related works Critical review of claims Conclusions Future](https://reader035.vdocuments.us/reader035/viewer/2022062322/5697c0271a28abf838cd66e9/html5/thumbnails/3.jpg)
Internet is a content distribution network P2P, file hosting, and streaming account for
more than 80% of the Internet traffic (“Internet study”, Ipoque, 2009)
Single source multiple destination transport mechanism is fundamental
At present, Internet does not provide efficient multi-point transport mechanism
3
![Page 4: Piotr Srebrny 1. Problem statement Packet caching Thesis claims Contributions Related works Critical review of claims Conclusions Future](https://reader035.vdocuments.us/reader035/viewer/2022062322/5697c0271a28abf838cd66e9/html5/thumbnails/4.jpg)
Server transmitting the same data to multiple destinations is wasting the Internet resources The same data traverses the same path
multiple times
D
C
S
A
BP D P C P B P A
4
![Page 5: Piotr Srebrny 1. Problem statement Packet caching Thesis claims Contributions Related works Critical review of claims Conclusions Future](https://reader035.vdocuments.us/reader035/viewer/2022062322/5697c0271a28abf838cd66e9/html5/thumbnails/5.jpg)
The goal of this work is to
remove the Internet redundancy in a minimal invasive way
5
![Page 6: Piotr Srebrny 1. Problem statement Packet caching Thesis claims Contributions Related works Critical review of claims Conclusions Future](https://reader035.vdocuments.us/reader035/viewer/2022062322/5697c0271a28abf838cd66e9/html5/thumbnails/6.jpg)
“Datagram routing for internet multicasting”, L. Aguilar, 1984 – explicit list of destinations in the IP header
“Host groups: A multicast extension for datagram internetworks”, D. Cheriton and S. Deering, 1985 – destination address denotes a group of host
“A case for end system multicast”, Y. hua Chu et al., 2000 – application layer multicast
6
![Page 7: Piotr Srebrny 1. Problem statement Packet caching Thesis claims Contributions Related works Critical review of claims Conclusions Future](https://reader035.vdocuments.us/reader035/viewer/2022062322/5697c0271a28abf838cd66e9/html5/thumbnails/7.jpg)
Consider two packets A and B that carry the same content and travel the same few hops
P AA
BP P P
7
![Page 8: Piotr Srebrny 1. Problem statement Packet caching Thesis claims Contributions Related works Critical review of claims Conclusions Future](https://reader035.vdocuments.us/reader035/viewer/2022062322/5697c0271a28abf838cd66e9/html5/thumbnails/8.jpg)
Consider two packets A and B that carry the same content and travel the same few hops
P BA
BP P P
B P B
8
![Page 9: Piotr Srebrny 1. Problem statement Packet caching Thesis claims Contributions Related works Critical review of claims Conclusions Future](https://reader035.vdocuments.us/reader035/viewer/2022062322/5697c0271a28abf838cd66e9/html5/thumbnails/9.jpg)
I. Packet Caching system can achieve near multicast bandwidth savings
II. Packet Caching system requires server support
III. Packet Caching system is incrementally deployable
IV. Packet Caching system preserves fairness in Internet
9
![Page 10: Piotr Srebrny 1. Problem statement Packet caching Thesis claims Contributions Related works Critical review of claims Conclusions Future](https://reader035.vdocuments.us/reader035/viewer/2022062322/5697c0271a28abf838cd66e9/html5/thumbnails/10.jpg)
Principles
Feasibility
Environmental impact
10
![Page 11: Piotr Srebrny 1. Problem statement Packet caching Thesis claims Contributions Related works Critical review of claims Conclusions Future](https://reader035.vdocuments.us/reader035/viewer/2022062322/5697c0271a28abf838cd66e9/html5/thumbnails/11.jpg)
I. Contribution
11
![Page 12: Piotr Srebrny 1. Problem statement Packet caching Thesis claims Contributions Related works Critical review of claims Conclusions Future](https://reader035.vdocuments.us/reader035/viewer/2022062322/5697c0271a28abf838cd66e9/html5/thumbnails/12.jpg)
Network elements: Link
Medium transporting packets Very deterministic Throughput limited in bits per second
Router Switches data packets between links Very unpredictable Throughput limited in packets per second
12
(I) Cache payloads on links
![Page 13: Piotr Srebrny 1. Problem statement Packet caching Thesis claims Contributions Related works Critical review of claims Conclusions Future](https://reader035.vdocuments.us/reader035/viewer/2022062322/5697c0271a28abf838cd66e9/html5/thumbnails/13.jpg)
Caching is done on per link basis Cache Management Unit (CMU) removes
payloads that are stored on the link exit Cache Store Unit (CSU) restores payloads
from a local cache
13
![Page 14: Piotr Srebrny 1. Problem statement Packet caching Thesis claims Contributions Related works Critical review of claims Conclusions Future](https://reader035.vdocuments.us/reader035/viewer/2022062322/5697c0271a28abf838cd66e9/html5/thumbnails/14.jpg)
Link cache processing must be simple ~72ns to process a minimum size packet on a
10Gbps link Modern memory r/w cycle ~6-20ns
Link cache size must be minimised At present, a link queue is scaled to 250ms of
the link traffic Difficult to build!
14
(II) A source of redundant data must support caching!
![Page 15: Piotr Srebrny 1. Problem statement Packet caching Thesis claims Contributions Related works Critical review of claims Conclusions Future](https://reader035.vdocuments.us/reader035/viewer/2022062322/5697c0271a28abf838cd66e9/html5/thumbnails/15.jpg)
Server can transmit packets carrying the same data within a minimum time interval
Server can mark its redundant traffic
Server can provide additional information on packet content
15
![Page 16: Piotr Srebrny 1. Problem statement Packet caching Thesis claims Contributions Related works Critical review of claims Conclusions Future](https://reader035.vdocuments.us/reader035/viewer/2022062322/5697c0271a28abf838cd66e9/html5/thumbnails/16.jpg)
Two components of the CacheCast system Server support Distributed infrastructure of small link caches
D
C
S
A
BD C B P A
CMU CSU CMU CSU
16
![Page 17: Piotr Srebrny 1. Problem statement Packet caching Thesis claims Contributions Related works Critical review of claims Conclusions Future](https://reader035.vdocuments.us/reader035/viewer/2022062322/5697c0271a28abf838cd66e9/html5/thumbnails/17.jpg)
Packet train Only the first packet carries the payload The remaining packets truncated to the
header
18
![Page 18: Piotr Srebrny 1. Problem statement Packet caching Thesis claims Contributions Related works Critical review of claims Conclusions Future](https://reader035.vdocuments.us/reader035/viewer/2022062322/5697c0271a28abf838cd66e9/html5/thumbnails/18.jpg)
Packet train duration time
It is sufficient to hold payload in the CSU for the packet train duration time
What is the maximum packet train duration time?
19
![Page 19: Piotr Srebrny 1. Problem statement Packet caching Thesis claims Contributions Related works Critical review of claims Conclusions Future](https://reader035.vdocuments.us/reader035/viewer/2022062322/5697c0271a28abf838cd66e9/html5/thumbnails/19.jpg)
Back-of-the-envelope calculations
~10ms caches are sufficient
20
![Page 20: Piotr Srebrny 1. Problem statement Packet caching Thesis claims Contributions Related works Critical review of claims Conclusions Future](https://reader035.vdocuments.us/reader035/viewer/2022062322/5697c0271a28abf838cd66e9/html5/thumbnails/20.jpg)
II. Contribution
21
![Page 21: Piotr Srebrny 1. Problem statement Packet caching Thesis claims Contributions Related works Critical review of claims Conclusions Future](https://reader035.vdocuments.us/reader035/viewer/2022062322/5697c0271a28abf838cd66e9/html5/thumbnails/21.jpg)
Two aspects of the CacheCast system
I. Efficiency How much redundancy CacheCast
removes?II.Computational complexity
Can CacheCast be implemented efficiently with the present technology?
22
![Page 22: Piotr Srebrny 1. Problem statement Packet caching Thesis claims Contributions Related works Critical review of claims Conclusions Future](https://reader035.vdocuments.us/reader035/viewer/2022062322/5697c0271a28abf838cd66e9/html5/thumbnails/22.jpg)
CacheCast and ‘Perfect multicast’ ‘Perfect multicast’ – delivers data to
multiple destinations without any overhead
CacheCast overheadsI. Unique packet header per destinationII.Finite link cache size resulting in payload
retransmissionsIII.Partial deployment
23
![Page 23: Piotr Srebrny 1. Problem statement Packet caching Thesis claims Contributions Related works Critical review of claims Conclusions Future](https://reader035.vdocuments.us/reader035/viewer/2022062322/5697c0271a28abf838cd66e9/html5/thumbnails/23.jpg)
Example
Lm – total amount of multicast linksLu – total amount of unicast links
u
mm L
L1
5,9 mu LL
%449
4
9
51 m
24
![Page 24: Piotr Srebrny 1. Problem statement Packet caching Thesis claims Contributions Related works Critical review of claims Conclusions Future](https://reader035.vdocuments.us/reader035/viewer/2022062322/5697c0271a28abf838cd66e9/html5/thumbnails/24.jpg)
CacheCast unicast header part (h) and multicast payload part (p)
Thus:
E.g.: using packets where sp=1436B and sh=64B, CacheCast achieves 96% of the ‘perfect multicast’ efficiency
uph
mpuhCC Lss
LsLs
)(1
u
mm L
L1
p
hmCC s
sr
r
,1
1
25
![Page 25: Piotr Srebrny 1. Problem statement Packet caching Thesis claims Contributions Related works Critical review of claims Conclusions Future](https://reader035.vdocuments.us/reader035/viewer/2022062322/5697c0271a28abf838cd66e9/html5/thumbnails/25.jpg)
System efficiency δm for 10ms large caches
26
![Page 26: Piotr Srebrny 1. Problem statement Packet caching Thesis claims Contributions Related works Critical review of claims Conclusions Future](https://reader035.vdocuments.us/reader035/viewer/2022062322/5697c0271a28abf838cd66e9/html5/thumbnails/26.jpg)
S
CMU and CSU deployed partially
1 2 3 4 5 6
27
![Page 27: Piotr Srebrny 1. Problem statement Packet caching Thesis claims Contributions Related works Critical review of claims Conclusions Future](https://reader035.vdocuments.us/reader035/viewer/2022062322/5697c0271a28abf838cd66e9/html5/thumbnails/27.jpg)
28
![Page 28: Piotr Srebrny 1. Problem statement Packet caching Thesis claims Contributions Related works Critical review of claims Conclusions Future](https://reader035.vdocuments.us/reader035/viewer/2022062322/5697c0271a28abf838cd66e9/html5/thumbnails/28.jpg)
Computational complexity may render CacheCast inefficient
Implementations Server support – a Linux system call and
an auxiliary shell command tool
Link cache elements – implemented with Click Modular Router Software as processing elements
30
![Page 29: Piotr Srebrny 1. Problem statement Packet caching Thesis claims Contributions Related works Critical review of claims Conclusions Future](https://reader035.vdocuments.us/reader035/viewer/2022062322/5697c0271a28abf838cd66e9/html5/thumbnails/29.jpg)
New system call msend()
msend() compared with the standard send()system call
31
![Page 30: Piotr Srebrny 1. Problem statement Packet caching Thesis claims Contributions Related works Critical review of claims Conclusions Future](https://reader035.vdocuments.us/reader035/viewer/2022062322/5697c0271a28abf838cd66e9/html5/thumbnails/30.jpg)
Server transmitting to100 destinations using Loop of send() sys. calls A single msend() sys. call
msend() system call outperforms the standard send() system call when transmitting to multiple destinations
32
![Page 31: Piotr Srebrny 1. Problem statement Packet caching Thesis claims Contributions Related works Critical review of claims Conclusions Future](https://reader035.vdocuments.us/reader035/viewer/2022062322/5697c0271a28abf838cd66e9/html5/thumbnails/31.jpg)
Click Modular Router Software CMU and CSU implemented as
processing elementsCacheCast router
33
![Page 32: Piotr Srebrny 1. Problem statement Packet caching Thesis claims Contributions Related works Critical review of claims Conclusions Future](https://reader035.vdocuments.us/reader035/viewer/2022062322/5697c0271a28abf838cd66e9/html5/thumbnails/32.jpg)
Due to CSU and CMU elements CacheCast router cannot forward packet trains at line rate
34
![Page 33: Piotr Srebrny 1. Problem statement Packet caching Thesis claims Contributions Related works Critical review of claims Conclusions Future](https://reader035.vdocuments.us/reader035/viewer/2022062322/5697c0271a28abf838cd66e9/html5/thumbnails/33.jpg)
When compared with a standard router CacheCast router can forward more data
35
![Page 34: Piotr Srebrny 1. Problem statement Packet caching Thesis claims Contributions Related works Critical review of claims Conclusions Future](https://reader035.vdocuments.us/reader035/viewer/2022062322/5697c0271a28abf838cd66e9/html5/thumbnails/34.jpg)
Testbed setup
Clients from machines A and B gradually connect to server S
36
![Page 35: Piotr Srebrny 1. Problem statement Packet caching Thesis claims Contributions Related works Critical review of claims Conclusions Future](https://reader035.vdocuments.us/reader035/viewer/2022062322/5697c0271a28abf838cd66e9/html5/thumbnails/35.jpg)
Original paraslash server can only handle 74 clients
CacheCast paraslash server can handle 1020 clients and more depending on the chunk size
Server load is reduced when using large chunks
37
![Page 36: Piotr Srebrny 1. Problem statement Packet caching Thesis claims Contributions Related works Critical review of claims Conclusions Future](https://reader035.vdocuments.us/reader035/viewer/2022062322/5697c0271a28abf838cd66e9/html5/thumbnails/36.jpg)
III. Contribution
38
![Page 37: Piotr Srebrny 1. Problem statement Packet caching Thesis claims Contributions Related works Critical review of claims Conclusions Future](https://reader035.vdocuments.us/reader035/viewer/2022062322/5697c0271a28abf838cd66e9/html5/thumbnails/37.jpg)
Internet congestion avoidance relies on communicating end-points that adjust transmission rate to the network conditions
CacheCast transparently removes redundancy increasing network capacity
It is not given how congestion control algorithms behave in the CacheCast presence
39
![Page 38: Piotr Srebrny 1. Problem statement Packet caching Thesis claims Contributions Related works Critical review of claims Conclusions Future](https://reader035.vdocuments.us/reader035/viewer/2022062322/5697c0271a28abf838cd66e9/html5/thumbnails/38.jpg)
CacheCast implemented in ns-2 Simulation setup:
Bottleneck link topology 100 TCP flows and
100 TFRC flows Link cache operating
on a bottleneck link
40
![Page 39: Piotr Srebrny 1. Problem statement Packet caching Thesis claims Contributions Related works Critical review of claims Conclusions Future](https://reader035.vdocuments.us/reader035/viewer/2022062322/5697c0271a28abf838cd66e9/html5/thumbnails/39.jpg)
TCP flows consume the spare capacity TFRC flows increase end-to-end throughput
CacheCast preserves the Internet ‘fairness’
41
![Page 40: Piotr Srebrny 1. Problem statement Packet caching Thesis claims Contributions Related works Critical review of claims Conclusions Future](https://reader035.vdocuments.us/reader035/viewer/2022062322/5697c0271a28abf838cd66e9/html5/thumbnails/40.jpg)
J. Santos and D. Wetherall, “Increasing effective link bandwidth by suppressing replicated data,” USENIX’98
A. Anand, A. Gupta, A. Akella, S. Seshan, and S. Shenker, “Packet caches on routers: the implications of universal redundant traffic elimination,” SIGCOMM’08
A. Anand, V. Sekar, and A. Akella, “SmartRe: an architecture for coordinated network-wide redundancy elimination,” SIGCOMM’09
42
![Page 41: Piotr Srebrny 1. Problem statement Packet caching Thesis claims Contributions Related works Critical review of claims Conclusions Future](https://reader035.vdocuments.us/reader035/viewer/2022062322/5697c0271a28abf838cd66e9/html5/thumbnails/41.jpg)
I. Packet caching system can achieve near multicast bandwidth savings
II. Packet caching system requires server support
III. Packet caching system is incrementally deployable
IV. Packet caching system preserves fairness in Internet
43
![Page 42: Piotr Srebrny 1. Problem statement Packet caching Thesis claims Contributions Related works Critical review of claims Conclusions Future](https://reader035.vdocuments.us/reader035/viewer/2022062322/5697c0271a28abf838cd66e9/html5/thumbnails/42.jpg)
I. Packet caching system can achieve near multicast bandwidth savings
II. Packet caching system requires server support
III. Packet caching system is incrementally deployable
IV. Packet caching system preserves fairness in Internet
44
![Page 43: Piotr Srebrny 1. Problem statement Packet caching Thesis claims Contributions Related works Critical review of claims Conclusions Future](https://reader035.vdocuments.us/reader035/viewer/2022062322/5697c0271a28abf838cd66e9/html5/thumbnails/43.jpg)
I. Packet caching system can achieve near multicast bandwidth savings
II. Packet caching system requires server support
III. Packet caching system is incrementally deployable
IV. Packet caching system preserves fairness in Internet
45
![Page 44: Piotr Srebrny 1. Problem statement Packet caching Thesis claims Contributions Related works Critical review of claims Conclusions Future](https://reader035.vdocuments.us/reader035/viewer/2022062322/5697c0271a28abf838cd66e9/html5/thumbnails/44.jpg)
I. Packet caching system can achieve near multicast bandwidth savings
II. Packet caching system requires server support
III. Packet caching system is incrementally deployable
IV.Packet caching system preserves fairness in Internet
46
![Page 45: Piotr Srebrny 1. Problem statement Packet caching Thesis claims Contributions Related works Critical review of claims Conclusions Future](https://reader035.vdocuments.us/reader035/viewer/2022062322/5697c0271a28abf838cd66e9/html5/thumbnails/45.jpg)
Getting CacheCast into the real world
Server support
Link cache
II and III generations of router
47
![Page 46: Piotr Srebrny 1. Problem statement Packet caching Thesis claims Contributions Related works Critical review of claims Conclusions Future](https://reader035.vdocuments.us/reader035/viewer/2022062322/5697c0271a28abf838cd66e9/html5/thumbnails/46.jpg)
48