multipoint communication in computer networksjain/talks/ftp/multipt.pdf · 2016-03-03 · 27 the...
TRANSCRIPT
![Page 1: Multipoint Communication in Computer Networksjain/talks/ftp/multipt.pdf · 2016-03-03 · 27 The Ohio State University Raj Jain SMART q Shared Many-to-many ATM Reservations q Needs](https://reader033.vdocument.in/reader033/viewer/2022042114/5e902d3fc9c187069d5dbc3f/html5/thumbnails/1.jpg)
1
Raj JainThe Ohio State University
MultipointMultipointMultipointMultipointMultipointMultipointCommunicationCommunicationCommunicationCommunicationCommunicationCommunication
Raj JainThe Ohio State University
Columbus, OH [email protected]
http://www.cis.ohio-state.edu/~jain/
![Page 2: Multipoint Communication in Computer Networksjain/talks/ftp/multipt.pdf · 2016-03-03 · 27 The Ohio State University Raj Jain SMART q Shared Many-to-many ATM Reservations q Needs](https://reader033.vdocument.in/reader033/viewer/2022042114/5e902d3fc9c187069d5dbc3f/html5/thumbnails/2.jpg)
2
Raj JainThe Ohio State University
q Why Multipoint?
q Multipoint Routing Algorithms
q Multipoint Communication in IP networks
q Multipoint Communication in ATM Networks
q Traffic Management for Multipoint Communication
Overview
![Page 3: Multipoint Communication in Computer Networksjain/talks/ftp/multipt.pdf · 2016-03-03 · 27 The Ohio State University Raj Jain SMART q Shared Many-to-many ATM Reservations q Needs](https://reader033.vdocument.in/reader033/viewer/2022042114/5e902d3fc9c187069d5dbc3f/html5/thumbnails/3.jpg)
3
Raj JainThe Ohio State University
Multipoint CommunicationMultipoint CommunicationMultipoint Communication
q Can be done at any layer
q Application Layer: Video Conferencing
q Transport Layer: SRM, RAMP, ATM
q Network Layer: IP, DVMRP, MOSPF, RPF
q Datalink + Physical Layers: Ethernet
![Page 4: Multipoint Communication in Computer Networksjain/talks/ftp/multipt.pdf · 2016-03-03 · 27 The Ohio State University Raj Jain SMART q Shared Many-to-many ATM Reservations q Needs](https://reader033.vdocument.in/reader033/viewer/2022042114/5e902d3fc9c187069d5dbc3f/html5/thumbnails/4.jpg)
4
Raj JainThe Ohio State University
Multipoint ApplicationsMultipoint ApplicationsMultipoint Applications
q Audiovisual conferencing
q Distance Learning
q Video on Demand
q Tele-metering
q Distributed interactive games
q Data distribution (usenet, stock prices)
q Server synchronization (DNS/Routing updates)
q Advertising and locating servers
q Communicating to unknown/dynamic group
![Page 5: Multipoint Communication in Computer Networksjain/talks/ftp/multipt.pdf · 2016-03-03 · 27 The Ohio State University Raj Jain SMART q Shared Many-to-many ATM Reservations q Needs](https://reader033.vdocument.in/reader033/viewer/2022042114/5e902d3fc9c187069d5dbc3f/html5/thumbnails/5.jpg)
5
Raj JainThe Ohio State University
Application Layer MulticastApplication Layer MulticastApplication Layer Multicast
q Problems: n times moreprocessing/buffering/bandwidth overhead
q Applications need lower layers help in handlingunknown addresses
![Page 6: Multipoint Communication in Computer Networksjain/talks/ftp/multipt.pdf · 2016-03-03 · 27 The Ohio State University Raj Jain SMART q Shared Many-to-many ATM Reservations q Needs](https://reader033.vdocument.in/reader033/viewer/2022042114/5e902d3fc9c187069d5dbc3f/html5/thumbnails/6.jpg)
6
Raj JainThe Ohio State University
Multicast Routing AlgorithmsMulticast Routing AlgorithmsMulticast Routing Algorithms
q Flooding
q Spanning Trees
q Reverse Path Forwarding
q Flood and Prune
q Steiner Trees
q Center-Based Trees, e.g., core-based trees
Most routing protocol standards are combination ofthese algorithms.
![Page 7: Multipoint Communication in Computer Networksjain/talks/ftp/multipt.pdf · 2016-03-03 · 27 The Ohio State University Raj Jain SMART q Shared Many-to-many ATM Reservations q Needs](https://reader033.vdocument.in/reader033/viewer/2022042114/5e902d3fc9c187069d5dbc3f/html5/thumbnails/7.jpg)
7
Raj JainThe Ohio State University
FloodingFloodingFlooding
q Used in usenet news
q Forward if first reception of this packet⇒ Need to maintain a list of recently seen packets
q Sometimes the message has a trace of recent path
![Page 8: Multipoint Communication in Computer Networksjain/talks/ftp/multipt.pdf · 2016-03-03 · 27 The Ohio State University Raj Jain SMART q Shared Many-to-many ATM Reservations q Needs](https://reader033.vdocument.in/reader033/viewer/2022042114/5e902d3fc9c187069d5dbc3f/html5/thumbnails/8.jpg)
8
Raj JainThe Ohio State University
Spanning TreeSpanning TreeSpanning Tree
q Used by MAC bridges
q Packet is forwarded on all branches except the one itcame on
q Problem:All packets from all sources follow the same path⇒ Congestion
A C E
B D
A C E
B D
1 2
63
54
![Page 9: Multipoint Communication in Computer Networksjain/talks/ftp/multipt.pdf · 2016-03-03 · 27 The Ohio State University Raj Jain SMART q Shared Many-to-many ATM Reservations q Needs](https://reader033.vdocument.in/reader033/viewer/2022042114/5e902d3fc9c187069d5dbc3f/html5/thumbnails/9.jpg)
9
Raj JainThe Ohio State University
Reverse Path ForwardingReverse Path ForwardingReverse Path Forwarding
q Also known as reverse path broadcasting (RPB)
q Used initially in MBone
q On receipt note source S and interface I
q If “I” belongs to shortest path towards S,forward to all interfaces except I
q Otherwise drop the packet
A C E
B D
1 2
63
54
A C E
B D
1 2
63
54
Source A Source E
![Page 10: Multipoint Communication in Computer Networksjain/talks/ftp/multipt.pdf · 2016-03-03 · 27 The Ohio State University Raj Jain SMART q Shared Many-to-many ATM Reservations q Needs](https://reader033.vdocument.in/reader033/viewer/2022042114/5e902d3fc9c187069d5dbc3f/html5/thumbnails/10.jpg)
10
Raj JainThe Ohio State University
RPF (Cont)RPF (Cont)RPF (Cont)
q Optionally, check and forward only if the node is onthe shortest path to the next node
q Implicit spanning tree. Different tree for differentsources.
q Problem: Packets flooded to entire network
A C E
B D
1 2
63
54
![Page 11: Multipoint Communication in Computer Networksjain/talks/ftp/multipt.pdf · 2016-03-03 · 27 The Ohio State University Raj Jain SMART q Shared Many-to-many ATM Reservations q Needs](https://reader033.vdocument.in/reader033/viewer/2022042114/5e902d3fc9c187069d5dbc3f/html5/thumbnails/11.jpg)
11
Raj JainThe Ohio State University
Flood and PruneFlood and PruneFlood and Prune
q Also known as reverse path multicasting (RPM)
q Used in MBone since September 1993
q First packet is flooded
q All leaf routers will receive the first packet
A C E
B D
1 2
63
54
A C E
B D
1 2
63
54
Prune Graft
No listeners at E Listeners at E
![Page 12: Multipoint Communication in Computer Networksjain/talks/ftp/multipt.pdf · 2016-03-03 · 27 The Ohio State University Raj Jain SMART q Shared Many-to-many ATM Reservations q Needs](https://reader033.vdocument.in/reader033/viewer/2022042114/5e902d3fc9c187069d5dbc3f/html5/thumbnails/12.jpg)
12
Raj JainThe Ohio State University
q If no group member on the subnet, the router sends a"prune"
q If all branches pruned, the intermediate router sendsa "prune"
q Periodically, source floods a packet
q Problem: Per group and per source state
![Page 13: Multipoint Communication in Computer Networksjain/talks/ftp/multipt.pdf · 2016-03-03 · 27 The Ohio State University Raj Jain SMART q Shared Many-to-many ATM Reservations q Needs](https://reader033.vdocument.in/reader033/viewer/2022042114/5e902d3fc9c187069d5dbc3f/html5/thumbnails/13.jpg)
13
Raj JainThe Ohio State University
Steiner TreesSteiner TreesSteiner Trees
q Centralized algorithm to compute global optimalspanning tree given all listeners
q Applies only if links are symmetric
q NP Complete ⇒ Exponential complexity⇒ Not implemented
q Tree varies with the membership ⇒ Unstable
A C E
B D
1 2
63 67
A C E
B D
1 2
63 67
F1
1
(b) F joins the group
F
1
1(a) F is not a member
![Page 14: Multipoint Communication in Computer Networksjain/talks/ftp/multipt.pdf · 2016-03-03 · 27 The Ohio State University Raj Jain SMART q Shared Many-to-many ATM Reservations q Needs](https://reader033.vdocument.in/reader033/viewer/2022042114/5e902d3fc9c187069d5dbc3f/html5/thumbnails/14.jpg)
14
Raj JainThe Ohio State University
Center-Based TreesCenter-Based TreesCenter-Based Trees
q Aimed at multiple senders, multiple recipients
q Core-based tree (CBT) is the most popular example
q Choose a center
q Receivers send join messages to the center(routers remember the input interface)
q Senders send packets towards the center until theyreach any router on the tree
A C E
B D
1 2
63
54
![Page 15: Multipoint Communication in Computer Networksjain/talks/ftp/multipt.pdf · 2016-03-03 · 27 The Ohio State University Raj Jain SMART q Shared Many-to-many ATM Reservations q Needs](https://reader033.vdocument.in/reader033/viewer/2022042114/5e902d3fc9c187069d5dbc3f/html5/thumbnails/15.jpg)
15
Raj JainThe Ohio State University
CBT (Cont)CBT (Cont)CBT (Cont)
q Possible to have multiple centers for fault tolerance
q Routers need to remember one interface per group(not per source) ⇒ More scalable than RPF
q Problem: Suboptimal for some sources and somereceivers
![Page 16: Multipoint Communication in Computer Networksjain/talks/ftp/multipt.pdf · 2016-03-03 · 27 The Ohio State University Raj Jain SMART q Shared Many-to-many ATM Reservations q Needs](https://reader033.vdocument.in/reader033/viewer/2022042114/5e902d3fc9c187069d5dbc3f/html5/thumbnails/16.jpg)
16
Raj JainThe Ohio State University
Multicast Routing ProtocolsMulticast Routing ProtocolsMulticast Routing Protocols
q Reverse Path Forwarding (RPF)
q Distance-vector multicast routing protocol(DVMRP)
q Multicast extensions to Open Shortest-Path FirstProtocol (MOSPF)
q Protocol-Independent Multicast - Dense mode(PIM-DM)
q Protocol-Independent Multicast - Sparse mode(PIM-SM)
![Page 17: Multipoint Communication in Computer Networksjain/talks/ftp/multipt.pdf · 2016-03-03 · 27 The Ohio State University Raj Jain SMART q Shared Many-to-many ATM Reservations q Needs](https://reader033.vdocument.in/reader033/viewer/2022042114/5e902d3fc9c187069d5dbc3f/html5/thumbnails/17.jpg)
17
Raj JainThe Ohio State University
IP Multicast: Design PrinciplesIP Multicast: Design PrinciplesIP Multicast: Design Principles
q Single address per group
q Members located anywhere
q Members can join and leave at will
q Senders need not be aware of membershipsLike a TV channel ⇒ Scalable
q Sender need not be a member
q Soft connections ⇒ periodic renewal
![Page 18: Multipoint Communication in Computer Networksjain/talks/ftp/multipt.pdf · 2016-03-03 · 27 The Ohio State University Raj Jain SMART q Shared Many-to-many ATM Reservations q Needs](https://reader033.vdocument.in/reader033/viewer/2022042114/5e902d3fc9c187069d5dbc3f/html5/thumbnails/18.jpg)
18
Raj JainThe Ohio State University
IP vs ATMIP vs ATMIP vs ATMCategory IP/RSVP ATM UNI 3.0Orientation Receiver based Sender basedState Soft state Hard stateQoS Setuptime
Separate from routeestablishment
Concurrent withroute establishment
QoS Changes Dynamic StaticDirectionality Unidirectional Bi-directional unicast,
unidirectinalmulticast
Heterogeneity Receiverheterogeneity
Uniform QoS to allreceivers
q UNI 4.0 adds leaf-initiated join
![Page 19: Multipoint Communication in Computer Networksjain/talks/ftp/multipt.pdf · 2016-03-03 · 27 The Ohio State University Raj Jain SMART q Shared Many-to-many ATM Reservations q Needs](https://reader033.vdocument.in/reader033/viewer/2022042114/5e902d3fc9c187069d5dbc3f/html5/thumbnails/19.jpg)
19
Raj JainThe Ohio State University
Multiway Communication onMultiway Communication onMultiway Communication onATMATMATM
q ATM Forum Multiway BOF formed in June 1996after marketing studies indicated high user interest
q ITU Study group 13 on ATM based multiwaycommunications technologies
q ITU Study group 11 on Signaling requirements forCapability Set 3 (Multimedia) specifies 4 types ofmultipoint connections.
![Page 20: Multipoint Communication in Computer Networksjain/talks/ftp/multipt.pdf · 2016-03-03 · 27 The Ohio State University Raj Jain SMART q Shared Many-to-many ATM Reservations q Needs](https://reader033.vdocument.in/reader033/viewer/2022042114/5e902d3fc9c187069d5dbc3f/html5/thumbnails/20.jpg)
20
Raj JainThe Ohio State University
Multiway on ATM (Cont)Multiway on ATM (Cont)Multiway on ATM (Cont)
q Type 1: point-to-point
q Type 2: Point-to-multipoint
q Unidirectional
q Bi-directional with nonzero return bandwidth
q Type 3: Multipoint-to-point
q Type 4: Multipoint-to-Multipoint
q Variegated VCs ⇒ Receivers with differentbandwidthApplications: Video distribution, stock market
![Page 21: Multipoint Communication in Computer Networksjain/talks/ftp/multipt.pdf · 2016-03-03 · 27 The Ohio State University Raj Jain SMART q Shared Many-to-many ATM Reservations q Needs](https://reader033.vdocument.in/reader033/viewer/2022042114/5e902d3fc9c187069d5dbc3f/html5/thumbnails/21.jpg)
21
Raj JainThe Ohio State University
Key IssuesKey IssuesKey Issues
q Routing and packet multiplexing
q Packet multiplexing not allowed in AAL5
q AAL 3/4 has a 10-bit multiplexing ID in each cellpayload ⇒ 1024 packets can be intermixed
EOF0001
0000000111
![Page 22: Multipoint Communication in Computer Networksjain/talks/ftp/multipt.pdf · 2016-03-03 · 27 The Ohio State University Raj Jain SMART q Shared Many-to-many ATM Reservations q Needs](https://reader033.vdocument.in/reader033/viewer/2022042114/5e902d3fc9c187069d5dbc3f/html5/thumbnails/22.jpg)
22
Raj JainThe Ohio State University
ATM Multiway MethodsATM Multiway MethodsATM Multiway Methods
1. LAN Emulation⇒ Broadcast and Unknown Server (BUS)
2. MPOA ⇒ Multicast Address Resolution Server (MARS)
3. VC Mesh: Overlaid pt-mpt Connections
4. Multicast Server (MCS)
5. SEAM
6. SMART
7. VP Multicasting
8. Subchannel multicasting
![Page 23: Multipoint Communication in Computer Networksjain/talks/ftp/multipt.pdf · 2016-03-03 · 27 The Ohio State University Raj Jain SMART q Shared Many-to-many ATM Reservations q Needs](https://reader033.vdocument.in/reader033/viewer/2022042114/5e902d3fc9c187069d5dbc3f/html5/thumbnails/23.jpg)
23
Raj JainThe Ohio State University
IP Multicast over ATMIP Multicast over ATMIP Multicast over ATMq Need to resolve IP multicast address to ATM address
list ⇒ Multicast Address Resolution Servers (MARS)
q Multicast group members send IGMP join/leavemessages to MARS
q Hosts wishing to send a multicast send a resolutionrequest to MARS
![Page 24: Multipoint Communication in Computer Networksjain/talks/ftp/multipt.pdf · 2016-03-03 · 27 The Ohio State University Raj Jain SMART q Shared Many-to-many ATM Reservations q Needs](https://reader033.vdocument.in/reader033/viewer/2022042114/5e902d3fc9c187069d5dbc3f/html5/thumbnails/24.jpg)
24
Raj JainThe Ohio State University
Overlaid pt-mpt ConnectionsOverlaid pt-mpt ConnectionsOverlaid pt-mpt Connections
q Also known as VC Mesh
q Each sender in the group establishes a pt-mptconnection with all members
q Problem: VC explosion, new members should beadvertised and joined
![Page 25: Multipoint Communication in Computer Networksjain/talks/ftp/multipt.pdf · 2016-03-03 · 27 The Ohio State University Raj Jain SMART q Shared Many-to-many ATM Reservations q Needs](https://reader033.vdocument.in/reader033/viewer/2022042114/5e902d3fc9c187069d5dbc3f/html5/thumbnails/25.jpg)
25
Raj JainThe Ohio State University
Multicast Server (MCS)Multicast Server (MCS)Multicast Server (MCS)
q All hosts send to MCSMCS has a single mpt VC to all members
q MCS serializes the packets ⇒ Does not interminglecells of packets from different incoming VCs
q Problems with MCS:
q Reflected packets
q Single point of congestion
q Better for dynamic set of receivers
H1
MCS
H3H2
![Page 26: Multipoint Communication in Computer Networksjain/talks/ftp/multipt.pdf · 2016-03-03 · 27 The Ohio State University Raj Jain SMART q Shared Many-to-many ATM Reservations q Needs](https://reader033.vdocument.in/reader033/viewer/2022042114/5e902d3fc9c187069d5dbc3f/html5/thumbnails/26.jpg)
26
Raj JainThe Ohio State University
SEAMSEAMSEAM
q Scalable and Efficient ATM Multipoint-to-multipoint Communication
q Uses core-based treeq At merging points, switches have to store all cells of
a packet (reassembly is not required)⇒ Packet switching (Authors call it "cut through")
q Ref: M. Grossglauser and K.K. Ramakrishnan, ATM Forum/96-1142,August 1996.
A C E
B D
1 2
63
54
![Page 27: Multipoint Communication in Computer Networksjain/talks/ftp/multipt.pdf · 2016-03-03 · 27 The Ohio State University Raj Jain SMART q Shared Many-to-many ATM Reservations q Needs](https://reader033.vdocument.in/reader033/viewer/2022042114/5e902d3fc9c187069d5dbc3f/html5/thumbnails/27.jpg)
27
Raj JainThe Ohio State University
SMARTSMARTSMART
q Shared Many-to-many ATM Reservations
q Needs only one VCC but allows using multipleVCCs for performance and reliability
q Limits to one transmitter at a time.Token holder (root) can transmit.
q Anyone wishing to transmit data, must request thetoken from current root and become new root.
q Ensures that there only one transmitter in the tree⇒ No cell interleaving
q Ref: E. Gauthier, et al, IEEE JSAC, April 1997
![Page 28: Multipoint Communication in Computer Networksjain/talks/ftp/multipt.pdf · 2016-03-03 · 27 The Ohio State University Raj Jain SMART q Shared Many-to-many ATM Reservations q Needs](https://reader033.vdocument.in/reader033/viewer/2022042114/5e902d3fc9c187069d5dbc3f/html5/thumbnails/28.jpg)
28
Raj JainThe Ohio State University
SMART (Cont)SMART (Cont)SMART (Cont)q Data blocks delineated by RM cells
q Not scalable for very large ATM networks or forsmall interactions
![Page 29: Multipoint Communication in Computer Networksjain/talks/ftp/multipt.pdf · 2016-03-03 · 27 The Ohio State University Raj Jain SMART q Shared Many-to-many ATM Reservations q Needs](https://reader033.vdocument.in/reader033/viewer/2022042114/5e902d3fc9c187069d5dbc3f/html5/thumbnails/29.jpg)
29
Raj JainThe Ohio State University
VP MulticastingVP MulticastingVP Multicasting
q A single VP is setup connecting all nodes
q Each is given a unique VCI within the VP
q Problem: Size limited
q VPs are used by carriers for other purposes
![Page 30: Multipoint Communication in Computer Networksjain/talks/ftp/multipt.pdf · 2016-03-03 · 27 The Ohio State University Raj Jain SMART q Shared Many-to-many ATM Reservations q Needs](https://reader033.vdocument.in/reader033/viewer/2022042114/5e902d3fc9c187069d5dbc3f/html5/thumbnails/30.jpg)
30
Raj JainThe Ohio State University
Subchannel MulticastingSubchannel MulticastingSubchannel Multicasting
q Used in Washington University's Giga Switch
q Use GFC to provide 15 subchannels for each VC(FF indicates idle subchannel)
q Each burst is preceded and followed by "Start" and"End" RM cells.
q Subchannel is allocated on the first RM cell andreleased on the last.
q Subchannel IDs are changed at every switch(just like VC IDs)
![Page 31: Multipoint Communication in Computer Networksjain/talks/ftp/multipt.pdf · 2016-03-03 · 27 The Ohio State University Raj Jain SMART q Shared Many-to-many ATM Reservations q Needs](https://reader033.vdocument.in/reader033/viewer/2022042114/5e902d3fc9c187069d5dbc3f/html5/thumbnails/31.jpg)
31
Raj JainThe Ohio State University
q Allows multiplexing up to 15 simultaneous packetsat each switch port per VC.
q If a Start RM cell is received and no subchannel isavailable, the burst is lost.
q Jon Turner claims the loss probability is less than10-12
![Page 32: Multipoint Communication in Computer Networksjain/talks/ftp/multipt.pdf · 2016-03-03 · 27 The Ohio State University Raj Jain SMART q Shared Many-to-many ATM Reservations q Needs](https://reader033.vdocument.in/reader033/viewer/2022042114/5e902d3fc9c187069d5dbc3f/html5/thumbnails/32.jpg)
32
Raj JainThe Ohio State University
SummarySummarySummary
q Multipoint communication is required for manyapplications and network operations
q Network and transport support
q Internet community has developed and experimentedwith many solutions for multipoint communication
q ATM solutions are being developed
![Page 33: Multipoint Communication in Computer Networksjain/talks/ftp/multipt.pdf · 2016-03-03 · 27 The Ohio State University Raj Jain SMART q Shared Many-to-many ATM Reservations q Needs](https://reader033.vdocument.in/reader033/viewer/2022042114/5e902d3fc9c187069d5dbc3f/html5/thumbnails/33.jpg)
33
Raj JainThe Ohio State University
Key ReferencesKey ReferencesKey References
q C. Huitema, "Routing in the Internet," Prentice-Hall, 1995
q C. Diot, et al, "Multipoint Communication: A Survey ofProtocols, Functions, and Mechanisms," IEEE JSAC, April1997, pp. 277-290.
q T. Maufer and C. Semeria, "Introduction to IP MulticastRouting," March 1997, http://www.internic.net/internet-drafts/draft-ietf-mboned-intro-multicast-02.txt
q S. Fahmy, et al, "Protocols and Open Issues in ATMMultipoint Communications," http://www.cis.ohio-state.edu/~jain/papers/mcast.htm
q See http://www.cis.ohio-state.edu/~jain/refs/mul_refs.htm forfurther references.
![Page 34: Multipoint Communication in Computer Networksjain/talks/ftp/multipt.pdf · 2016-03-03 · 27 The Ohio State University Raj Jain SMART q Shared Many-to-many ATM Reservations q Needs](https://reader033.vdocument.in/reader033/viewer/2022042114/5e902d3fc9c187069d5dbc3f/html5/thumbnails/34.jpg)
40
Raj JainThe Ohio State University
IP Multicast AddressesIP Multicast AddressesIP Multicast Addresses
q Class D: Begin with 1110*.*.*.*
q 224.0.0.0 through 239.255.255.255
Host Group (Multicast)111028 bits
![Page 35: Multipoint Communication in Computer Networksjain/talks/ftp/multipt.pdf · 2016-03-03 · 27 The Ohio State University Raj Jain SMART q Shared Many-to-many ATM Reservations q Needs](https://reader033.vdocument.in/reader033/viewer/2022042114/5e902d3fc9c187069d5dbc3f/html5/thumbnails/35.jpg)
72
Raj JainThe Ohio State University
Multicasting Transport ProtocolsMulticasting Transport ProtocolsMulticasting Transport Protocols
q Scalable Reliable Multicast (SRM)
q Reliable Multicast Transport Protocol (RMTP) byShiroshita, et al
q Reliable Multicast Transport Protocol (RMTP) byS. Paul, et al
![Page 36: Multipoint Communication in Computer Networksjain/talks/ftp/multipt.pdf · 2016-03-03 · 27 The Ohio State University Raj Jain SMART q Shared Many-to-many ATM Reservations q Needs](https://reader033.vdocument.in/reader033/viewer/2022042114/5e902d3fc9c187069d5dbc3f/html5/thumbnails/36.jpg)
73
Raj JainThe Ohio State University
SRMSRMSRM
q Scalable Reliable Multicast
q Reliable ⇒ All receivers receive all data sent to amulticast group from different sources.
q No ordering across different sources.
q Problem: Unicast reliability algorithms (timeout andretransmission) depend upon RTT and cannot beused for dynamic multicast trees
![Page 37: Multipoint Communication in Computer Networksjain/talks/ftp/multipt.pdf · 2016-03-03 · 27 The Ohio State University Raj Jain SMART q Shared Many-to-many ATM Reservations q Needs](https://reader033.vdocument.in/reader033/viewer/2022042114/5e902d3fc9c187069d5dbc3f/html5/thumbnails/37.jpg)
74
Raj JainThe Ohio State University
SRM Design PrinciplesSRM Design PrinciplesSRM Design Principles
q Application level framing ⇒ Applicationsresponsible for reliability (not transport).
q Each receiver responsible to ensure that it has alldata.
q Group members send quasi-periodic sessionmessages to report their current state.
q Receivers detect errors and request repair
q Any node with the data can reply
![Page 38: Multipoint Communication in Computer Networksjain/talks/ftp/multipt.pdf · 2016-03-03 · 27 The Ohio State University Raj Jain SMART q Shared Many-to-many ATM Reservations q Needs](https://reader033.vdocument.in/reader033/viewer/2022042114/5e902d3fc9c187069d5dbc3f/html5/thumbnails/38.jpg)
75
Raj JainThe Ohio State University
q All requests and replies are multicast
q Wait random time to minimize duplicaterequest/responses
q Recovery overhead can be reduced by limiting thescope of request and repair multicasts.
![Page 39: Multipoint Communication in Computer Networksjain/talks/ftp/multipt.pdf · 2016-03-03 · 27 The Ohio State University Raj Jain SMART q Shared Many-to-many ATM Reservations q Needs](https://reader033.vdocument.in/reader033/viewer/2022042114/5e902d3fc9c187069d5dbc3f/html5/thumbnails/39.jpg)
76
Raj JainThe Ohio State University
SRM ExampleSRM ExampleSRM Example
q A sends two packets
q One of the packets is lost
q D sends a request for the lost packet
q C retransmits the lost packet
R3
R4R2
R1 R5 DA
CB
![Page 40: Multipoint Communication in Computer Networksjain/talks/ftp/multipt.pdf · 2016-03-03 · 27 The Ohio State University Raj Jain SMART q Shared Many-to-many ATM Reservations q Needs](https://reader033.vdocument.in/reader033/viewer/2022042114/5e902d3fc9c187069d5dbc3f/html5/thumbnails/40.jpg)
77
Raj JainThe Ohio State University
RMTPRMTPRMTP
q Reliable Multicast Transport Protocol
q Runs over UDP over IP Multicast
q Receivers send nacks to indicate missing packets
q Source retransmits missing packets via eithermulticast or unicast (depending upon the number ofNacks)
Ref: Shiroshita, et al, http://www.internic.net/internet-drafts/draft-shiroshita-rmtp-spec-00.txt
![Page 41: Multipoint Communication in Computer Networksjain/talks/ftp/multipt.pdf · 2016-03-03 · 27 The Ohio State University Raj Jain SMART q Shared Many-to-many ATM Reservations q Needs](https://reader033.vdocument.in/reader033/viewer/2022042114/5e902d3fc9c187069d5dbc3f/html5/thumbnails/41.jpg)
78
Raj JainThe Ohio State University
RMTPRMTPRMTP
q Reliable Multicast Transport Protocol
q Hierarchical division of network into regions
q Each region has a "designated receiver" (DR)
q A distribution tree containing all nodes is created bynetwork layer.
L2 ANS
S = SenderLi = Local access switch
for ith regionRi,j = jth receiver of
ith regionAN = Access node
BackboneNetwork
L3L1
R1,2R3,3
R3,2
R3,1R2,2R2,1
![Page 42: Multipoint Communication in Computer Networksjain/talks/ftp/multipt.pdf · 2016-03-03 · 27 The Ohio State University Raj Jain SMART q Shared Many-to-many ATM Reservations q Needs](https://reader033.vdocument.in/reader033/viewer/2022042114/5e902d3fc9c187069d5dbc3f/html5/thumbnails/42.jpg)
79
Raj JainThe Ohio State University
q DRs send periodic status to source.Includes requests for retransmission.
q Sources retransmit only to DRs.
q Other receivers send periodic status to their DR.DRs retransmit in the region.
Ref: S. Paul, et al, IEEE JSAC, April 1997