Tree-Based Multicast Routing

Protocol
• Initialization phase
• Maintenance phase
• Optimization phase
• Advantages and Disadvantages
 Bandwidth Efficient Multicast Routing Protocol
(BEMRP)
• Tries to find the nearest forwarding node,
rather than shortest path between source and
destination.
• Uses hard state approach – to rejoin a group
control packets are transmitted only after the
link breaks.
• Avoids periodic transmission
 BEMRP - Phases

• Tree initialization phase

– initiated by the receiver
• Tree maintenance phase
– To reduce control overhead
• Tree configuration is done only when a link break is detected.
– Two schemes to recover from link failures,
• Broadcast-Multicast scheme
– Upstream node is responsible
• Local rejoin scheme
– Downstream node of the broken link tries to rejoin the multicast
group
Multicast tree initialization in BEMRP
Multicast tree maintenance in broadcast-multicast scheme
Multicast tree maintenance in Local rejoin scheme
• Route Optimization phase
– Helps to reduce no. of data packet transmissions
• Pruning unwanted tree nodes by sending Quit message.
• Advantages and disadvantages
√ Saves bandwidth
√ reduction in no. of data packet transmission
√ hard state approach
× Distance between source and receiver increases – choosing
nearest forwarding node leads to reduction in packet
delivery ratio.
× Route repair adds delay in packet delivery
Multicast tree optimization in BEMRP
 Multicast Routing Protocol Based on Zone Routing
(MZRP)

• Flooding of control packets reduced

• Each node is associated with a routing zone
• Proactive approach for routing inside the zone
• Reactive approach used across zones
Tree initialization phase
• Initiates two stages process
– Source tries to form tree inside the zone
– Source extends the tree to the entire network
Multicast tree initialization in MZRP
• Tree maintenance phase
– Source node periodically transmits TREE_REFRESH packets down
the tree
– If node does not receive this packet then it removes stale
multicast route entry
– When link breaks downstream nodes are responsible
• One way, node unicast Join packet to all zone nodes and gets JoinAck
• Another way, if there are no tree nodes in the zone then the node
sends JoinPropagate to border node in its zone and finds an
intermediate node.
• Advantages and Disadvantages
√ Reduces control overhead
√ Exchange information between unicast and multicast routing
protocols
× Receiver node waits for longer time to join multicast session
Multicast tree maintenance in MZRP
Multicast tree maintenance in MZRP
 Multicast Core-Extraction Distributed Ad Hoc
Routing (MCEDAR)
• To increase robustness
• mgraph is used for forwarding data packets
• Minimum Dominating Set (MDS) have certain nodes (core
nodes) formed using core computation algorithm
• If a receiver wants to Join multicast session it requests its
dominator to transmit JoinReq packet(consists of JoinID).
• JoinID prevents from forming loop in mgraph
• A node acknowledges on if its JoinID is less than the JoinID of
requesting node.
• Intermediate node rejects the path based on robustness factor
JoinReq sent by dominating core node
Data forwarded over source-tree
• Advantages and Disadvantages
√ Robustness due to mesh structure multicast
routing protocol for forwarding the data packets.
√ Because of robustness factor parameter the
dominator node has multiple paths to multicast
session
× More complex
× In high mobility situation, frequent change in core
node increases overhead
Associativity-Based Ad Hoc Multicast Routing
(ABAM)
• On-demand
– Path constructed based on link stability and not hot distance
• Tree initialization phase
– Source node initiates, three step process
• Flooding by the source
• Replies along stable path
• Path setup by the source
• Tree maintenance phase
– Maintains depending on the type of moved node
• If leaf receiver moves – upstream node broadcast LocationQuery packet
or receiver sends JoinQuery packet
• When branch node moves away – broadcast LocationQuery packet
Multicast tree initialization in ABAM
Multicast tree maintenance in ABAM
• Advantages
– Path is more stable
– Achieves high packet delivery ratio
– Control overhead is less : fewer no. of link failures
• Disadvantages
– Increased hop distance
– Congestion : when receiver have same multicast
session
– Not scalable : need load balancing technique.
 Differential Destination Multicast Routing
Protocol (DDM)
• Other uses Distributed group member management
& distributed routing state maintenance policies.
• DDM uses : stateless multicast routing
Tree initialization phase:
• Destination node unicasts JoinControl packet
• Source checks Join packet validity and sends Ack,
storing the destination address in ML.
• Destination periodically sends Join control packet.
– This refreshes the ML table.
• Tree maintenance phase
– DDM operates in stateless mode & soft state mode.
– Stateless mode : straightforward
– Soft state mode : node along the forwarding path remembers the
destination address by storing it in the forwarding set (FS)
• Advantages
– Uses minimum memory resources
– Centralized admission control policy assures security
– Automatic rerouting of packets
• Disadvantages
– Not scalable when group size increases
– Periodic control packet leading to high bandwidth consumption
Multicast tree maintenance in DDM
Weight Based Multicast Protocol (WBM)
• Concept of for deciding entry point in multicast tree
• Node considers,
– No. of newly added forwarding node
– Distance between source and itself.
• Flexibility of receiver to join
Tree initialization phase
• Receiver initiated approach
• Parameters
JoinWeight ,
Parameter Q = (1-JoinWeight)*(hd(R5,I1)-1)+(JoinWeight*hd(R5,S))
Receiver sends JoinConfigure packet in reserved path
Multicast tree initialization in WBM
• Tree manitenance
– Using soft state approach
– TriggerHandoff for a link life time period
– Each node maintains : NMT Neighbour Multicast Tree
– Node refreshes NMTExistence
– If link lifetime period is less then downstream node sets InitiateHandoff
– After this the sender requests neighbour node and again joins the group.
– Advantages
• High efficiency
• Avoid path breaks
– Disadvantages
• Consistency
• Inaccurate prediction
Multicast Ad Hoc On-Demand Distance Vector
Routing Protocol (MAODV)
• Group leader updates seq. no and broadcasts using GRHs
• If node wishes to join
– If they have addr of group leader then it unicasts RREQ
– If they don’t have then braodcast RREQ
– RREP contains distance of replying node from group leader and
seq. number.
– Receiver nodes selects recent seq. no and shortest path and
sends MACT multicast activation
– After activation forward path is established
• Tree maintenance
– Downstream node is responsible
Node joining the multicast tree in MAODV
Tree repair in MAODV
• Advantages
– Integration of unicast , multicast
– Sharing information : reduces overhead
– Free from loop
• Disadvantages
– Shared tree not efficient when no.of multicast
sessions are high
– Single point failure affects all multicast sessions.