Chapter15 - answer) with pruning and grafting features. The...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
1 CHAPTER 15 Multicasting and Multicast Routing Protocols Exercises 1. See Tables below: 3. See the entry in the table below: 5. No, RPF does not create a shortest path tree because a network can receive more than one copy of the same multicast packet. RPF creates a graph instead of a tree. 7. Yes, RPM creates a shortest path tree because it is actually RPB (see previous
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: answer) with pruning and grafting features. The leaves of the tree are the networks. R2 Table R3 Table R4 Table Dest. Next-hop Dest. Next-hop Dest. Next-hop N1---N1 R2 N1 R1 N2---N2 R2 N2 R1 N3---N3---N3 R1 N4 R3 N4---N4 R1 N5 R1 N5 R2 N5---N6 R1 N6 R2 N6---Destination Interface------10.0.0.0 2------SECTION 2...
View Full Document

This note was uploaded on 04/26/2010 for the course CSE CS501 taught by Professor Dmathur during the Winter '10 term at National Institute of Technology, Calicut.

Page1 / 2

Chapter15 - answer) with pruning and grafting features. The...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online