HANNAM UNIVERSITY 1 Chapter 14 Multicasting And Multicast Routing Protocols

HANNAM UNIVERSITY 2 CONTENTS INTRODUCTION MULTICAST ROUTING MULTICAST TREES MULTICAST ROUTING PROTOCOLS DVMRP MOSPF CBT PIM MBONE

HANNAM UNIVERSITY 3 INTRODUCTION 14.1

HANNAM UNIVERSITY 개요  메시지 전달 방법  Unicasting : one-to-one  Mulicastin : one-to-many  Broadcasting : one-to-all

HANNAM UNIVERSITY 개요  유니캐스트

HANNAM UNIVERSITY 개요 In unicast routing, the router forwards the received packet through only one of its interfaces.

HANNAM UNIVERSITY 개요  멀티캐스팅

HANNAM UNIVERSITY 개요 In multicast routing, the router may forward the received packet through several of its interfaces.

HANNAM UNIVERSITY 개요  멀티캐스팅 대 다중 유니캐스팅

HANNAM UNIVERSITY 개요  멀티캐스팅 대 다중 유니캐스팅

HANNAM UNIVERSITY 개요 Emulation of multicasting through multiple unicasting is not efficient and may create long delays, particularly with a large group.

HANNAM UNIVERSITY 개요  Multicast 응용  분산 데이터 베이스 액세스  정보 발송  뉴스 발송  원격 회의  원격 강의

HANNAM UNIVERSITY 13 MULTICAST ROUTING 14.2

HANNAM UNIVERSITY 멀티캐스트 라우팅  Multicasting routing 목표  그룹내의 모든 멤버는 하나의 멀티캐스트 패킷 수 신  멤버만이 패킷 수신  라우팅에 루프가 없어야 함  패킷 전달 최적 경로 선택  스패팅 트리 활용

HANNAM UNIVERSITY 15 MULTICAST TREES 14.3

HANNAM UNIVERSITY 멀티캐스트 라우팅  멀티캐스트 트리  송신자 기반 트리 (source-based tree)  송신자와 그룹의 조합마다 단일 트리 구성  접근방법 : DVMRD, MOSPF, PIM-DM  그룹 공유 트리 (group-shared tree)  시스템 내의 각 트리는 동일한 트리 공유  접근방법 : Steiner tree, rendezvous tree

HANNAM UNIVERSITY 멀티캐스트 라우팅 In a source-based tree approach, the combination of source and group determines the tree.

HANNAM UNIVERSITY 멀티캐스트 라우팅 In the group-shared tree approach, the group determines the tree.

HANNAM UNIVERSITY 19 MULTICAST ROUTING PROTOCOLS 14.4

HANNAM UNIVERSITY 멀티캐스트 라우팅 프로토콜  멀티캐스트 라우팅 프로토콜

HANNAM UNIVERSITY 21 DVMRP 14.5

HANNAM UNIVERSITY DVMRP  DVRP(Distance Vector Routing Protocol) 확 장  최단 경로 트리 구성  루프가 형성되지 않아야 함  중복 (duplication) 이 없어야 함  동적인 멤버쉽 제공

HANNAM UNIVERSITY DVMRP  RPF(Reverse Path Forwarding)  수정된 플러딩 정책  최단 경로를 통해 도착한 사본만 전달  DVRP 유니캐스트 라우팅 테이블 사용

HANNAM UNIVERSITY DVMRP  RPF(Reverse Path Forwarding)

HANNAM UNIVERSITY DVMRP In reverse path forwarding (RPF), the router forwards only the packets that have traveled the shortest path from the source to the router; all other copies are discarded.

HANNAM UNIVERSITY DVMRP RPF prevents the formation of loops.

HANNAM UNIVERSITY DVMRP  RPB(Reverse Path Broadcasting)  RPF 는 각 망이 하나의 사본만의 수신을 보장하지 못함

HANNAM UNIVERSITY DVMRP  RPF 대 RPB  중복 해결을 위해 지정한 부모 라우터로부터 수신

HANNAM UNIVERSITY DVMRP RPB creates a shortest path broadcast tree from the source to each destination. It guarantees that each destination receives one and only one copy of the packet.

HANNAM UNIVERSITY DVMRP  RPF, RPB, 그리고 RPM

HANNAM UNIVERSITY DVMRP RPM adds pruning and grafting to RPB to create a multicast shortest path tree that supports dynamic membership changes.

HANNAM UNIVERSITY 32 MOSPF 14.6

HANNAM UNIVERSITY MOSPF  유니캐스트 트리와 멀티캐스트 트리

HANNAM UNIVERSITY 34 CBT 14.7

HANNAM UNIVERSITY CBT  Rendezvous 라우터를 가지는 공유 - 그룹 트리

HANNAM UNIVERSITY CBT  Rendezvous 라우터에게 멀티캐스트 패킷 송 신

HANNAM UNIVERSITY CBT In CBT, the source sends the multicast packet (encapsulated in a unicast packet) to the core router. The core router decapsulates the packet and forwards it to all interested hosts.

HANNAM UNIVERSITY 38 PIM 14.8

HANNAM UNIVERSITY PIM PIM-DM is used in a dense multicast environment, such as a LAN environment.

HANNAM UNIVERSITY PIM PIM-DM uses RPF and pruning/grafting strategies to handle multicasting. However, it is independent from the underlying unicast protocol.

HANNAM UNIVERSITY PIM PIM-SM is used in a sparse multicast environment such as a WAN.

HANNAM UNIVERSITY PIM PIM-SM is similar to CBT but uses a simpler procedure.

HANNAM UNIVERSITY 43 MBONE 14.9

HANNAM UNIVERSITY MBONE  논리적 터널링

HANNAM UNIVERSITY MBONE  MBONE

HANNAM UNIVERSITY MBONE DVMRP supports MBONE