• No results found

4: Multicast Routing 2 Inter-Domain Routing

N/A
N/A
Protected

Academic year: 2021

Share "4: Multicast Routing 2 Inter-Domain Routing"

Copied!
10
0
0

Loading.... (view fulltext now)

Full text

(1)

4: Multicast Routing 2

Inter-Domain Routing

Technologie-Zentrum Informatik

Typical Intra-Domain Multicast Architecture

S

S

R

R

DATA

(2)

© 2003 Olaf Bergmann, Jörg Ott

Connecting Multicast-Domains

Intra-Domain Intra-Domain

S

R

R

R

S

MBR

Technologie-Zentrum Informatik

Inter-Domain Multicast Routing

`

Issues:

y Address clashes

y Finding active sources

y Broadcast/prune vs explicit join

y SSM vs ASM/SFM

y Parallel paths

y (Multicast) Route changes

y Support for distribution tree optimizations `

2 different approaches:

y Create shared tree in multicast border routers

(3)

© 2003 Olaf Bergmann, Jörg Ott

Generic MBR Architecture

`

Only one routing protocol for each interface

`

Components change forwarding entry for “their” interface

`

Single incoming interface per forwarding entry

`

Components typically have separate multicast routing table

`

Event-driven communication between components and routing logic

DVMRP MOSPF PIM-SM CBT

IGMP Protocol components

Shared forwarding cache

Network interfaces Routing logic (S1,G1) → (iif, { oif, ... }) ... Technologie-Zentrum Informatik

MBR routing process

`

On incoming data, the dispatcher determines the iif owner

`

iif owner may drop incoming packet

(e.g. not in scope boundaries, RPF check failed, etc.)

`

Creation of (S,G) entry triggers alert for outgoing interfaces

→ enable flooding

`

Deletion of (S,G) entry trigger alert for incoming interface

→ prune/leave

`

Adding outgoing interface to (S,G) entry triggers alert for incoming

interface

→ join/graft

`

Create (*,*) entries for externally-reached sources towards tree root

y Owned by routing logic (“interop dispatcher”)

y Clear state after prunes

y Create entries for joins

(4)

© 2003 Olaf Bergmann, Jörg Ott

Applicability to Existing Protocols

`

Dense-mode

y

Components are wildcard-receivers for internal sources

y

Wildcard-receivers for external sources if no domain-wide reports

available

`

Sparse-mode

y

MBRs need to be on shared distribution tree

→ create wildcard entries for every group at every RP/Core

y

Act as DR for external sources

Technologie-Zentrum Informatik

Example: Sender in PIM-SM-Domain

R

R

S

R

RP

PIM-SM

DVMRP

R

(5)

© 2003 Olaf Bergmann, Jörg Ott

Example: Sender in PIM-SM-Domain

R

R

S

R

RP

PIM-SM

DVMRP

R

Technologie-Zentrum Informatik

PIM-SM Router Operation

`

MBR encapsulates data from external sources in Register message

y Use B-Bit to avoid multiple registrations

y RP sends data downstream `

Downstream router operation:

y Look for specific routing state (S,G) or (*,G) → forward downstream

y Look for matching (*,*,RP) entry

→ forward packets if data arrived on incoming interface

y Otherwise, drop packets `

MBR treated as group member

y Gets multicast data from senders within PIM-SM-domain

y Forwards to DVMRP-domain

(6)

© 2003 Olaf Bergmann, Jörg Ott

Example: Sender in DVMRP-Domain

S

R

R

R

RP

PIM-SM

DVMRP

encapsulated data packet sent via unicast to RP

R

Technologie-Zentrum Informatik

Overlay Routing Architecture

`

Sparse-Mode approach relies on shared tree

y

Slow convergence in case of route changes

y

External single point of failure (due to unidirectional tree)

`

BGMP: Border Gateway Multicast Protocol

y

Like BGP-4 for unicast routing

y

Can use any M-IGP (DVMRP, MOSPF, CBT, PIM, …)

y

Bidirectional routing tree → build global multicast RIB

y

SSM only on demand

y

Worse loop prevention (no RPF checks)

(7)

© 2003 Olaf Bergmann, Jörg Ott Domain B Domain A Domain C

R

Domain D allocated root domain for G

IGMP join for group G

Report to border routers BGMP join Technologie-Zentrum Informatik Domain B

Domain Hierarchies in BGMP

Domain A Domain C

R

S

Domain D allocated root domain for G

Multicast data

for group G

(8)

© 2003 Olaf Bergmann, Jörg Ott

BGMP Routing

`

Join/Prune is distributed to allocated root domain

y BGMP for communication between border routers

y Specific multicast routing protocol for interior communication `

Data is sent to multicast group as usual

y Border routers forward to next hop for specified group

y Forwarded downstream from root domain `

Must support specific M-IGP protocols

y Deal with RPF-checks

y Tree optimizations Technologie-Zentrum Informatik Domain B

Domain Hierarchies in BGMP

Domain A Domain C

R

S

Domain D allocated root domain for G

Multicast data

for group G

encapsulate data to make RPF check succeed

(9)

© 2003 Olaf Bergmann, Jörg Ott Domain B Domain A Domain C

R

S

Domain D allocated root domain for G

Multicast data

for group G

source-specific join prune other branches

Technologie-Zentrum Informatik Domain B

Domain Hierarchies in BGMP

Domain A Domain C

R

S

Domain D allocated root domain for G

Multicast data

for group G

data sent along optimized SPT

(10)

© 2003 Olaf Bergmann, Jörg Ott

Address Allocation

`

MALLOC (RFC 2908)

y Overall allocation architecture

y Scope, lifetime, timeliness, resource management, … `

MASC (RFC 2909)

y Claim set of address prefixes

y CIDR-like aggregation for routers `

MZAP (RFC 2776)

y Announce information about local zone hierarchy

y To be used for address claims `

MADCAP (RFC 2730)

y Allocate multicast address for instant use

→ support dynamic groups such as ad-hoc-networks

y Similar to DHCP

Technologie-Zentrum Informatik

Current Practice

`

Wide deployment of PIM-SM networks

y

Interconnected by MSDP (RFC 3618) and MBGP

y

Regular Source-Active-Announcements sent to RPs

`

BGMP yet in draft state

`

Tunnels for non-multicast networks

`

Address allocation architecture not ubiquitous

y

“guess” group addresses (239/8)

References

Related documents

As, in a number of circumstances, measuring the long-term incentives will involve estimating vesting rates and/or a share price, investors have requested that when the

FIGURE A1: The percentage of sites with San Bernardino flying squirrel detections (A) and the total number of San Bernardino flying squirrel detections (B) across all surveyed

■ The existing customizable product line items that are associated with a promotion are not added with the default configuration when you add a promotion line item to a quote or an

• One primary identifier (OVID) for most health data = high risk for loss of privacy. • Multiple PVIDs are needed for sensitive data = complex • OVID + many PVIDs = fat wallet

Using data from New Jersey High School Proficiency Assessment (HSPA) exam, the paper finds statistically significant evidence that students who barely fail the exam, especially

While filtering water mixed with potassium permanganate, the sorbent was modified: its granules were covered with the layer of manganese hydroxide performing several functions

Statues and images of the saints are likewise covered because, as theologian Nikolaus Nilles explained, “It would seem improper for the servants to appear when the Master himself

Because axial and flexural loads both cause normal stresses in the member, engineers may simply replace the section modulus with the plastic modulus in the beam equation,