cs 268: computer networking l-21 multicast. 2 multicast routing unicast: one source to one...
Post on 21-Dec-2015
217 views
TRANSCRIPT
![Page 1: CS 268: Computer Networking L-21 Multicast. 2 Multicast Routing Unicast: one source to one destination Multicast: one source to many destinations Two](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649d595503460f94a39935/html5/thumbnails/1.jpg)
CS 268: Computer Networking
L-21 Multicast
![Page 2: CS 268: Computer Networking L-21 Multicast. 2 Multicast Routing Unicast: one source to one destination Multicast: one source to many destinations Two](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649d595503460f94a39935/html5/thumbnails/2.jpg)
2
Multicast Routing
• Unicast: one source to one destination
• Multicast: one source to many destinations
• Two main functions:• Efficient data distribution • Logical naming of a group
![Page 3: CS 268: Computer Networking L-21 Multicast. 2 Multicast Routing Unicast: one source to one destination Multicast: one source to many destinations Two](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649d595503460f94a39935/html5/thumbnails/3.jpg)
3
Example Applications
• Broadcast audio/video• Push-based systems• Software distribution• Web-cache updates • Teleconferencing (audio, video, shared
whiteboard, text editor)• Multi-player games• Server/service location• Other distributed applications
![Page 4: CS 268: Computer Networking L-21 Multicast. 2 Multicast Routing Unicast: one source to one destination Multicast: one source to many destinations Two](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649d595503460f94a39935/html5/thumbnails/4.jpg)
4
Overview
• IP Multicast Service Basics
• Multicast Routing Basics
• Overlay Multicast
• Reliability
• Congestion Control
![Page 5: CS 268: Computer Networking L-21 Multicast. 2 Multicast Routing Unicast: one source to one destination Multicast: one source to many destinations Two](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649d595503460f94a39935/html5/thumbnails/5.jpg)
5
IP Multicast Architecture
Hosts
Routers
Service model
Host-to-router protocol(IGMP)
Multicast routing protocols(various)
![Page 6: CS 268: Computer Networking L-21 Multicast. 2 Multicast Routing Unicast: one source to one destination Multicast: one source to many destinations Two](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649d595503460f94a39935/html5/thumbnails/6.jpg)
6
Multicast – Efficient Data Distribution
Src Src
![Page 7: CS 268: Computer Networking L-21 Multicast. 2 Multicast Routing Unicast: one source to one destination Multicast: one source to many destinations Two](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649d595503460f94a39935/html5/thumbnails/7.jpg)
7
Multicast Router Responsibilities
• Learn of the existence of multicast groups (through advertisement)
• Identify links with group members
• Establish state to route packets• Replicate packets on appropriate interfaces• Routing entry:
Src, incoming interface List of outgoing interfaces
![Page 8: CS 268: Computer Networking L-21 Multicast. 2 Multicast Routing Unicast: one source to one destination Multicast: one source to many destinations Two](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649d595503460f94a39935/html5/thumbnails/8.jpg)
8
IP Multicast Service Model (rfc1112)
• Each group identified by a single IP address• Groups may be of any size• Members of groups may be located anywhere in
the Internet• Members of groups can join and leave at will• Senders need not be members• Group membership not known explicitly • Analogy:
• Each multicast address is like a radio frequency, on which anyone can transmit, and to which anyone can tune-in.
![Page 9: CS 268: Computer Networking L-21 Multicast. 2 Multicast Routing Unicast: one source to one destination Multicast: one source to many destinations Two](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649d595503460f94a39935/html5/thumbnails/9.jpg)
9
IP Multicast Addresses
• Class D IP addresses• 224.0.0.0 – 239.255.255.255
• How to allocate these addresses?• Well-known multicast addresses, assigned by
IANA• Transient multicast addresses, assigned and
reclaimed dynamically, e.g., by “sdr” program
1 1 1 0 Group ID
![Page 10: CS 268: Computer Networking L-21 Multicast. 2 Multicast Routing Unicast: one source to one destination Multicast: one source to many destinations Two](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649d595503460f94a39935/html5/thumbnails/10.jpg)
11
Multicast Scope Control – Small TTLs
• TTL expanding-ring search to reach or find a nearby subset of a group
s
1
2
3
![Page 11: CS 268: Computer Networking L-21 Multicast. 2 Multicast Routing Unicast: one source to one destination Multicast: one source to many destinations Two](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649d595503460f94a39935/html5/thumbnails/11.jpg)
12
Multicast Scope Control – Large TTLs
• Administrative TTL Boundaries to keep multicast traffic within an administrative domain, e.g., for privacy or resource reasons
An administrative domain
TTL threshold set oninterfaces to these links,greater than the diameterof the admin. domain
The rest of the Internet
![Page 12: CS 268: Computer Networking L-21 Multicast. 2 Multicast Routing Unicast: one source to one destination Multicast: one source to many destinations Two](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649d595503460f94a39935/html5/thumbnails/12.jpg)
13
Overview
• IP Multicast Service Basics
• Multicast Routing Basics
• Overlay Multicast
• Reliability
• Congestion Control
![Page 13: CS 268: Computer Networking L-21 Multicast. 2 Multicast Routing Unicast: one source to one destination Multicast: one source to many destinations Two](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649d595503460f94a39935/html5/thumbnails/13.jpg)
14
IP Multicast Architecture
Hosts
Routers
Service model
Host-to-router protocol(IGMP)
Multicast routing protocols(various)
![Page 14: CS 268: Computer Networking L-21 Multicast. 2 Multicast Routing Unicast: one source to one destination Multicast: one source to many destinations Two](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649d595503460f94a39935/html5/thumbnails/14.jpg)
15
Multicast Routing
• Basic objective – build distribution tree for multicast packets
• Multicast service model makes it hard• Anonymity• Dynamic join/leave
![Page 15: CS 268: Computer Networking L-21 Multicast. 2 Multicast Routing Unicast: one source to one destination Multicast: one source to many destinations Two](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649d595503460f94a39935/html5/thumbnails/15.jpg)
16
Shared vs. Source-based Trees
• Source-based trees• Separate shortest path tree for each sender • DVMRP, MOSPF, PIM-DM, PIM-SM
• Shared trees• Single tree shared by all members• Data flows on same tree regardless of sender• CBT, PIM-SM
![Page 16: CS 268: Computer Networking L-21 Multicast. 2 Multicast Routing Unicast: one source to one destination Multicast: one source to many destinations Two](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649d595503460f94a39935/html5/thumbnails/16.jpg)
17
Source-based Trees
Router
Source
Receiver
S
R
R
R
R
R
S
S
![Page 17: CS 268: Computer Networking L-21 Multicast. 2 Multicast Routing Unicast: one source to one destination Multicast: one source to many destinations Two](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649d595503460f94a39935/html5/thumbnails/17.jpg)
18
Shared Tree
RP
Router
Source
Receiver
S
S
S
R
R
R
R
R
![Page 18: CS 268: Computer Networking L-21 Multicast. 2 Multicast Routing Unicast: one source to one destination Multicast: one source to many destinations Two](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649d595503460f94a39935/html5/thumbnails/18.jpg)
19
Shared vs. Source-Based Trees
• Source-based trees• Shortest path trees – low delay, better load distribution• More state at routers (per-source state)• Efficient for in dense-area multicast
• Shared trees• Higher delay (bounded by factor of 2), traffic
concentration• Choice of core affects efficiency• Per-group state at routers• Efficient for sparse-area multicast
• Which is better? extra state in routers is bad!
![Page 19: CS 268: Computer Networking L-21 Multicast. 2 Multicast Routing Unicast: one source to one destination Multicast: one source to many destinations Two](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649d595503460f94a39935/html5/thumbnails/19.jpg)
20
Routing Techniques
• Flood and prune• Begin by flooding traffic to entire network• Prune branches with no receivers• Examples: DVMRP, PIM-DM• Unwanted state where there are no receivers
• Link-state multicast protocols• Routers advertise groups for which they have receivers
to entire network• Compute trees on demand• Example: MOSPF• Unwanted state where there are no senders
![Page 20: CS 268: Computer Networking L-21 Multicast. 2 Multicast Routing Unicast: one source to one destination Multicast: one source to many destinations Two](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649d595503460f94a39935/html5/thumbnails/20.jpg)
21
Routing Techniques
• Core based protocols• Specify “meeting place” aka core• Sources send initial packets to core• Receivers join group at core• Requires mapping between multicast group
address and “meeting place” • Examples: CBT, PIM-SM
![Page 21: CS 268: Computer Networking L-21 Multicast. 2 Multicast Routing Unicast: one source to one destination Multicast: one source to many destinations Two](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649d595503460f94a39935/html5/thumbnails/21.jpg)
22
Distance-Vector Multicast Routing
• DVMRP consists of two major components:• A conventional distance-vector routing protocol
(like RIP) • A protocol for determining how to forward
multicast packets, based on the routing table
• DVMRP router forwards a packet if• The packet arrived from the link used to reach
the source of the packet (reverse path forwarding check – RPF)
• If downstream links have not pruned the tree
![Page 22: CS 268: Computer Networking L-21 Multicast. 2 Multicast Routing Unicast: one source to one destination Multicast: one source to many destinations Two](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649d595503460f94a39935/html5/thumbnails/22.jpg)
23
Example Topology
G G
S
G
![Page 23: CS 268: Computer Networking L-21 Multicast. 2 Multicast Routing Unicast: one source to one destination Multicast: one source to many destinations Two](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649d595503460f94a39935/html5/thumbnails/23.jpg)
24
Broadcast with Truncation
G G
S
G
![Page 24: CS 268: Computer Networking L-21 Multicast. 2 Multicast Routing Unicast: one source to one destination Multicast: one source to many destinations Two](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649d595503460f94a39935/html5/thumbnails/24.jpg)
25
Prune
G G
S
Prune (s,g)
Prune (s,g)
G
![Page 25: CS 268: Computer Networking L-21 Multicast. 2 Multicast Routing Unicast: one source to one destination Multicast: one source to many destinations Two](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649d595503460f94a39935/html5/thumbnails/25.jpg)
26
Graft (s,g)
Graft (s,g)
Graft
G G
S
G
G
Report (g)
![Page 26: CS 268: Computer Networking L-21 Multicast. 2 Multicast Routing Unicast: one source to one destination Multicast: one source to many destinations Two](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649d595503460f94a39935/html5/thumbnails/26.jpg)
27
Steady State
G G
S
G
G
![Page 27: CS 268: Computer Networking L-21 Multicast. 2 Multicast Routing Unicast: one source to one destination Multicast: one source to many destinations Two](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649d595503460f94a39935/html5/thumbnails/27.jpg)
28
Overview
• IP Multicast Service Basics
• Multicast Routing Basics
• Overlay Multicast
• Reliability
• Congestion Control
![Page 28: CS 268: Computer Networking L-21 Multicast. 2 Multicast Routing Unicast: one source to one destination Multicast: one source to many destinations Two](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649d595503460f94a39935/html5/thumbnails/28.jpg)
29
Supporting Multicast on the Internet
IP
Application
Internet architecture
Network
?
?
At which layer should multicast be implemented?
![Page 29: CS 268: Computer Networking L-21 Multicast. 2 Multicast Routing Unicast: one source to one destination Multicast: one source to many destinations Two](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649d595503460f94a39935/html5/thumbnails/29.jpg)
30
IP Multicast
CMU
BerkeleyMIT
UCSD
routersend systemsmulticast flow
• Highly efficient
• Good delay
![Page 30: CS 268: Computer Networking L-21 Multicast. 2 Multicast Routing Unicast: one source to one destination Multicast: one source to many destinations Two](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649d595503460f94a39935/html5/thumbnails/30.jpg)
31
End System Multicast
MIT1
MIT2
CMU1
CMU2
UCSD
MIT1
MIT2
CMU2
Overlay Tree
Berkeley
CMU1
CMU
BerkeleyMIT
UCSD
![Page 31: CS 268: Computer Networking L-21 Multicast. 2 Multicast Routing Unicast: one source to one destination Multicast: one source to many destinations Two](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649d595503460f94a39935/html5/thumbnails/31.jpg)
32
• Quick deployment
• All multicast state in end systems
• Computation at forwarding points simplifies support for higher level functionality
Potential Benefits Over IP Multicast
MIT1
MIT2
CMU1
CMU2
CMU
BerkeleyMIT
UCSD
![Page 32: CS 268: Computer Networking L-21 Multicast. 2 Multicast Routing Unicast: one source to one destination Multicast: one source to many destinations Two](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649d595503460f94a39935/html5/thumbnails/32.jpg)
33
Concerns with End System Multicast
• Self-organize recipients into multicast delivery overlay tree• Must be closely matched to real network topology to be
efficient• Performance concerns compared to IP Multicast
• Increase in delay• Bandwidth waste (packet duplication)
MIT2
Berkeley MIT1
UCSD
CMU2
CMU1
IP Multicast
MIT2
Berkeley MIT1
CMU1
CMU2
UCSD
End System Multicast
![Page 33: CS 268: Computer Networking L-21 Multicast. 2 Multicast Routing Unicast: one source to one destination Multicast: one source to many destinations Two](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649d595503460f94a39935/html5/thumbnails/33.jpg)
34
Overview
• IP Multicast Service Basics
• Multicast Routing Basics
• Overlay Multicast
• Reliability
• Congestion Control
![Page 34: CS 268: Computer Networking L-21 Multicast. 2 Multicast Routing Unicast: one source to one destination Multicast: one source to many destinations Two](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649d595503460f94a39935/html5/thumbnails/34.jpg)
35
R1
Implosion
S
R3 R4
R2
21
R1
S
R3 R4
R2
Packet 1 is lost All 4 receivers request a resend
Resend request
![Page 35: CS 268: Computer Networking L-21 Multicast. 2 Multicast Routing Unicast: one source to one destination Multicast: one source to many destinations Two](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649d595503460f94a39935/html5/thumbnails/35.jpg)
36
Retransmission
• Re-transmitter• Options: sender, other receivers
• How to retransmit• Unicast, multicast, scoped multicast,
retransmission group, …
• Problem: Exposure
![Page 36: CS 268: Computer Networking L-21 Multicast. 2 Multicast Routing Unicast: one source to one destination Multicast: one source to many destinations Two](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649d595503460f94a39935/html5/thumbnails/36.jpg)
37
R1
Exposure
S
R3 R4
R2
21
R1
S
R3 R4
R2
Packet 1 does not reach R1;Receiver 1 requests a resend
Packet 1 resent to all 4 receivers
1
1
Resend request Resent packet
![Page 37: CS 268: Computer Networking L-21 Multicast. 2 Multicast Routing Unicast: one source to one destination Multicast: one source to many destinations Two](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649d595503460f94a39935/html5/thumbnails/37.jpg)
38
Ideal Recovery Model
S
R3 R4
R2
2
1
S
R3 R4
R2
Packet 1 reaches R1 but is lost before reaching other Receivers
Only one receiver sends NACK to the nearest S or R with packet
Resend request
1 1Resent packet
Repair sent only to those that need packet
R1 R1
![Page 38: CS 268: Computer Networking L-21 Multicast. 2 Multicast Routing Unicast: one source to one destination Multicast: one source to many destinations Two](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649d595503460f94a39935/html5/thumbnails/38.jpg)
39
Scalable Reliable Multicast (SRM)
• Originally designed for wb
• Receiver-reliable• NACK-based
• Every member may multicast NACK or retransmission
![Page 39: CS 268: Computer Networking L-21 Multicast. 2 Multicast Routing Unicast: one source to one destination Multicast: one source to many destinations Two](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649d595503460f94a39935/html5/thumbnails/39.jpg)
40
R1
SRM Request Suppression
S
R3
R2
21
R1
S
R3
R2
Packet 1 is lost; R1 requests resend to Source and Receivers
Packet 1 is resent; R2 and R3 no longer have to request a resend
1
X
XDelay varies by distance
X
Resend request Resent packet
![Page 40: CS 268: Computer Networking L-21 Multicast. 2 Multicast Routing Unicast: one source to one destination Multicast: one source to many destinations Two](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649d595503460f94a39935/html5/thumbnails/40.jpg)
41
Deterministic Suppression
d
d
d
d
3d
Time
data
nack repair
d
4d
d
2d
3d
= Sender
= Repairer
= Requestor
Delay = C1dS,R
![Page 41: CS 268: Computer Networking L-21 Multicast. 2 Multicast Routing Unicast: one source to one destination Multicast: one source to many destinations Two](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649d595503460f94a39935/html5/thumbnails/41.jpg)
42
SRM Star Topology
S
R2
21
R3
Packet 1 is lost; All Receivers request resends
Packet 1 is resent to all Receivers
X
R4
Delay is same length
S
R2
1
R3 R4
Resend request Resent packet
![Page 42: CS 268: Computer Networking L-21 Multicast. 2 Multicast Routing Unicast: one source to one destination Multicast: one source to many destinations Two](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649d595503460f94a39935/html5/thumbnails/42.jpg)
43
SRM: Stochastic Suppression
datad
d
d
d
Time
NACK
repair
2d
session msg
0
1
2
3
Delay = U[0,D2] dS,R
= Sender
= Repairer
= Requestor
![Page 43: CS 268: Computer Networking L-21 Multicast. 2 Multicast Routing Unicast: one source to one destination Multicast: one source to many destinations Two](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649d595503460f94a39935/html5/thumbnails/43.jpg)
44
SRM (Summary)
• NACK/Retransmission suppression• Delay before sending• Delay based on RTT estimation• Deterministic + Stochastic components
• Periodic session messages• Full reliability• Estimation of distance matrix among members
![Page 44: CS 268: Computer Networking L-21 Multicast. 2 Multicast Routing Unicast: one source to one destination Multicast: one source to many destinations Two](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649d595503460f94a39935/html5/thumbnails/44.jpg)
45
Overview
• IP Multicast Service Basics
• Multicast Routing Basics
• Overlay Multicast
• Reliability
• Congestion Control
![Page 45: CS 268: Computer Networking L-21 Multicast. 2 Multicast Routing Unicast: one source to one destination Multicast: one source to many destinations Two](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649d595503460f94a39935/html5/thumbnails/45.jpg)
46
Multicast Congestion Control
• What if receivers have very different bandwidths?
• Send at max?
• Send at min?
• Send at avg?
R
R
R
S
???Mb/s
100Mb/s
100Mb/s
1Mb/s
1Mb/s
56Kb/s
R
![Page 46: CS 268: Computer Networking L-21 Multicast. 2 Multicast Routing Unicast: one source to one destination Multicast: one source to many destinations Two](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649d595503460f94a39935/html5/thumbnails/46.jpg)
47
Video Adaptation: RLM
• Receiver-driven Layered Multicast
• Layered video encoding
• Each layer uses its own mcast group
• On spare capacity, receivers add a layer
• On congestion, receivers drop a layer
• Join experiments used for shared learning
![Page 47: CS 268: Computer Networking L-21 Multicast. 2 Multicast Routing Unicast: one source to one destination Multicast: one source to many destinations Two](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649d595503460f94a39935/html5/thumbnails/47.jpg)
48
Layered Media Streams
S R
R1R2
R3
R10Mbps
10Mbps
512Kbps
128Kbps
10Mbps
R3 joins layer 1, fails at layer 2
R2 join layer 1,join layer 2 fails at layer 3
R1 joins layer 1,joins layer 2 joins layer 3
![Page 48: CS 268: Computer Networking L-21 Multicast. 2 Multicast Routing Unicast: one source to one destination Multicast: one source to many destinations Two](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649d595503460f94a39935/html5/thumbnails/48.jpg)
49
Drop Policies for Layered Multicast
• Priority• Packets for low bandwidth layers are kept, drop
queued packets for higher layers• Requires router support
• Uniform (e.g., drop tail, RED)• Packets arriving at congested router are
dropped regardless of their layer
• Which is better?
![Page 49: CS 268: Computer Networking L-21 Multicast. 2 Multicast Routing Unicast: one source to one destination Multicast: one source to many destinations Two](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649d595503460f94a39935/html5/thumbnails/49.jpg)
50
RLM Intuition
Uniform vs. Priority Dropping
0
10
20
30
40
50
60
70
Offered load
Performance
Uniform
Priority
![Page 50: CS 268: Computer Networking L-21 Multicast. 2 Multicast Routing Unicast: one source to one destination Multicast: one source to many destinations Two](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649d595503460f94a39935/html5/thumbnails/50.jpg)
51
RLM Intuition
• Uniform• Better incentives to well-behaved users• If oversend, performance rapidly degrades• Clearer congestion signal• Allows shared learning
• Priority• Can waste upstream resources• Hard to deploy
• RLM approaches optimal operating point• Uniform is already deployed• Assume no special router support
![Page 51: CS 268: Computer Networking L-21 Multicast. 2 Multicast Routing Unicast: one source to one destination Multicast: one source to many destinations Two](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649d595503460f94a39935/html5/thumbnails/51.jpg)
52
RLM Join Experiment
• Receivers periodically try subscribing to higher layer
• If enough capacity, no congestion, no drops Keep layer (& try next layer)
• If not enough capacity, congestion, drops Drop layer (& increase time to next retry)
• What about impact on other receivers?
![Page 52: CS 268: Computer Networking L-21 Multicast. 2 Multicast Routing Unicast: one source to one destination Multicast: one source to many destinations Two](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649d595503460f94a39935/html5/thumbnails/52.jpg)
53
Join Experiments
1
2
3
4
Time
Layer
![Page 53: CS 268: Computer Networking L-21 Multicast. 2 Multicast Routing Unicast: one source to one destination Multicast: one source to many destinations Two](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649d595503460f94a39935/html5/thumbnails/53.jpg)
54
RLM Scalability?
• What happens with more receivers?
• Increased frequency of experiments?• More likely to conflict (false signals)• Network spends more time congested
• Reduce # of experiments per host?• Takes longer to converge
• Receivers coordinate to improve behavior