Performance Evaluation of DVMRP, MOSPF, PIM

1
Performance Evaluation of DVMRP, MOSPF, PIM
CSE 952 - Advanced Computer NetworksFall
2006 By Vaidhehi Lakshmiraman Vishwanath
Gurav
2
Problem Statement

• To Simulate Multicast Routing Protocols
  likeDVMRP, PIM-DM and PIM-SM in NS2.
• Comparing the performances of these protocols
  using parameters like Percentage of Link
  Utilization, Total Number of Packets, and
  Percentage of Packet Drops.

3
Introduction

• What is Multicasting?Multicast is a set of
  technologies that enables efficient delivery of
  data to many locations on a network.
• Applications
• Multimedia Conferencing
• Information dissemination synchronized
  resources (e.g. Database updates)
• Interactive distance learning
• Online video/audio streaming

4
Introduction

• Why Multicast
• better bandwidth utilization
• less host/router processing
• quicker participation
• Multicast Uses Class D addresses
• Various Multicast Routing Protocols
• Distance Vector Multicast Routing Protocol
  (DVMRP)
• MOSPF
• PIM DM
• PIM - SM

5
DVMRP

• Multicast Version of Distance Vector Routing
  protocol
• Source Specific and Supports RPM
• Source node sends flooding messages to other
  nodes in group
• Routing table is maintained at each node
• Implemented in 2 steps
• Broadcast of packets to the networks on the
  internet
• Prune back networks that do not have host
  belonging to this multicast group.

6
PIM

• Protocol independent multicast
• To reduce scaling problems
• Used for both centralized and distributed
  services
• Types
• PIM SM
• PIM DM
• Explicit graft and prune messages

7
PIM -DM

• For densely populated network
• Similar to DVMRP
• Can use routing table created by any underlying
  unicast protocol for RPF checks

8
PIM -SM

• For sparsely populated network
• It has both source specific and shared trees
• Uses soft state mechanism for adaptability

9
Previous Work

• (Paul) about implementation of multicasting in
  Internet (IPV4)
• (Deer90) describes architecture for efficiently
  routing to multicast groups that span wide-area
  using PIM
• (Sahasrabuddhe00) basic techniques behind
  multicast algorithms
• (Zhirong) multicast routing protocols with one
  topology and various scenarios

10
How our work is different

• Previous projects are done with consideration of
  only one topology and various scenarios of the
  same
• Ours uses 2 different topologies and various
  scenarios for each
• One of the topology used have two different
  scenarios and two different link bandwidth
  capacities
• We are implementing DVMRP, PIM-DM and PIM-SM
  multicast routing protocols
• They are evaluated and compared using
• Percentage Link Utilization
• Total Number of Packets
• Percentage of Packet Drops.
• Simulation Tool NS2

11
Simulation Environment

• Topology I

12
Simulation Environment

• Topology II

13
Implementation details

• DVMRP
• Start time - 0.4 sec
• Source node 0 floods all the nodes
• All nodes acknowledge with prune packets
• First node 2 from the group joins the multicast
  tree and source 0 starts sending packets to node
  2.
• All active nodes in the multicast tree flood the
  network periodically to obtain the information
  about their neighboring nodes which are in the
  group.
• When execution for scenario 2 starts source node
  1 start multicasting to its group and hence there
  is packet drop at node 1.

14
Implementation details

• PIM - DM
• Similar to DVMRP
• PIM DM sends flooding messages to all the nodes
  in the group while DVMRP sends only to those
  which are not in the multicast tree.

15
Implementation details

• PIM - SM
• Rendezvous Point (RP)
• As node sense graft message to join the tree
• Whenever a node wants to join the group and its
  parent node is already in the tree the graft
  message is sent to the parent
• If the parent node is not in the tree it just
  forwards the message from RP or its parent
• Whenever a node leaves the tree it sends prune
  message

16
Evaluation and Analysis

• Total Number of Packets sent across Network

17
Evaluation and Analysis

• Percentage of Packet Drop

18
Evaluation and Analysis
Percentage of Link Utilization
19
Conclusion

• DVMRP is better for smaller networks compared to
  PIM-DM. However we observed that DVMRP needs
  flooding frequently and hence can lead to scaling
  problems.
• PIM-DM works with reverse path forwarding and
  also wastes bandwidth. Thus it cannot work well
  for network with sparse mode.
• Packet drops for PIM-DM is based on topology and
  bandwidth variation. It is observed that DVMRP
  has more packet drops when there is variation in
  bandwidth.
• PIM-SM shows very less packet drop and stable
  against link bandwidth variations and change in
  topology. Even thought deciding upon RP is
  difficult.

20
References

• Peter and Davie Peterson L. L. and Davie B. S.,
  Computer Networks - A Systems Approach (Third
  edition), Morgan-Kaufmann, 2003, ISBN
  1-55860-832-X
• Weitzman Weitzman D., Partridge C., Deering S.,
  Distance Vector Multicast Routing Protocol
  (DVMRP), RFC 1075, November 1988.
• Spirent Spirent Communications Multicast
  Routing PIM Sparse Mode and Other Protocols,
  26750 Agoura Road Calabasas, CA91302 USA, Nov
  2003.
• Paul Paul P. and Raghavan S.V., Survey of
  Multicast Routing Algorithms and Protocols, 15th
  International Conference on Computer
  Communications, August 12-14, 2002, Mumbai.
• Deer90 Deering, S., Cheriton, D., "Multicast
  Routing in Datagram Internetworks and Extended
  LANs", ACM Transactions on Computer Systems, Vol.
  8, No. 2, May 1990, pp. 85-110.

21
References

• Sahasrabuddhe00 Sahasrabuddhe L. H and
  Mukherjee B., "Multicast Routing Algorithms and
  Protocols A Tutorial", IEEE Network,
  January/February 2000, pp.90-102.
• Zhirong Zhirong C., Analyzing Multicast
  Routing protocols using Simulation tools
  ns-2, University of Nebraska - Lincoln, Fall
  2004.
• Derring96 Derring, Estrin, Farinacci, Jacobson,
  Liu, Wei The PIM Architecture for Wide-Area
  Multicast Routing, IEEE ACM Transactions, 1996
• ns NS-2 Documentation - http//www.isi.edu/nsnam
  /ns/

22
Questions ??