IP Multicast III - - PDF document

▶

Jun 19, 2023 515 likes •567 views

P P P P P P DVMRP (1) (1988-1993) IP Multicast III

SLIDE 1

10 June, 2002 1

IP Multicast III

2 10 June, 2002 The Computer Communications Course

DVMRP (1) (1988-1993)

✂✁ ✄✆☎✞✝ ✁ ✄✆☎✠✟ ✡ ☛ ☞✍✌ ✎✑✏✓✒✓✌ ✔✖✕✓✏✗✌ ✘✖✙✚✏✓✒✜✛✢✛✤✣✗✛✞✒✦✥ ✧✆✘★✕★✒✪✩✓✛✬✫✗✭✍✒✪✘★✕✗✣✢✮ ☛ ✧✰✯✖✘★✒✪✏✱✛★✎✑✏✲✣✗✳✓✏✓✯✖✴ ✎✓✵✶✏✑✒✪✛✢✛✤✩★✒✪✛★✳✗✏✱✛✢✷ ☛ ☞✠✳✓✏✱✳★✸✹✷✬✒✓✌ ✺✑✛✻✙✚✏✓✒✜✛✢✛✤✩★✒✪✛★✳✗✏✗✌ ✘✖✙ ☛ ✼✲✽✬✒✪✘✗✳✓✷✬✩✓✳✓✎✑✏✂✾❀✿✢✒✪✕✢✙✑✛❂❁ ☛ ❃❄✳✗✎✚✏✓✯✢✛✤❅✚✘✗✎✑✏✚✣★✘★✣★✕✖❆ ✳★✒✂❅✚✕✞❆ ✏✗✌ ✩✓✳✓✎✑✏✦✒✪✘★✕✓✏✗✌ ✙✑❇❈✎✓✩★✯✢✛✢❅✂✛❉✌ ✙ ✏✓✯✢✛✤❊❋✽✬●✲❍✲■

3 10 June, 2002 The Computer Communications Course

DVMRP (2)

Initiation Initiation

☛ ❏✰✯✢✛❉☞✰❑❉✴✍☞✠✛✢✎✗✌ ❇✞✙✱✳✗✏✱✛✢✷❉❑✬✘★✕✓✏✱✛✞✒✂✵▲✘✢✙✚✏✓✯✢✛❂✎✓✘★✕★✒✪✩✓✛▼✙✑✛✢✏✱◆✰✘★✒✑❖ P ✘★✒✪◆✆✳★✒✪✷✞✎✲✳✦✏✓✒✜✳✖✙✱✎✓❅✦✌ ✏✱✏✪✛✢✷❉❅✂✛✢✎✑✎✑✳✓❇★✛❂✏✑✘✦✳✞❆ ❆✓✳✗✷✢◗✜✳✗✩✓✛✻✙✑✏ ✒✱✘✗✕✓✏✱✛✞✒✪✎✗❘ ☛ ❙✂❆ ❆✢✒✪✘★✕✓✏✱✛✞✒✜✎❈✒✜✛✖✩✓✛✻✌ ✺★✌ ✙✑❇❈✳❈❅✂✛✢✎✑✎✑✳✓❇★✛ P ✘★✒✪◆✆✳✢✒✜✷❚✌ ✏ ✷✻✘✗◆❯✙✑✎✑✏✑✒✪✛✢✳✗❅❱✕✓✎★✌ ✙✑❇✤❑✬✿✢✽▼✴ ✘✢✒❲✸❲❑✬✿✢❳✖✵ ☛ ❨✢✏✦✌ ✎✲✴❩✌ ✙✗✌ ✏✗✌ ✳✞❆ ❆ ❬✖✵✶✳✓✎✑✎✓✕✗❅✂✛✢✷▼✏✓✯✢✳✓✏✂✳✞❆ ❆★✯✖✘✗✎✑✏✱✎✲✘✢✙✚✏✓✯✢✛▼✙✑✛★✏✚✳★✒✪✛ ❅✂✛✖❅✦✔★✛✞✒✪✎✲✘ P ✏✓✯★✛✤❅✚✕✞❆ ✏✗✌ ✩✓✳✓✎✑✏✚❇✖✒✪✘★✕✗✣✢❘

4 10 June, 2002 The Computer Communications Course

DVMRP (3)

Selective Forwarding Selective Forwarding

❭ ❭

RPB (Reverse Path Broadcasting): RPB (Reverse Path Broadcasting):

❪ ❪

If a packet arrives on a link considered as the shortest one to If a packet arrives on a link considered as the shortest one to the source, forward out on all links besides the received one. the source, forward out on all links besides the received one.

❪ ❪

Otherwise - discard. Otherwise - discard.

❭ ❭

Enhancement: Enhancement:

❪ ❪

Using (known) Unicast routing tables, forward packet to Using (known) Unicast routing tables, forward packet to neighbor only if this is his shortest link towards sender. neighbor only if this is his shortest link towards sender.

5 10 June, 2002 The Computer Communications Course

DVMRP (4)

❫✢❴✑❵✗❛★✁ ❛ ✄ ☛ ✿★✒✱✕✢✙★✌ ✙✱❇✤❜❈■✶❆ ✌ ❅✦✌ ✙✱✳✗✏✗✌ ✘✖✙✲✘ P ✏✓✯✢✛✤✕✢✙✑◆✆✳✢✙✑✏✱✛✢✷✬❘ ☛ ❝✆✎★✌ ✙✱❇❈❨✢✭✰❊▼✿✖✫✗✳❂✒✪✘★✕✓✏✱✛✞✒❲◆✍✯✻✌ ✩★✯❂✷✞✛✢✏✱✛✞✒✱❅✦✌ ✙✱✛✢✎✲✏✑✯✢✳✗✏✦✙✓✘ ✯✖✘✓✎✑✏❈✔★✛✗❬✖✘✖✙✱✷❚✌ ✏❈✔★✛✬❆ ✘✖✙✱❇★✎✚✏✑✘✦✏✓✯✢✛✤❅✚✕✖❆ ✏✗✌ ✩✓✳✓✎✑✏✂❇✖✒✱✘✗✕★✣✞✫ ✎✑✛✻✙✱✷✻✎✚✳✦✼✪✣✢✒✱✕✢✙✑✛★❁✂❅✂✛✢✎✑✎✑✳✓❇★✛✤✕★✣✗✎✑✏✓✒✜✛✢✳★❅✲❘ ☛ ❏✰✯✻✌ ✎✦✣✢✒✪✘★✩✓✛✢✎✱✎✦✩✗✘✢✙✑✏✗✌ ✙✓✕✓✛✢✎✲✕✢✙✑✏✗✌ ❆✓✳✞❆ ❆✓✎✓✕✗✣★✛✖✒ P ❆ ✕✗✘✗✕✗✎ ✔✞✒✜✳✖✙✑✩★✯✢✛✢✎✚✳✢✒✜✛❂✛✬❆ ✌ ❅✦✌ ✙✑✳✓✏✱✛✢✷ P ✒✱✘✗❅❞✏✓✯★✛❂✏✓✒✪✛✢✛✞❘ ☛ ❙❡✙✑✛✢◆❀✼✲✽✬✒✱✘✓✳✗✷✻✩✓✳✓✎✑✏✚✾❀✿★✒✪✕✖✙✱✛❂✼✂✣✢✒✱✘✗✩✓✛✢✎✑✎❈✌ ✎❈✌ ✙★✌ ✏✗✌ ✳✓✏✱✛✢✷ ✛✢✺✑✛✞✒✹❬✤✎✓✘✗❅✂✛❂✏✗✌ ❅✂✛✻✫✗✏✑✘✦✳✓✷✖◗✜✕✗✎✑✏✂✏✑✘❈✩★✯★✳✖✙✱❇★✛✢✎❈✌ ✙✚✏✓✯★✛ ✏✑✘✗✣✢✘✖❆ ✘✗❇✓❬✞❘

6 10 June, 2002 The Computer Communications Course

DVMRP (5)

SLIDE 2

7 10 June, 2002 The Computer Communications Course

DVMRP (6)

8 10 June, 2002 The Computer Communications Course

DVMRP (7)

☛ ✿★✒✱✘✓✎✁ ✂ ✄ ✁ ☎✝✆✬✝ ✁ ✞★✁ ✟ ✟ ☛ ✠✬✘✖✙✱✎✁ ✂ ✿✓✛✞✒✓✌ ✘✗✷ ✌ ✩✤✔✖✒✱✘✓✳✗✷✻✩✓✳✗✎✑✏✚❅✂✳✱❬ ✩✓✳✗✕✗✎✑✛❂✎✑✛✖✒✓✌ ✘★✕✓✎ ✆☛✡✢❴✁☞✍✌★❴✎☎✑✏✢❛✒✞✒✡ ✷✞✛✢❇✖✒✪✳✓✷✻✳✓✏✗✌ ✘✖✙ ✂ ✴ ✓★✳★✒✪❇★✛✢✵✶✳★❅✚✘✗✕✖✙✱✏✚✘ P ❅✚✕✖❆ ✏✗✌ ✩✓✳✗✎✑✏✲✒✱✘✗✕✓✏✗✌ ✙✱❇ ✡✻✟✔✏ ✟ ✡ ✌ ✙ P ✘✢✒✱❅✂✳✓✏✗✌ ✘✖✙✓❘

9 10 June, 2002 The Computer Communications Course

MOSPF (1)

✂✁ ✄✆☎✞✝ ✁ ✄✆☎✠✟ ✡ ☛ ❙❲✙✚✛✁✕✞✏✱✛✻✙✱✎★✌ ✘✢✙✚✏✑✘❈✴ ✏✓✯✢✛▼❝❲✙✗✌ ✩✓✳✓✎✑✏✑✵✆●✲✧✆✿✢❳▼✒✱✘✗✕✓✏✗✌ ✙✱❇ ✣✢✒✱✘✓✏✑✘★✩✗✘✖❆ ❘ ☛ ❏✰✒✪✛✢✛✤✣✗✛✞✒✂✴ ✧✠✛✻✙✱✷✻✛✞✒✓✫✗✭✍✒✪✘★✕✗✣★✵✠✣✗✳✖✌ ✒ ☛ ❙ ✷✻✛✻✙✱✎✑✛✤❅✚✘✗✷✞✛✤✣✢✒✱✘✗✏✱✘★✩✗✘✖❆ ✫★✩✓✳✢✙★✙✑✘✗✏✂✛✢✳✗✎✗✌ ❆ ❬❂✎✓✩✓✳✞❆ ✛✞❘

10 10 June, 2002 The Computer Communications Course

MOSPF (2)

Operation Operation

☛ ☞✰❑❉✕✓✎✑✛✢✎✚❨✢✭✰❊▼✿✦✏✑✘✦✩✗✘✞❆ ❆ ✛✖✩✓✏❈❆ ✘✗✩✓✳✞❆✗❅✂✛✖❅✦✔✢✛✞✒✜✎✗✯✻✌ ✣✢❘ ☛ ✭✍✒✱✘✗✕★✣❈❅✂✛✖❅✦✔★✛✞✒✪✎✗✯✻✌ ✣✤✌ ✎ P ❆ ✘✗✘✗✷✞✛✢✷▼✳✖❆ ✘✖✙✱❇❂◆❯✌ ✏✓✯❂✏✓✯✢✛❉❆ ✌ ✙✗❖ ✎✑✏✱✳✓✏✱✛❉✌ ✙ P ✘✢✒✪❅✂✳✗✏✗✌ ✘✖✙✓❘ ☛ ❊▼✕✖❆ ✏✗✌ ✩✓✳✗✎✑✏✂✏✓✒✪✛★✛ P ✘✢✒❲✏✓✯★✛✤✣★✳✢✌ ✒✂✴ ✎✓✘★✕★✒✪✩✓✛✬✫✓❇✖✒✱✘✗✕★✣★✵✰✌ ✎ ✩✗✘✢✙✑✎✑✏✓✒✪✕★✩✓✏✪✛✢✷❚✔✗❬✤❊❉●✲✧✆✿✢❳▼✒✱✘✗✕✗✏✱✛✖✒✪✎✲✘✖✙✚✷✞✛✖❅✂✳✢✙✑✷✬❘ ☛ ❏✰✒✪✛✢✛✤✩✗✘✢✙✑✎✑✏✓✒✪✕✗✩✓✏✱✛✢✷❉✕✓✎★✌ ✙✑❇▼☞✍✌ ◗✱❖✓✎✑✏✓✒✪✳✗✖ ✎✦✧✆✿✗❏❀✳✖❆ ❇★✘✢✒✑✌ ✏✓✯✖❅✲❘ ☛ ✠✬✘★❅✚✣✗✳✢✒✜✛✢✷▼✏✑✘ ☞✙✘✶❊▼❑✬✿✗ ❍✚✘ P ❆ ✘✗✘✗✷ ✌ ✙✱❇❂✘ P ❅✚✕✖❆ ✏✗✌ ✩✓✳✗✎✑✏✂✷✞✳✗✏✱✳✖✫✢✯✖✘✓◆✆✛✢✺✑✛✞✒✂✸ ❊▼✕✗✩★✯✤❅✚✘★✒✪✛❂✎✑✏✱✳✗✏✱✛❂✳✢✙✑✷❋✯★✛✢✳✗✺★✌ ✛✞✒✂✩✓✳✖❆ ✩✗✕✖❆ ✳✗✏✗✌ ✘✖✙✱✎✗❘

11 10 June, 2002 The Computer Communications Course

MOSPF (3)

Steps shown:

1. MR 1 computes tree - knows members of group

via IGMP and hence knows path to MR 4 is via MR 2, path to MR 8 is via 5, etc.

2. MR 2 computes tree - determines path to MR 4

is direct, path to MR 8 is via MR 5 and MR 3 computes tree - determines path to MR 9 is direct

3. MR 5 computes tree - determines path to MR 8

is direct Note that the multicast transmission triggers this process (i.e. data driven process) and each router, when it receives a message, calculates exactly the same distribution tree as its predecessors and uses it to forward the message.

12 10 June, 2002 The Computer Communications Course

CBT (1) (~1993)

☛ ✽✞✳✗✎✱✛✢✷❉✘✢✙✚✳✦✎✗✯✢✳★✒✪✛✢✷▼✷✞✛✬❆ ✌ ✺✑✛✞✒ ❬❂✏✓✒✪✛✢✛✤✣✗✛✞✒✂❅✚✕✖❆ ✏✗✌ ✩✓✳✗✎✑✏ ❇✖✒✪✘★✕✗✣ ☛ ■ P✓P ✛✖✩✑✏✗✌ ✺✑✛ P ✘✢✒❲✎✓✣✗✳✢✒✜✎✑✛❂✛✻✙✑✺★✌ ✒✱✘✢✙✓❅✂✛✞✙✑✏✱✎✗❘ ☛ ✴❩❑✻✘★✕✓✏✗✌ ✙✱❇✢✵✠✿★✒✱✘✓✏✑✘★✩✓✘✞❆✢✌ ✙✱✷✻✛✢✣★✛✞✙✑✷✞✛✻✙✑✏✓❘ ☛ ✭✰✘★✘✓✷▼✎✓✩✓✳✖❆ ✌ ✙✱❇✖❘ ☛ ✭✰✘★✘✓✷❚✌ ✙✑✏✱✛✞✒✪✘★✣✗✛✞✒✜✳✖✔✻✌ ❆ ✌ ✏✜❬

SLIDE 3

13 10 June, 2002 The Computer Communications Course

CBT (2)

☛ ✽✞✳✗✎✱✛✢✷❉✘✢✙✲✴ ✣✢✒✪✛★✷✻✛ P ✌ ✙✱✛✢✷✻✵✠✩✗✘✢✒✜✛✢✎✗❘ ☛ ■✻✳✗✩★✯❂❇✖✒✱✘✗✕✗✣✤✯✢✳✓✎✚✳❈✣✢✒✪✛✢✷✞✛ P ✌ ✙✑✛★✷❉✩✗✘★✒✪✛✞❘ ☛ ☞✰❑❉✕✓✎✑✛✢✎✚❨✢✭✰❊▼✿✦✏✑✘✦✩✗✘✞❆ ❆ ✛✖✩✓✏❈❆ ✘✗✩✓✳✞❆✗❅✂✛✖❅✦✔✢✛✞✒✜✎✗✯✻✌ ✣❈✷✞✳✗✏✱✳★❘ ☛ ☞✰❑ P ✘★✒✪◆✆✳★✒✪✷✞✎✂◗✪✘✢✌ ✙✦✒✪✛✁★✕✓✛✢✎✑✏✱✎✚✏✑✘✗◆✆✳★✒✪✷✞✎✲✏✓✯★✛❂❇✖✒✱✘✗✕★✣ ✖ ✎✦✩✗✘★✒✪✛ ✒✱✘✗✕✓✏✱✛✞✒✗✫✓✛✢✎✑✏✱✳✢✔✬❆ ✌ ✎✓✯✻✌ ✙✱❇ P ✘★✒✪◆✆✳✢✒✜✷✶✌ ✙✑❇❈✎✑✏✱✳✓✏✱✛✞❘ ☛✄✂ ☎✠✘✢✌ ✙ ✖✬✌ ✎ P ✘✢✒✪◆✆✳★✒✪✷✞✛✢✷❉✕✢✙✑✏✓✌ ❆✢✌ ✏✲✒✪✛★✳★✩★✯✢✛★✎✲✛✞✌ ✏✓✯✢✛✖✒✒ ✂▲❏✰✯✢✛✤✩✗✘★✒✪✛ ✒✱✘✗✕✗✏✱✛✖✒✑❘ ✂❀❙❲✙✪❬✤✘✗✏✓✯★✛✞✒✚✒✱✘✗✕✓✏✱✛✞✒✂✘✖✙✚✏✓✯★✛❂✎✗✯✢✳✢✒✜✛✢✷▼✏✓✒✜✛✢✛✞❘ ☛ ❏✰✯✢✛ ✒✱✘✗✕✓✏✱✛✞✒✚✒✪✛✢✎✑✣✢✘✢✙✑✷✞✎✚◆❲✌ ✏✓✯❂✳✆✂ ☎✆✘✢✌ ✙✲❙ ✠✞✝☛✖✢◆❯✯✞✌ ✩★✯▼✌ ✎✚✎✑✛✻✙✑✏ ✔✢✳✗✩★❖❈✕✗✣✗✎✑✏✓✒✪✛✢✳✗❅

. .

14 10 June, 2002 The Computer Communications Course

CBT (3)

15 10 June, 2002 The Computer Communications Course

CBT (4)

☛ ✧✠✛✻✙✱✷❋●✚✣✗✛✞✒✪✳✓✏✗✌ ✘✢✙✁ ✂❀✧✠✛✻✙✱✷✻✛✖✒✲✙✑✛✢✛★✷❚✙✓✘✓✏✦✔✢✛❂✳❈❅✂✛✖❅✦✔✢✛✖✒✂✘ P ✏✓✯✢✛❂❇✖✒✪✘★✕✗✣✢❘ ✂❀✧✠✛✻✙✱✷✻✛✖✒✂✩✓✳✖✙❈❝❯✙✗✌ ✩✓✳✓✎✑✏✚✏✓✯★✛❂✷✻✳✓✏✱✳❈❅✂✛✢✎✑✎✑✳✓❇★✛❂✏✑✘✦✏✓✯✢✛ ✩✗✘★✒✪✛✬✫✓✳✖✙✱✷▼✏✓✯✢✛✤✩✗✘★✒✪✛❉❆ ✳✗✏✱✛✖✒❲✷✶✌ ✎✑✏✓✒✓✌ ✔✖✕✓✏✱✛✢✎✚✏✓✯✢✛ ❅✂✛✢✎✑✎✑✳✓❇★✛❂✏✓✯✞✒✱✘✗✕✓❇✖✯✖✘✗✕✗✏✂✏✓✯✢✛❂✷ ✌ ✎✑✏✓✒✓✌ ✔✖✕✓✏✗✌ ✘✢✙✚✏✓✒✪✛★✛✞❘ ✂❀❙ ✒✱✘★✕✓✏✱✛✞✒❯◆❯✯✞✌ ✩★✯ ✒✜✛✖✩✓✛✻✌ ✺✑✛✢✎✚✏✓✯✢✛✤❅✂✛✢✎✑✎✑✳✓❇★✛▼✔✢✛ P ✘✢✒✪✛ ✏✓✯✢✛✤✩✗✘★✒✪✛✬✫✗✩✓✳✖✙✂✳✞❆ ✎✓✘✦✎✑✏✱✳★✒✪✏✂✳✦✷ ✌ ✎✑✏✓✒✑✌ ✔✢✕✗✏✗✌ ✘✖✙✚✣✖✒✪✘★✩✓✛★✎✑✎✗❘ ✂❚❨ P ✏✓✯★✛✤✎✑✛✞✙✑✷✞✛✞✒✚✒✪✛★✎★✌ ✷✞✛✢✎✲✘✖✙✚✏✓✯★✛❂✏✓✒✪✛✢✛▼✌ ✏✲✩✓✳✢✙ ✷ ✌ ✎✑✏✓✒✑✌ ✔✢✕✗✏✱✛❂✏✓✯★✛ ❅✂✛★✎✑✎✑✳✗❇★✛❂✷ ✌ ✒✜✛✖✩✓✏★❆ ❬✤✘✖✙✚✏✓✯★✛✤✏✓✒✜✛✢✛ .

.

16 10 June, 2002 The Computer Communications Course

CBT (5)

✟✡✠☞☛✍✌✏✎✒✑ ✓✕✔✖✌☞✌☞✗✘✎✏✙✛✚✁✜ ✚✣✢✁✤ ✜ ✤ ✥✛✦✧✥✛✌★✎☞✩✪✚✣☛✍✎✛✫✭✬✒☛✛✌✣✮✏✩✪✎✭✤ ✯✰✥✍✫✱☛✪✲✳✎★✌✏✴✧✢✒✚✱✯✍✗✱✵✞✤ ✗✒✥✪✶✘✚✱✯✍✗ ✎✪✥✍✚✏✥✛✫✁✷ ✟✹✸✁✌✱✯✍✎✣✑ ✓✻✺✼✮☞✢✱✽ ✌✣✩✪✥☞✤ ✲✳✚✁✜✏☛✛✌☞✮✪✥✛✫✣✎✾✚✣☛✍✫✿✩✏✌✏✎✪✎☞✤ ✢❀✜ ✫✿❁ ✗✒✫✱✩✪✫❂✯✍✗❃✤ ✯✍✬✭✌✱✯✰✚✣✙✛✥✪✮✪✚✁✜ ✲✳✫✱✲✾✢✒✫✱☛❄✎✏✶✁✤ ✩✭✤ ✯✰✥✪✶✒✫✧✬✒☛✛✌✣✮✏✩☞❅ ✓✻❆✼☛❄✚☞✴✏✴☞✤ ✙★✙✪✌✱✯✪✙✛✫❂✯❄✥✏☛❄✚✏✥☞✤ ✌✱✯✳✚✱✯✛✗❇✢✱✌✏✥✍✥✒✜ ✫❂✯✍✫✱✙☞❈✛✎✧✩✏✌✏✎✪✎✣✤ ✢❃✜ ✫✭✚✣☛✛✌✣✮✣✯✛✗✘✥✪✶✒✫ ✙✪✌✣☛❄✫✁✷ ✟✹❉✁✯✍✥✍✫✱☛✍✫☞✎✪✥☞✤ ✯❄✬✘✩✏✌✏✎✪✎✣✤ ✢✁✤ ✜ ✤ ✥☞✤ ✫☞✎✒✑ ✓❋❊✿✮✱✜ ✥☞✤ ✩✁✜ ✫✿✙✪✌✣☛❄✫✣✎✣✷ ✓❋●❄❍❂✌☞■✏✤ ✯✍✬✒❏✳✙✪✌✣☛❄✫❃❑☞✲✰✌☞■☞✤ ✯❄✬✿✤ ✯✾✗❂✤ ☛❄✫✱✙✛✥✏✤ ✌✱✯✾✌☞✴▲✚✣✙✍✥☞✤ ■✛✫✿✩✪✚✣☛❄✥☞✤ ✙☞✤ ✩✏✚✱✯❄✥✛✎✣✷