MOSPF

• Flood the multicast group membership information along with the link states

• The shortest path multicast tree is built upon demand using Dijkstra’s algorithm

  • Note that all routers calculate the same source-based shortest-path delivery tree
  • The datagram is not flooded, only the group membership info is flooded

• For each transmission, determine the downstream branch and forward the packet

  • Use caching to avoid tree calculation for each packet
  • The forwarding is not TTL based

Previous slide

Next slide

Back to first slide

View graphic version