Arborii si algoritmi folositi in protocoalele de rutare

                                   CUPRINS
|Capitolul I - Introducere……..……………………………………………………..             |1  |
|Capitolul II – Modelul multicast……………………………………………….…..          |4  |
|         2.1 Istoria arborilor……………………………………………………………..         |7  |
|         2.2 Calcularea rutei multicast…………………………………………………...   |8  |
|         2.3 Concepte si tehnologia DVMRP……………………………………………      |8  |
|               2.3.1 Conexiunile vecine……………………………………………………     |9  |
|               2.3.2 Anunţarea rutei sursei………………………………………………...|10 |
|         2.4 Cum alege DVMRP rutele……………………………………………….…         |11 |
|         2.5 Tabelul de rutare si cel de                        |11 |
|expedieri………………………………………..                                      |   |
|         2.6 Arborii “ calea cea mai scurtă”…………………………………………….. |12 |
|         2.7 Folosirea protocolului DVMRP…………………………………………….     |13 |
|               2.7.1 Modurile DVMRP…………………………………………………….        |13 |
|               2.7.2 Rularea DVMRP peste MOSPF………………………………………   |14 |
|Capitolul III – Descrierea algoritmilor folosiţi în protocoalele|15 |
|de rutare…….…                                                   |   |
|         3.1 Adresele multicast……………………………………………………….….         |16 |
|         3.2 Internet Group Management Protocol                 |18 |
|(IGMP)……………………………..                                             |   |
|         3.3 Grupuri multicast…………………………………………………………...         |19 |
|         3.4 Protocolul numărului de membri ai unui             |20 |
|grup……………………………...                                              |   |
|         3.5 Internet Group Management Protocol (IGMP) –        |20 |
|versiunea a doua………...                                          |   |
|         3.6 Multicast Forwarding Algorithms……………………………………….….  |22 |
|         3.7 Descrierea algoritmilor……………………………………………………..      |23 |
|               3.7.1 Flooding………………………………………………………………           |23 |
|               3.7.2 Spanning tree…………………………………………………………        |23 |
|               3.7.3 Reverse Path Broadcasting                  |24 |
|(RPB)……………………………………                                             |   |
|               3.7.4 Reverse Path Multicasting                  |27 |
|(RPM)……………………………………                                             |   |
|               3.7.5 Core-Based Trees (CBT)……………………………………………..  |29 |
|Capitolul IV – Descrierea protocolului DVMRP……………………………….…      |32 |
|         4.1 Interfeţe tunel şi fizice………………………………………………………     |32 |
|         4.2 Operaţii de bază………………………………………………………….…           |33 |
|         4.3 Funcţiile ruterului DVMRP…………………………………………………       |34 |
|         4.4 Tabelul de rutare DVMRP……………………………………………….…        |35 |
|         4.5 Tabelul de expediere DVMRP……………………………………………...     |36 |
|         4.6 Ierarhia DVMRP……………………………………………………………              |37 |
|               4.6.1 Avantaje ale rutarii ierarhice             |37 |
|multicast…………………………….…                                          |   |
|               4.6.2 Protocolul ierarhic DVMRP……………………………………….….|38 |
|         4.7 Abordarea rutarii IP multicast………………………………………………   |39 |
|         4.8 Rutarea DVMRP……………………………………………………………               |40 |
|         4.9 Tunelarea ca strategie de tranziţie pentru rutarea |43 |
|IP multicast……………..                                             |   |
|         4.10 Concluzii…………………………………………………………………..              |43 |
|Capitolul V – Implementarea protocolului DVMRP……………………………...    |44 |
|         5.1 Descoperirea vecinilor…………………………………………………..….      |44 |
|         5.2 Localizarea sursei ……………………………………………………...…...     |44 |
|         5.3 Rutele inferioare dependente………………………………………...……...|45 |
|         5.4 Expedierea indicată………………………………………………..………..       |46 |
|         5.5 Construcţia arborilor multicast…………………………………..………… |46 |
|         5.6 Curăţarea arborilor                                |47 |
|multicast…………………………………...…………...                                |   |
|         5.7 Grefarea arborilor multicast…………………………………..…………….  |48 |
|         5.9 Masajele probă……………………………………………………………...           |49 |
|               5.9.1 Capabilităţile                             |50 |
|ruterului………………………………………………..                                   |   |
|               5.9.2 Identificarea                              |53 |
|generaţiei…………………………………………….….                                  |   |
|               5.9.3 Adresele vecinilor………………………………………………….…    |53 |
|               5.9.4 Expirarea vecinului…………………………………………………...  |54 |
|               5.9.5 Formatul pachetului probă…………………………………………… |54 |
|               5.9.6 Selectarea “chestionarului” desemnat de    |55 |
|IGMP……………………...                                                 |   |
|         5.10 Expedierea multicast………………………………………………………         |55 |
|               5.10.1 Expeditorul desemnat…………………………………………….….  |56 |
|               5.10.2 Determinarea interfeţei                   |56 |
|superioare…………………………………..                                       |   |
|               5.10.3 Determinarea listei interfeţei            |56 |
|inferioare.………………………….…                                         |   |
|         5.11 Schimbarea rutei…………………………………………………………...         |57 |
|               5.11.1 Agrearea (acceptarea) reţelei             |57 |
|sursă……………………………….…                                             |   |
|               5.11.2 Ordonarea şi împachetarea                 |58 |
|rutei………………………………….….                                           |   |
|               5.11.3 Metrica rutei…………………………………………………………       |59 |
|               5.11.4 Dependenţele rutei…………………………………………………..   |59 |
|               5.11.5 Trimiterea raporturilor de                |60 |
|rută………………………………………                                             |   |
|               5.11.6 Primirea raporturilor                     |60 |
|rutei…………………………………………...                                        |   |
|               5.11.7 Expirarea rutei……………………………………………………….     |63 |
|         5.12 Curăţarea ……………………………………………………………….…              |63 |
|               5.12.1 Reţele foaie……………………………………………………….….      |63 |
|               5.12.2 Reţele sursă……………………………………………………….…       |64 |
|               5.12.3 Recepţionarea unei                        |64 |
|curăţări………………………………………….                                       |   |
|               5.12.4 Trimiterea unei                           |65 |
|curăţări……………………………………………...                                    |   |
|               5.12.5 Retransmiterea unei                       |65 |
|curăţări………………………………………...                                      |   |
|               5.12.6 Formatul pachetului de                    |66 |
|curăţare……………………………………..                                        |   |
|         5.13 Grefarea (alipirea)…………………………………………………………         |67 |
|               5.13.1 Trimiterea unei grefe………………………………………………...|68 |
|               5.13.2 Recepţionarea unei grefe…………………………………………….|68 |
|               5.13.3 Formatul pachetului grefă                 |69 |
|…………………………………………..                                              |   |
|               5.13.4 Trimiterea unei înştiinţări a             |69 |
|grefei…………………………………..                                           |   |
|               5.13.5 Recepţia “Graft                           |69 |
|Acknowledgement”………………………………...                                 |   |
|               5.13.6 Formatul “Graft                           |70 |
|Acknowledgement”………………………………..                                  |   |
|         5.14 Interfeţe……………………………………………………………………               |70 |
|         5.15 Tranziţiile interfeţei…………………………………………………….…      |71 |
|                                                                |   |