{"id":38332,"date":"2019-10-31T22:23:01","date_gmt":"2019-10-31T19:23:01","guid":{"rendered":"https:\/\/prohoster.info\/blog\/trening-cisco-200-125-ccna-v3-0-den-44-vvedenie-v-ospf\/"},"modified":"2019-10-31T22:23:01","modified_gmt":"2019-10-31T19:23:01","slug":"trening-cisco-200-125-ccna-v3-0-den-44-vvedenie-v-ospf","status":"publish","type":"post","link":"https:\/\/prohoster.info\/cs\/blog\/administrirovanie\/trening-cisco-200-125-ccna-v3-0-den-44-vvedenie-v-ospf","title":{"rendered":"\u0160kolen\u00ed Cisco 200-125 CCNA v3.0. Den 44. \u00davod do OSPF","gt_translate_keys":[{"key":"rendered","format":"text"}]},"content":{"rendered":"

Dnes za\u010dneme studium sm\u011brov\u00e1n\u00ed protokolem OSPF. Toto t\u00e9ma, stejn\u011b jako zkoum\u00e1n\u00ed protokolu EIGRP, je kl\u00ed\u010dov\u00e9 v cel\u00e9m kurzu CCNA. Jak vid\u00edte, \u010d\u00e1st 2.4 se naz\u00fdv\u00e1 \u201eNastaven\u00ed, ov\u011b\u0159en\u00ed a odstra\u0148ov\u00e1n\u00ed probl\u00e9m\u016f jedn\u00e9 oblasti a v\u00edc z\u00f3n OSPFv2 pro protokol IPv4 (krom\u011b autentizace, filtrov\u00e1n\u00ed, ru\u010dn\u00edho souhrnu tras, redistribuce, slep\u00e9 oblasti, virtu\u00e1ln\u00ed s\u00edt\u011b a LSA)\u201c. <\/p>\n

\"\u0160kolen\u00ed
\n
\nT\u00e9ma OSPF je dost obs\u00e1hl\u00e9, tak\u017ee zabere 2, mo\u017en\u00e1 3 videolekce. Dne\u0161n\u00ed lekce bude v\u011bnov\u00e1na teoretick\u00e9 str\u00e1nce v\u011bci, pov\u00edm v\u00e1m, co protokol OSPF obecn\u011b p\u0159edstavuje a jak funguje. V n\u00e1sleduj\u00edc\u00edm videu p\u0159ejdeme do re\u017eimu konfigurace OSPF pomoc\u00ed Packet Tracer.<\/a><\/noindex><\/p>\n

Na t\u00e9to lekci se pod\u00edv\u00e1me na t\u0159i v\u011bci: co je to OSPF, jak funguje a co jsou oblasti OSPF. V p\u0159edchoz\u00ed lekci jsme \u0159\u00edkali, \u017ee OSPF je protokol sm\u011brov\u00e1n\u00ed typu Link State, kter\u00fd zkoum\u00e1 komunika\u010dn\u00ed linky mezi sm\u011brova\u010di a rozhoduje na z\u00e1klad\u011b rychlosti t\u011bchto linek. Dlouh\u00e1 linka s vy\u0161\u0161\u00ed rychlost\u00ed, tedy s v\u011bt\u0161\u00ed \u0161\u00ed\u0159kou p\u00e1sma, m\u00e1 prioritu p\u0159ed kr\u00e1tkou linkou s ni\u017e\u0161\u00ed \u0161\u00ed\u0159kou p\u00e1sma.<\/p>\n

Protokol RIP, kter\u00fd je vzd\u00e1lenostn\u011b-vektorov\u00fd, zvol\u00ed cestu s jedn\u00edm skokem, i kdy\u017e m\u00e1 tato linka n\u00edzkou rychlost, zat\u00edmco protokol OSPF vybere del\u0161\u00ed trasu s n\u011bkolika skoky, pokud je celkov\u00e1 rychlost na t\u00e9to trase vy\u0161\u0161\u00ed ne\u017e rychlost provozu na krat\u0161\u00ed trase. <\/p>\n

\"\u0160kolen\u00ed
\n
\nPozd\u011bji se pod\u00edv\u00e1me na algoritmus rozhodov\u00e1n\u00ed, prozat\u00edm si zapamatujte, \u017ee OSPF je protokol stavu linky Link State. Tento otev\u0159en\u00fd standard byl vytvo\u0159en v roce 1988, aby ho mohli vyu\u017e\u00edt v\u0161ichni v\u00fdrobci s\u00ed\u0165ov\u00fdch za\u0159\u00edzen\u00ed a poskytovatel\u00e9 s\u00edt\u00ed. Proto je OSPF mnohem popul\u00e1rn\u011bj\u0161\u00ed ne\u017e EIGRP. <\/p>\n

Protokol OSPF verze 2 podporuje pouze protokol IPv4, a o rok pozd\u011bji, v roce 1989, v\u00fdvoj\u00e1\u0159i ozn\u00e1mili vyd\u00e1n\u00ed t\u0159et\u00ed verze, kter\u00e1 podporuje IPv6. Pln\u011b funk\u010dn\u00ed t\u0159et\u00ed verze OSPF pro IPv6 se v\u0161ak objevila a\u017e v roce 2008. Pro\u010d byl vybr\u00e1n pr\u00e1v\u011b OSPF? Na posledn\u00ed lekci jsme se dozv\u011bd\u011bli, \u017ee tento protokol vnit\u0159n\u00edho br\u00e1ny dosahuje konvergence tras mnohem rychleji ne\u017e RIP. Je to bezt\u0159\u00eddn\u00ed protokol. <\/p>\n

Pokud si pamatujete, RIP je klasov\u00fd protokol, co\u017e znamen\u00e1, \u017ee nepos\u00edl\u00e1 informace o masce pods\u00edt\u011b, a pokud se setk\u00e1 s IP adresou t\u0159\u00eddy A\/24, nep\u0159ijme ji. Nap\u0159\u00edklad pokud mu p\u0159edstav\u00edte IP adresu ve tvaru 10.1.1.0\/24, vn\u00edm\u00e1 ji jako s\u00ed\u0165 10.0.0.0, proto\u017ee nerozum\u00ed, kdy\u017e je s\u00ed\u0165 rozd\u011blena na pods\u00edt\u011b s pou\u017eit\u00edm v\u00edce ne\u017e jedn\u00e9 masky pods\u00edt\u011b.
\nOSPF je zabezpe\u010den\u00fd protokol. Nap\u0159\u00edklad pokud si dva sm\u011brova\u010de vym\u011b\u0148uj\u00ed informace OSPF, m\u016f\u017eete nastavit autentizaci tak, \u017ee sd\u00edlet informace se sousedn\u00edm sm\u011brova\u010dem bude mo\u017en\u00e9 pouze po zad\u00e1n\u00ed hesla. Jak jsme ji\u017e \u0159ekli, je to otev\u0159en\u00fd standard, tak\u017ee OSPF pou\u017e\u00edv\u00e1 mnoho v\u00fdrobc\u016f s\u00ed\u0165ov\u00e9ho vybaven\u00ed.<\/p>\n

V glob\u00e1ln\u00edm smyslu OSPF p\u0159edstavuje mechanismus v\u00fdm\u011bny ozn\u00e1men\u00ed o stavu kan\u00e1lu Link State Advertisement, nebo LSA. Zpr\u00e1vy LSA generuj\u00ed sm\u011brova\u010de a obsahuj\u00ed mnoho informac\u00ed: unik\u00e1tn\u00ed identifik\u00e1tor sm\u011brova\u010de router-id, data o s\u00edt\u00edch zn\u00e1m\u00fdch sm\u011brova\u010di, data o jejich n\u00e1kladnosti a tak d\u00e1le. V\u0161echny tyto informace jsou pot\u0159ebn\u00e9 sm\u011brova\u010di pro rozhodov\u00e1n\u00ed o sm\u011brov\u00e1n\u00ed. <\/p>\n

\"\u0160kolen\u00ed
\n
\nSm\u011brova\u010d R3 pos\u00edl\u00e1 svou informaci LSA sm\u011brova\u010di R5, zat\u00edmco sm\u011brova\u010d R5 sd\u00edl\u00ed svou LSA-informaci s R3. Tyto LSA p\u0159edstavuj\u00ed datovou strukturu, kter\u00e1 tvo\u0159\u00ed datab\u00e1zi stavu kan\u00e1l\u016f Link State Database, nebo LSDB. Sm\u011brova\u010d shroma\u017e\u010fuje v\u0161echny obdr\u017een\u00e9 LSA a ukl\u00e1d\u00e1 je do sv\u00e9 LSDB. Jakmile oba sm\u011brova\u010de vytvo\u0159ily sv\u00e9 datab\u00e1ze, vym\u011b\u0148uj\u00ed si zpr\u00e1vy Hello, kter\u00e9 slou\u017e\u00ed k objevov\u00e1n\u00ed soused\u016f, a p\u0159ech\u00e1zej\u00ed k procedu\u0159e porovn\u00e1v\u00e1n\u00ed sv\u00fdch LSDB.<\/p>\n

Sm\u011brova\u010d R3 zas\u00edl\u00e1 sm\u011brova\u010di R5 zpr\u00e1vu DBD, neboli \u201epopis datab\u00e1ze\u201c, a R5 pos\u00edl\u00e1 sv\u00e9 DBD sm\u011brova\u010di R3. Tyto zpr\u00e1vy obsahuj\u00ed indexy LSA, kter\u00e9 se nach\u00e1zej\u00ed v datab\u00e1z\u00edch ka\u017ed\u00e9ho sm\u011brova\u010de. Po obdr\u017een\u00ed DBD sm\u011brova\u010d R3 zas\u00edl\u00e1 sm\u011brova\u010di R5 dotaz na stav s\u00edt\u011b LSR, ve kter\u00e9m \u0159\u00edk\u00e1: \u201eu\u017e m\u00e1m zpr\u00e1vy 3, 4 a 9, tak\u017ee mi po\u0161lete pouze 5 a 7.\u201c <\/p>\n

R5 to postupuje stejn\u00fdm zp\u016fsobem, kdy\u017e t\u0159et\u00edmu routeru sd\u011bluje: \u201em\u00e1m informace 3, 4 a 9, proto mi po\u0161lete 1 a 2\u201c. Pot\u00e9, co p\u0159ijmou po\u017eadavky LSR, routery zp\u011btn\u011b pos\u00edlaj\u00ed pakety aktualizace stavu s\u00edt\u011b LSU, to znamen\u00e1, \u017ee jako odpov\u011b\u010f na sv\u016fj LSR dost\u00e1v\u00e1 t\u0159et\u00ed router LSU od routeru R5. Jakmile routery aktualizuj\u00ed sv\u00e9 datab\u00e1ze, v\u0161echny, i kdy\u017e m\u00e1te 100 router\u016f, budou m\u00edt shodn\u00e9 datab\u00e1ze LSDB. Jakmile budou datab\u00e1ze LSDB v routerech vytvo\u0159eny, ka\u017ed\u00fd z nich bude zn\u00e1t cel\u00e9 s\u00ed\u0165ov\u00e9 uspo\u0159\u00e1d\u00e1n\u00ed. Protokol OSPF vyu\u017e\u00edv\u00e1 algoritmus Shortest Path First k vytvo\u0159en\u00ed sm\u011brovac\u00ed tabulky, proto je kl\u00ed\u010dov\u00fdm p\u0159edpokladem jeho spr\u00e1vn\u00e9ho fungov\u00e1n\u00ed synchronizace LSDB v\u0161ech za\u0159\u00edzen\u00ed v s\u00edti. <\/p>\n

\"\u0160kolen\u00ed
\n
\nNa uveden\u00e9m sch\u00e9matu je um\u00edst\u011bno 9 router\u016f, z nich\u017e ka\u017ed\u00fd si mezi sebou vym\u011b\u0148uje zpr\u00e1vy LSR, LSU a dal\u0161\u00ed. V\u0161echny jsou vz\u00e1jemn\u011b propojeny pomoc\u00ed p2p typu, neboli \u201epoint-to-point\u201c rozhran\u00ed, kter\u00e9 podporuj\u00ed provoz na protokolu OSPF, a pracuj\u00ed spole\u010dn\u011b za \u00fa\u010delem vytvo\u0159en\u00ed shodn\u00fdch LSDB. <\/p>\n

\"\u0160kolen\u00ed
\n
\nJakmile budou datab\u00e1ze synchronizov\u00e1ny, ka\u017ed\u00fd router, pomoc\u00ed algoritmu nejkrat\u0161\u00ed cesty, vytvo\u0159\u00ed svou sm\u011brovac\u00ed tabulku. Tyto tabulky budou u r\u016fzn\u00fdch router\u016f odli\u0161n\u00e9. To znamen\u00e1, \u017ee v\u0161echny routery pou\u017e\u00edvaj\u00ed shodn\u00e9 LSDB, ale vytv\u00e1\u0159ej\u00ed sm\u011brovac\u00ed tabulky na z\u00e1klad\u011b vlastn\u00edch \u00favah o nejkrat\u0161\u00edch tras\u00e1ch. Pro pou\u017eit\u00ed tohoto algoritmu pot\u0159ebuje OSPF pravideln\u011b aktualizovat datab\u00e1zi LSDB. <\/p>\n

Tak\u017ee pro sv\u00e9 vlastn\u00ed fungov\u00e1n\u00ed mus\u00ed OSPF nejprve splnit 3 podm\u00ednky: naj\u00edt sousedy, vytvo\u0159it a aktualizovat LSDB a sestavit sm\u011brovac\u00ed tabulku. Pro spln\u011bn\u00ed prvn\u00ed podm\u00ednky m\u016f\u017ee s\u00ed\u0165ov\u00e9mu administr\u00e1torovi b\u00fdt pot\u0159eba ru\u010dn\u011b nakonfigurovat router-id, \u010dasov\u00e1n\u00ed nebo wildcard mask. V dal\u0161\u00edm videu se pod\u00edv\u00e1me na nastaven\u00ed za\u0159\u00edzen\u00ed pro pr\u00e1ci s OSPF, zat\u00edm byste m\u011bli v\u011bd\u011bt, \u017ee tento protokol pou\u017e\u00edv\u00e1 inverzn\u00ed masku, a pokud se neshoduje, pokud se va\u0161e pods\u00edt\u011b neshoduj\u00ed, nebo se neshoduje autentizace, sousedstv\u00ed router\u016f nem\u016f\u017ee b\u00fdt vytvo\u0159eno. Proto p\u0159i odstra\u0148ov\u00e1n\u00ed probl\u00e9m\u016f s OSPF mus\u00edte zjistit, pro\u010d toto sousedstv\u00ed nevznik\u00e1, tedy zkontrolovat shodu v\u00fd\u0161e uveden\u00fdch parametr\u016f.<\/p>\n

Jako spr\u00e1vce s\u00edt\u011b se nez\u00fa\u010dast\u0148ujete procesu vytv\u00e1\u0159en\u00ed LSDB. Aktualizace datab\u00e1z\u00ed prob\u00edh\u00e1 automaticky po vytvo\u0159en\u00ed sousedstv\u00ed router\u016f, stejn\u011b jako sestaven\u00ed sm\u011brovac\u00edch tabulek. To v\u0161e prov\u00e1d\u00ed samo za\u0159\u00edzen\u00ed, kter\u00e9 je nastaveno na pr\u00e1ci s protokolem OSPF.
\nPod\u00edvejme se na p\u0159\u00edklad. M\u00e1me dva routery, kter\u00fdm jsem pro zjednodu\u0161en\u00ed p\u0159i\u0159adil identifik\u00e1tory RID 1.1.1.1 a 2.2.2.2. Jakmile je spoj\u00edme, linkov\u00fd kan\u00e1l okam\u017eit\u011b p\u0159ejde do stavu up, proto\u017ee jsem nejprve tyto routery nastavil na pr\u00e1ci s OSPF. Jakmile se vytvo\u0159\u00ed spojen\u00ed, router A okam\u017eit\u011b ode\u0161le druh\u00e9mu routeru paket Hello. Tento paket bude obsahovat informace, \u017ee tento router dosud nikoho na tomto kan\u00e1lu \u201enevid\u011bl\u201c, proto\u017ee poprv\u00e9 odes\u00edl\u00e1 Hello, a tak\u00e9 jeho vlastn\u00ed identifik\u00e1tor, \u00fadaje o p\u0159ipojen\u00e9 s\u00edti a dal\u0161\u00ed informace, kter\u00fdmi se m\u016f\u017ee pod\u011blit se sousedem. <\/p>\n

\"\u0160kolen\u00ed
\n
\nPo obdr\u017een\u00ed tohoto paketu router B \u0159ekne: \u201eVid\u00edm, \u017ee na tomto komunika\u010dn\u00edm kan\u00e1lu je potenci\u00e1ln\u00ed kandid\u00e1t na sousedstv\u00ed podle protokolu OSPF\u201c a p\u0159ejde do stavu inicializace Init state. Paket Hello nen\u00ed unicastov\u00e9 nebo broadcastov\u00e9 zpr\u00e1vy, je to multicastov\u00fd paket, odes\u00edlan\u00fd na multicastovou OSPF IP adresu 224.0.0.5. N\u011bkte\u0159\u00ed lid\u00e9 se ptaj\u00ed, jak\u00e1 je maska pods\u00edt\u011b pro multicast. Skute\u010dnost je takov\u00e1, \u017ee multicast nem\u00e1 masku pods\u00edt\u011b, \u0161\u00ed\u0159\u00ed se jako r\u00e1diov\u00fd sign\u00e1l, kter\u00fd sly\u0161\u00ed v\u0161echna za\u0159\u00edzen\u00ed nastaven\u00e1 na jeho frekvenci. Nap\u0159\u00edklad pokud chcete sly\u0161et FM r\u00e1dio vys\u00edlaj\u00edc\u00ed na frekvenci 91,0, mus\u00edte nastavit sv\u016fj r\u00e1diov\u00fd p\u0159ij\u00edma\u010d na tuto frekvenci. <\/p>\n

Podobn\u011b je router B nastaven na p\u0159\u00edjem zpr\u00e1v pro multicastovou adresu 224.0.0.5. Poslouch\u00e1n\u00edm tohoto kan\u00e1lu p\u0159ij\u00edm\u00e1 paket Hello, kter\u00fd odeslal router A, a odpov\u00edd\u00e1 mu svou zpr\u00e1vou. <\/p>\n

\"\u0160kolen\u00ed
\n
\nP\u0159i\u010dem\u017e sousedstv\u00ed m\u016f\u017ee b\u00fdt nav\u00e1z\u00e1no pouze v p\u0159\u00edpad\u011b, \u017ee odpov\u011b\u010f B spl\u0148uje soubor krit\u00e9ri\u00ed. Prvn\u00edm krit\u00e9riem je, \u017ee frekvence odes\u00edl\u00e1n\u00ed zpr\u00e1v Hello a interval \u010dek\u00e1n\u00ed na odpov\u011b\u010f na tuto zpr\u00e1vu Dead Interval mus\u00ed b\u00fdt shodn\u00e9 u obou router\u016f. Obvykle je Dead Interval roven n\u011bkolika hodnot\u00e1m Hello timeru. Tak\u017ee pokud Hello timer routeru A je 10 s, a router B mu ode\u0161le zpr\u00e1vu po 30 s, p\u0159i\u010dem\u017e Dead Interval je 20 s, sousedstv\u00ed se nez\u0159\u00edd\u00ed. <\/p>\n

Druh\u00fdm krit\u00e9riem je, \u017ee ob\u011b routery mus\u00ed pou\u017e\u00edvat stejn\u00fd typ autentizace. Odpov\u00eddaj\u00edc\u00edm zp\u016fsobem mus\u00ed tak\u00e9 shodovat hesla pro autentizaci. <\/p>\n

T\u0159et\u00edm krit\u00e9riem je shoda identifik\u00e1tor\u016f z\u00f3ny Arial ID, \u010dtvrt\u00fdm \u2013 shoda d\u00e9lky prefixu s\u00edt\u011b. Pokud router A hl\u00e1s\u00ed prefix \/24, router B mus\u00ed m\u00edt tak\u00e9 prefix s\u00edt\u011b \/24. V dal\u0161\u00edm videu tuto problematiku podrobn\u011bji probereme, prozat\u00edm si pov\u0161imn\u011bte, \u017ee nejde o masku pods\u00edt\u011b, zde routery pou\u017e\u00edvaj\u00ed inverzn\u00ed masku Wildcard mask. A samoz\u0159ejm\u011b, p\u0159\u00edznaky stub area mus\u00ed tak\u00e9 souhlasit, pokud se routery nach\u00e1zej\u00ed v t\u00e9to z\u00f3n\u011b. <\/p>\n

Po kontrole t\u011bchto krit\u00e9ri\u00ed, pokud souhlas\u00ed, router B ode\u0161le routeru A sv\u016fj Hello paket. Na rozd\u00edl od zpr\u00e1vy A, router B uv\u00e1d\u00ed, \u017ee vid\u011bl router A, a p\u0159edstavuje se s\u00e1m. <\/p>\n

\"\u0160kolen\u00ed
\n
\nV reakci na tuto zpr\u00e1vu router A znovu pos\u00edl\u00e1 Hello routeru B, ve kter\u00e9 potvrzuje, \u017ee tak\u00e9 vid\u011bl router B, spojen\u00ed mezi nimi zahrnuje za\u0159\u00edzen\u00ed 1.1.1.1 a 2.2.2.2, a on s\u00e1m je za\u0159\u00edzen\u00edm 1.1.1.1. To je velmi d\u016fle\u017eit\u00e1 f\u00e1ze ustaven\u00ed sousedstv\u00ed. V tomto p\u0159\u00edpad\u011b se pou\u017e\u00edv\u00e1 obousm\u011brn\u00e9 spojen\u00ed 2-WAY, ale co se stane, pokud m\u00e1me switch s distribuovanou s\u00edt\u00ed ze 4 router\u016f? V takov\u00e9m \"sd\u00edlen\u00e9m\" prost\u0159ed\u00ed mus\u00ed jeden z router\u016f hr\u00e1t roli vybran\u00e9ho routeru Designated router D.R, a druh\u00fd \u2013 z\u00e1lo\u017en\u00edho vybran\u00e9ho routeru Backup designated router B.D.R.<\/p>\n

\"\u0160kolen\u00ed
\n
\nKa\u017ed\u00e9 z t\u011bchto za\u0159\u00edzen\u00ed vytvo\u0159\u00ed pln\u00e9 spojen\u00ed, nebo stav \u00fapln\u00e9 sousednosti. Pozd\u011bji prozkoum\u00e1me, co to obn\u00e1\u0161\u00ed, nicm\u00e9n\u011b spojen\u00ed tohoto typu bude nav\u00e1z\u00e1no pouze s D.R. a B.D.R, mezi sebou se dva doln\u00ed routery D a B st\u00e1le budou komunikovat podle sch\u00e9matu obousm\u011brn\u00e9ho spojen\u00ed \"point-to-point\". <\/p>\n

To znamen\u00e1, \u017ee s D.R. a B.D.R v\u0161echny routery vytv\u00e1\u0159ej\u00ed plnou sousednost, zat\u00edmco mezi sebou maj\u00ed spojen\u00ed typu point-to-point. To je velmi d\u016fle\u017eit\u00e9, proto\u017ee p\u0159i obousm\u011brn\u00e9m spojen\u00ed sousedn\u00edch za\u0159\u00edzen\u00ed mus\u00ed v\u0161echny parametry Hello paketu souhlasit. V na\u0161em p\u0159\u00edpad\u011b v\u0161e souhlas\u00ed, a proto za\u0159\u00edzen\u00ed bez probl\u00e9m\u016f vytv\u00e1\u0159ej\u00ed sousedstv\u00ed. <\/p>\n

Jakmile bude obousm\u011brn\u00e9 spojen\u00ed nav\u00e1z\u00e1no, router A ode\u0161le routeru B paket Database Description, neboli \"popis datab\u00e1ze\", a p\u0159ejde do stavu ExStart \u2013 za\u010d\u00e1tek v\u00fdm\u011bny, nebo \u010dek\u00e1n\u00ed na na\u010dten\u00ed. Database Descriptor p\u0159edstavuje informace podobn\u00e9 obsahu knihy \u2013 je to v\u00fd\u010det v\u0161eho, co je v datab\u00e1zi sm\u011brov\u00e1n\u00ed. V reakci na to router B po\u0161le sv\u00e9 popis datab\u00e1ze routeru A a p\u0159ejde do stavu v\u00fdm\u011bny informac\u00ed o kan\u00e1lech Exchange. Pokud v stavu Exchange router zjist\u00ed, \u017ee v jeho datab\u00e1zi chyb\u00ed n\u011bjak\u00e9 informace, p\u0159ejde do stavu na\u010d\u00edt\u00e1n\u00ed LOADING a za\u010dne vym\u011b\u0148ovat si s sousedem zpr\u00e1vy LSR, LSU a LSA.<\/p>\n

\"\u0160kolen\u00ed
\n
\nRouter A tedy po\u0161le sousedovi LSR, ten mu odpov\u00ed paketem LSU, na co\u017e router A odpov\u00ed routeru B zpr\u00e1vou LSA. Tato v\u00fdm\u011bna prob\u011bhne tolikr\u00e1t, kolikr\u00e1t cht\u011bj\u00ed za\u0159\u00edzen\u00ed vym\u011bnit zpr\u00e1vy LSA. Stav LOADING znamen\u00e1, \u017ee k pln\u00e9mu aktualizaci datab\u00e1ze LSA dosud nedo\u0161lo. Po na\u010dten\u00ed v\u0161ech dat ob\u011b za\u0159\u00edzen\u00ed p\u0159ejdou do stavu pln\u00e9 sousednosti FULL.<\/p>\n

R\u00e1d bych poznamenal, \u017ee p\u0159i obousm\u011brn\u00e9m spojen\u00ed jsou za\u0159\u00edzen\u00ed jednodu\u0161e ve stavu sousedstv\u00ed, zat\u00edmco stav pln\u00e9 sousednosti je mo\u017en\u00fd pouze mezi sm\u011brova\u010di D.R. a B.D.R. To znamen\u00e1, \u017ee ka\u017ed\u00fd router informuje D.R. o zm\u011bn\u00e1ch v s\u00edti a v\u0161ichni sm\u011brova\u010de se o t\u011bchto zm\u011bn\u00e1ch dozv\u00ed od D.R.<\/p>\n

V\u00fdb\u011br D.R. a B.D.R. je d\u016fle\u017eit\u00e1 ot\u00e1zka. Pod\u00edvejme se, jak prob\u00edh\u00e1 volba D.R. v celkov\u00e9m prost\u0159ed\u00ed. P\u0159edpokl\u00e1dejme, \u017ee v na\u0161\u00ed sch\u00e9m\u011b jsou t\u0159i sm\u011brova\u010de a switch. Nejprve za\u0159\u00edzen\u00ed OSPF porovn\u00e1vaj\u00ed priority v Hello zpr\u00e1v\u00e1ch, n\u00e1sledn\u011b porovn\u00e1vaj\u00ed Router ID. <\/p>\n

Za\u0159\u00edzen\u00ed s nejvy\u0161\u0161\u00ed prioritou se st\u00e1v\u00e1 D.R. Pokud se priority dvou za\u0159\u00edzen\u00ed shoduj\u00ed, je vybr\u00e1no za\u0159\u00edzen\u00ed s nejvy\u0161\u0161\u00edm Router ID, kter\u00e9 se st\u00e1v\u00e1 D.R.<\/p>\n

Z\u00e1lo\u017en\u00edm vybran\u00fdm sm\u011brova\u010dem B.D.R. se st\u00e1v\u00e1 za\u0159\u00edzen\u00ed se druhou nejvy\u0161\u0161\u00ed prioritou nebo se druh\u00fdm nejvy\u0161\u0161\u00edm Router ID. Pokud D.R. sel\u017ee, okam\u017eit\u011b ho nahrad\u00ed B.D.R. Ten za\u010dne hr\u00e1t roli D.R., a syst\u00e9m vybere dal\u0161\u00ed B.D.R.<\/p>\n

\"\u0160kolen\u00ed
\n
\nDouf\u00e1m, \u017ee jste porozum\u011bli v\u00fdb\u011bru D.R. a B.D.R., pokud ne, tak se k t\u00e9to ot\u00e1zce je\u0161t\u011b vr\u00e1t\u00edm v jednom z n\u00e1sleduj\u00edc\u00edch vide\u00ed a vysv\u011btl\u00edm tento proces. <\/p>\n

Tak\u017ee jsme probrali, co p\u0159edstavuje Hello, popis datab\u00e1ze Database Descriptor a zpr\u00e1vy LSR, LSU a LSA. Ne\u017e se p\u0159esuneme k dal\u0161\u00edmu t\u00e9matu, poj\u010fme si promluvit o n\u00e1kladech OSPF. <\/p>\n

\"\u0160kolen\u00ed
\n
\nV Cisco se n\u00e1klady na trasu po\u010d\u00edtaj\u00ed podle vzorce pom\u011bru propustnosti Reference bandwidth, kter\u00e1 je ve v\u00fdchoz\u00edm nastaven\u00ed rovna 100 Mb\/s, k n\u00e1klad\u016fm kan\u00e1lu. Nap\u0159\u00edklad, kdy\u017e se za\u0159\u00edzen\u00ed propojuj\u00ed p\u0159es s\u00e9riov\u00fd port s rychlost\u00ed 1,544 Mb\/s, n\u00e1klady budou \u010dinit 64. P\u0159i pou\u017eit\u00ed Ethernetov\u00e9ho p\u0159ipojen\u00ed o rychlosti 10 Mb\/s budou n\u00e1klady \u010dinit 10, a n\u00e1klady na FastEthernet p\u0159ipojen\u00ed s rychlost\u00ed 100 Mb\/s budou \u010dinit 1. <\/p>\n

P\u0159i pou\u017eit\u00ed Gigabit Ethernet m\u00e1me rychlost 1000 Mb\/s, av\u0161ak v tomto p\u0159\u00edpad\u011b se rychlost v\u017edy bere jako 1. Pokud tedy m\u00e1te v s\u00edti Gigabit Ethernet, m\u011bli byste zm\u011bnit v\u00fdchoz\u00ed hodnotu Ref. BW na 1000. V takov\u00e9m p\u0159\u00edpad\u011b budou n\u00e1klady \u010dinit 1 a cel\u00e1 tabulka bude p\u0159epo\u010d\u00edt\u00e1na s desetin\u00e1sobn\u00fdm zv\u00fd\u0161en\u00edm hodnot n\u00e1klad\u016f. Jakmile vytvo\u0159\u00edme sousedstv\u00ed a sestav\u00edme datab\u00e1zi LSDB, p\u0159ech\u00e1z\u00edme k sestaven\u00ed sm\u011brovac\u00ed tabulky. <\/p>\n

\"\u0160kolen\u00ed
\n
\nPo obdr\u017een\u00ed LSDB ka\u017ed\u00fd z router\u016f s\u00e1m za\u010d\u00edn\u00e1 vytv\u00e1\u0159et seznam sm\u011brov\u00e1n\u00ed pomoc\u00ed algoritmu SPF. V na\u0161\u00ed sch\u00e9matu router A vytvo\u0159\u00ed tuto tabulku pro sebe. Nap\u0159\u00edklad po\u010d\u00edt\u00e1 n\u00e1klady na trasu A-R1 a ur\u010duje je jako 10. Abychom usnadnili pochopen\u00ed sch\u00e9matu, p\u0159edpokl\u00e1dejme, \u017ee router A ur\u010duje optim\u00e1ln\u00ed trasu k routeru B. N\u00e1klady na p\u0159ipojen\u00ed A-R1 jsou 10, n\u00e1klady na p\u0159ipojen\u00ed A-R2 jsou 100 a n\u00e1klady na trasu A-R3 jsou 11, co\u017e je sou\u010det trasy A-R1(10) a R1-R3(1).<\/p>\n

Pokud se router A chce dostat k routeru R4, m\u016f\u017ee to ud\u011blat bu\u010f trasou A-R1-R4, nebo trasou A-R2-R4, p\u0159i\u010dem\u017e v obou p\u0159\u00edpadech budou n\u00e1klady na trasy stejn\u00e9: 10+100 = 100+10 = 110. Trasa A-R6 bude st\u00e1t 100+1 = 101, co\u017e je u\u017e lep\u0161\u00ed. D\u00e1le se zva\u017euje cesta k routeru R5 po trase A-R1-R3-R5, jej\u00ed\u017e n\u00e1klady \u010din\u00ed 10+1+100 = 111. <\/p>\n

Cestu k routeru R7 lze vyty\u010dit ve dvou tras\u00e1ch: A-R1-R4-R7 nebo A-R2-R6-R7. N\u00e1klady na prvn\u00ed \u010din\u00ed 210, na druhou 201, tak\u017ee by se m\u011bla zvolit 201. Tak\u017ee, aby se router A dostal k routeru B, m\u016f\u017ee pou\u017e\u00edt 4 trasy.<\/p>\n

\"\u0160kolen\u00ed
\n
\nCena trasy A-R1-R3-R5-B bude 121. Trasa A-R1-R4-R7-B bude st\u00e1t 220. Trasa A-R2-R4-R7-B stoj\u00ed 210 a A-R2-R6-R7-B m\u00e1 cenu 211. Na z\u00e1klad\u011b toho router A vybere trasu s nejni\u017e\u0161\u00ed cenou, tedy 121, a za\u0159ad\u00ed ji do tabulky sm\u011brov\u00e1n\u00ed. Toto je velmi zjednodu\u0161en\u00fd n\u00e1hled na to, jak funguje algoritmus SPF. Ve skute\u010dnosti se do tabulky za\u0159azuj\u00ed nejen ozna\u010den\u00ed router\u016f, kter\u00fdmi optim\u00e1ln\u00ed trasa proch\u00e1z\u00ed, ale tak\u00e9 ozna\u010den\u00ed port\u016f, kter\u00e9 je spojuj\u00ed, a v\u0161echny ostatn\u00ed pot\u0159ebn\u00e9 informace. <\/p>\n

Pod\u00edvejme se na dal\u0161\u00ed t\u00e9ma, kter\u00e9 se t\u00fdk\u00e1 sm\u011brovac\u00edch z\u00f3n. Obvykle p\u0159i nastavov\u00e1n\u00ed OSPF za\u0159\u00edzen\u00ed spole\u010dnosti jsou v\u0161echna v jedn\u00e9 spole\u010dn\u00e9 z\u00f3n\u011b. <\/p>\n

\"\u0160kolen\u00ed
\n
\nCo se stane, kdy\u017e za\u0159\u00edzen\u00ed p\u0159ipojen\u00e9 k routeru R3 n\u00e1hle sel\u017ee? Router R3 okam\u017eit\u011b za\u010dne pos\u00edlat router\u016fm R5 a R1 zpr\u00e1vu, \u017ee kan\u00e1l s t\u00edmto za\u0159\u00edzen\u00edm ji\u017e nefunguje, a v\u0161echny routery za\u010dnou vym\u011b\u0148ovat aktualizace o t\u00e9to ud\u00e1losti. <\/p>\n

\"\u0160kolen\u00ed
\n
\nPokud m\u00e1te 100 router\u016f, v\u0161echny aktualizuj\u00ed informace o stavu kan\u00e1l\u016f, proto\u017ee jsou v jedn\u00e9 spole\u010dn\u00e9 z\u00f3n\u011b. Tot\u00e9\u017e se stane, pokud sel\u017ee jeden z sousedn\u00edch router\u016f \u2013 v\u0161echna za\u0159\u00edzen\u00ed v z\u00f3n\u011b si vym\u011bn\u00ed aktualizace LSA. Po v\u00fdm\u011bn\u011b t\u011bchto zpr\u00e1v se zm\u011bn\u00ed samotn\u00e1 topologie s\u00edt\u011b. Jakmile k tomu dojde, SPF p\u0159epo\u010d\u00edt\u00e1 sm\u011brovac\u00ed tabulky podle zm\u011bn\u011bn\u00fdch podm\u00ednek. To je velmi rozs\u00e1hl\u00fd proces, a pokud m\u00e1te v jedn\u00e9 z\u00f3n\u011b tis\u00edc za\u0159\u00edzen\u00ed, mus\u00edte sledovat velikost pam\u011bti router\u016f, aby bylo dostate\u010dn\u00e9 pro ulo\u017een\u00ed v\u0161ech LSA a obrovsk\u00e9 datab\u00e1ze stavu kan\u00e1l\u016f LSDB. Jakmile dojde ke zm\u011bn\u00e1m v n\u011bjak\u00e9 \u010d\u00e1sti z\u00f3ny, algoritmus SPF okam\u017eit\u011b provede p\u0159epo\u010det tras. Ve v\u00fdchoz\u00edm nastaven\u00ed se LSA aktualizuje ka\u017ed\u00fdch 30 minut. Tento proces se neprov\u00e1d\u00ed na v\u0161ech za\u0159\u00edzen\u00edch sou\u010dasn\u011b, nicm\u00e9n\u011b v ka\u017ed\u00e9m p\u0159\u00edpad\u011b aktualizace prov\u00e1d\u00ed ka\u017ed\u00fd router s periodou 30 minut. \u010c\u00edm v\u00edce s\u00ed\u0165ov\u00fdch za\u0159\u00edzen\u00ed, t\u00edm v\u00edce pam\u011bti a \u010dasu je pot\u0159eba na aktualizaci LSDB.<\/p>\n

Tento probl\u00e9m lze vy\u0159e\u0161it, pokud rozd\u011bl\u00edte jednu spole\u010dnou z\u00f3nu na n\u011bkolik samostatn\u00fdch z\u00f3n, co\u017e znamen\u00e1 pou\u017e\u00edt multiz\u00f3nov\u00e1n\u00ed. K tomu mus\u00edte m\u00edt pl\u00e1n nebo sch\u00e9ma cel\u00e9 s\u00edt\u011b, kterou spravujete. Nulov\u00e1 z\u00f3na AREA 0 je va\u0161\u00ed hlavn\u00ed z\u00f3nou. To je m\u00edsto, kde prob\u00edh\u00e1 spojen\u00ed s vn\u011bj\u0161\u00ed s\u00edt\u00ed, nap\u0159\u00edklad p\u0159\u00edstup na internet. P\u0159i vytv\u00e1\u0159en\u00ed nov\u00fdch z\u00f3n byste se m\u011bli \u0159\u00eddit pravidlem: v ka\u017ed\u00e9 z\u00f3n\u011b by m\u011bl b\u00fdt jeden hranicov\u00fd router ABR. Hranicov\u00fd router m\u00e1 jedno rozhran\u00ed v jedn\u00e9 z\u00f3n\u011b a druh\u00e9 rozhran\u00ed v jin\u00e9 z\u00f3n\u011b. Nap\u0159\u00edklad router R5 m\u00e1 rozhran\u00ed ve z\u00f3n\u011b 1 a ve z\u00f3n\u011b 0. Jak jsem \u0159ekl, ka\u017ed\u00e1 z\u00f3na by m\u011bla b\u00fdt spojena s nulovou z\u00f3nou, co\u017e znamen\u00e1 m\u00edt hranicov\u00fd router, jeho\u017e jedno rozhran\u00ed je spojeno s AREA 0. <\/p>\n

\"\u0160kolen\u00ed
\n
\nP\u0159edstavme si, \u017ee spojen\u00ed R6-R7 selhalo. V tomto p\u0159\u00edpad\u011b se aktualizace LSA roz\u0161\u00ed\u0159\u00ed pouze po z\u00f3n\u011b AREA 1 a bude se t\u00fdkat pouze t\u00e9to z\u00f3ny. Za\u0159\u00edzen\u00ed ve z\u00f3n\u011b 2 a ve z\u00f3n\u011b 0 o tom ani nebudou v\u011bdoma. Hranicov\u00fd router R5 shrnuje informace o tom, co se d\u011bje ve sv\u00e9 z\u00f3n\u011b, a pos\u00edl\u00e1 do hlavn\u00ed z\u00f3ny AREA 0 souhrnn\u00e9 informace o stavu s\u00edt\u011b. Za\u0159\u00edzen\u00edm v jedn\u00e9 z\u00f3n\u011b nen\u00ed pot\u0159eba v\u011bd\u011bt o v\u0161ech zm\u011bn\u00e1ch LSA uvnit\u0159 jin\u00fdch z\u00f3n, proto\u017ee router ABR p\u0159en\u00e1\u0161\u00ed shrnut\u00e9 informace o tras\u00e1ch z jedn\u00e9 z\u00f3ny do druh\u00e9. <\/p>\n

Pokud si nejste zcela jisti konceptem z\u00f3n, m\u016f\u017eete se o n\u011bm dozv\u011bd\u011bt v\u00edce v n\u00e1sleduj\u00edc\u00edch lekc\u00edch, kdy se budeme zab\u00fdvat konfigurac\u00ed OSPF routingu a pop\u00ed\u0161eme n\u011bkolik p\u0159\u00edklad\u016f. <\/p>\n

\r\n \"P\u0159ehr\u00e1t\r\n
<\/div>\r\n <\/div><\/center>
\nD\u011bkujeme, \u017ee s n\u00e1mi z\u016fst\u00e1v\u00e1te. L\u00edb\u00ed se v\u00e1m na\u0161e \u010dl\u00e1nky? Chcete vid\u011bt v\u00edce zaj\u00edmav\u00fdch materi\u00e1l\u016f? Podpo\u0159te n\u00e1s objedn\u00e1vkou nebo doporu\u010den\u00edm zn\u00e1m\u00fdm, 30 % sleva pro u\u017eivatele Habra na jedine\u010dn\u00fd analog entry-level server\u016f, kter\u00fd jsme pro v\u00e1s vymysleli:<\/b> Ve\u0161ker\u00e1 pravda o VPS (KVM) E5-2650 v4 (6 jader) 10GB DDR4 240GB SSD 1Gbps od 20 $ nebo jak spr\u00e1vn\u011b rozd\u011blit server?<\/a><\/noindex> (k dispozici varianty s RAID1 a RAID10, a\u017e 24 jader a a\u017e 40GB DDR4).<\/p>\n

Dell R730xd za polovinu ceny?<\/b> Jen u n\u00e1s 2 x Intel TetraDeca-Core Xeon 2x E5-2697v3 2.6GHz 14C 64GB DDR4 4x960GB SSD 1Gbps 100 TB od 199 $<\/a><\/noindex> v Nizozemsku! Dell R420 \u2014 2x E5-2430 2.2GHz 6C 128GB DDR3 2x960GB SSD 1Gbps 100TB \u2014 od 99 $!<\/b><\/b> \u010ct\u011bte o tom Jak postavit infrastrukturu podnikov\u00e9 t\u0159\u00eddy s pou\u017eit\u00edm server\u016f Dell R730xd E5-2650 v4 v hodnot\u011b 9000 eur za pakatel?<\/a><\/noindex>
\n
Zdroj: habr.com<\/a><\/p>","protected":false,"gt_translate_keys":[{"key":"rendered","format":"html"}]},"excerpt":{"rendered":"

\u0421\u0435\u0433\u043e\u0434\u043d\u044f \u043c\u044b \u043d\u0430\u0447\u043d\u0435\u043c \u0438\u0437\u0443\u0447\u0435\u043d\u0438\u0435 \u043c\u0430\u0440\u0448\u0440\u0443\u0442\u0438\u0437\u0430\u0446\u0438\u0438 \u043f\u043e \u043f\u0440\u043e\u0442\u043e\u043a\u043e\u043b\u0443 OSPF. \u042d\u0442\u0430 \u0442\u0435\u043c\u0430, \u043a\u0430\u043a \u0438 \u0440\u0430\u0441\u0441\u043c\u043e\u0442\u0440\u0435\u043d\u0438\u0435 \u043f\u0440\u043e\u0442\u043e\u043a\u043e\u043b\u0430 EIGRP, \u044f\u0432\u043b\u044f\u0435\u0442\u0441\u044f \u0432\u0430\u0436\u043d\u0435\u0439\u0448\u0435\u0439 \u0432\u043e \u0432\u0441\u0435\u043c \u043a\u0443\u0440\u0441\u0435 CCNA. \u041a\u0430\u043a \u0432\u0438\u0434\u0438\u0442\u0435, \u0440\u0430\u0437\u0434\u0435\u043b 2.4 \u043d\u0430\u0437\u044b\u0432\u0430\u0435\u0442\u0441\u044f \u00ab\u041d\u0430\u0441\u0442\u0440\u043e\u0439\u043a\u0430, \u043f\u0440\u043e\u0432\u0435\u0440\u043a\u0430 \u0438 \u043d\u0435\u043f\u043e\u043b\u0430\u0434\u043a\u0438 \u0435\u0434\u0438\u043d\u0438\u0447\u043d\u043e\u0439 \u0437\u043e\u043d\u044b \u0438 \u043c\u0443\u043b\u044c\u0442\u0438\u0437\u043e\u043d\u044b OSPFv2 \u0434\u043b\u044f \u043f\u0440\u043e\u0442\u043e\u043a\u043e\u043b\u0430 IPv4 (\u0437\u0430 \u0438\u0441\u043a\u043b\u044e\u0447\u0435\u043d\u0438\u0435\u043c \u0430\u0443\u0442\u0435\u043d\u0442\u0438\u0444\u0438\u043a\u0430\u0446\u0438\u0438, \u0444\u0438\u043b\u044c\u0442\u0440\u0430\u0446\u0438\u0438, \u0440\u0443\u0447\u043d\u043e\u0433\u043e \u0441\u0443\u043c\u043c\u0438\u0440\u043e\u0432\u0430\u043d\u0438\u044f \u043c\u0430\u0440\u0448\u0440\u0443\u0442\u043e\u0432, \u043f\u0435\u0440\u0435\u0440\u0430\u0441\u043f\u0440\u0435\u0434\u0435\u043b\u0435\u043d\u0438\u044f, \u0442\u0443\u043f\u0438\u043a\u043e\u0432\u043e\u0439 \u043e\u0431\u043b\u0430\u0441\u0442\u0438, \u0432\u0438\u0440\u0442\u0443\u0430\u043b\u044c\u043d\u043e\u0439 \u0441\u0435\u0442\u0438 \u0438 LSA)\u00bb. \u0422\u0435\u043c\u0430 OSPF \u0434\u043e\u0441\u0442\u0430\u0442\u043e\u0447\u043d\u043e […]<\/p>\n","protected":false,"gt_translate_keys":[{"key":"rendered","format":"html"}]},"author":1,"featured_media":28774,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[688],"tags":[],"class_list":["post-38332","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-administrirovanie"],"aioseo_notices":[],"aioseo_head":"\n\t\t\n\t\n\t\n\t\n\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\n","aioseo_head_json":{"title":"\ud83e\udd47\u0160kolen\u00ed Cisco 200-125 CCNA v3.0. Den 44. \u00davod do OSPF | ProHoster","description":"Dnes za\u010dneme studium routingu pomoc\u00ed protokolu OSPF. Toto t\u00e9ma, stejn\u011b jako zkoum\u00e1n\u00ed protokolu EIGRP, je kl\u00ed\u010dov\u00e9 v cel\u00e9m kurzu CCNA.","canonical_url":"https:\/\/prohoster.info\/cs\/blog\/administrirovanie\/trening-cisco-200-125-ccna-v3-0-den-44-vvedenie-v-ospf","robots":"max-image-preview:large","keywords":"","webmasterTools":{"miscellaneous":""},"schema":null,"og:locale":"cs_CZ","og:site_name":"ProHoster | \u041a\u0443\u043f\u0438\u0442\u044c \u043d\u0430\u0434\u0435\u0436\u043d\u044b\u0439 \u0445\u043e\u0441\u0442\u0438\u043d\u0433 \u0434\u043b\u044f \u0441\u0430\u0439\u0442\u043e\u0432 \u0441 \u0437\u0430\u0449\u0438\u0442\u043e\u0439 \u043e\u0442 DDoS, VPS VDS \u0441\u0435\u0440\u0432\u0435\u0440\u044b","og:type":"article","og:title":"\ud83e\udd47\u0422\u0440\u0435\u043d\u0438\u043d\u0433 Cisco 200-125 CCNA v3.0. \u0414\u0435\u043d\u044c 44. \u0412\u0432\u0435\u0434\u0435\u043d\u0438\u0435 \u0432 OSPF | ProHoster","og:description":"\u0421\u0435\u0433\u043e\u0434\u043d\u044f \u043c\u044b \u043d\u0430\u0447\u043d\u0435\u043c \u0438\u0437\u0443\u0447\u0435\u043d\u0438\u0435 \u043c\u0430\u0440\u0448\u0440\u0443\u0442\u0438\u0437\u0430\u0446\u0438\u0438 \u043f\u043e \u043f\u0440\u043e\u0442\u043e\u043a\u043e\u043b\u0443 OSPF. \u042d\u0442\u0430 \u0442\u0435\u043c\u0430, \u043a\u0430\u043a \u0438 \u0440\u0430\u0441\u0441\u043c\u043e\u0442\u0440\u0435\u043d\u0438\u0435 \u043f\u0440\u043e\u0442\u043e\u043a\u043e\u043b\u0430 EIGRP, \u044f\u0432\u043b\u044f\u0435\u0442\u0441\u044f \u0432\u0430\u0436\u043d\u0435\u0439\u0448\u0435\u0439 \u0432\u043e \u0432\u0441\u0435\u043c \u043a\u0443\u0440\u0441\u0435 CCNA.","og:url":"https:\/\/prohoster.info\/cs\/blog\/administrirovanie\/trening-cisco-200-125-ccna-v3-0-den-44-vvedenie-v-ospf","og:image":"https:\/\/prohoster.info\/wp-content\/uploads\/2021\/11\/logo-350.jpg","og:image:secure_url":"https:\/\/prohoster.info\/wp-content\/uploads\/2021\/11\/logo-350.jpg","og:image:width":350,"og:image:height":350,"article:published_time":"2019-10-31T19:23:01+00:00","article:modified_time":"2019-10-31T19:23:01+00:00","article:publisher":"https:\/\/www.facebook.com\/prohoster","article:author":"https:\/\/www.facebook.com\/prohoster"},"aioseo_meta_data":{"post_id":"38332","title":null,"description":null,"keywords":null,"keyphrases":null,"primary_term":null,"canonical_url":null,"og_title":null,"og_description":null,"og_object_type":"default","og_image_type":"default","og_image_url":null,"og_image_width":null,"og_image_height":null,"og_image_custom_url":null,"og_image_custom_fields":null,"og_video":null,"og_custom_url":null,"og_article_section":null,"og_article_tags":null,"twitter_use_og":false,"twitter_card":"default","twitter_image_type":"default","twitter_image_url":null,"twitter_image_custom_url":null,"twitter_image_custom_fields":null,"twitter_title":null,"twitter_description":null,"schema":{"blockGraphs":[],"customGraphs":[],"default":{"data":{"Article":[],"Course":[],"Dataset":[],"FAQPage":[],"Movie":[],"Person":[],"Product":[],"ProductReview":[],"Car":[],"Recipe":[],"Service":[],"SoftwareApplication":[],"WebPage":[]},"graphName":"","isEnabled":true},"graphs":[]},"schema_type":null,"schema_type_options":null,"pillar_content":false,"robots_default":true,"robots_noindex":false,"robots_noarchive":false,"robots_nosnippet":false,"robots_nofollow":false,"robots_noimageindex":false,"robots_noodp":false,"robots_notranslate":false,"robots_max_snippet":null,"robots_max_videopreview":null,"robots_max_imagepreview":"large","priority":null,"frequency":null,"local_seo":null,"seo_analyzer_scan_date":"2026-01-23 21:32:21","breadcrumb_settings":null,"limit_modified_date":false,"reviewed_by":null,"ai":null,"created":"2021-03-01 01:11:22","updated":"2026-01-23 21:32:21","focus_keyword":null,"additional_keywords":null,"truseo_locale":null},"gt_translate_keys":[{"key":"link","format":"url"}],"_links":{"self":[{"href":"https:\/\/prohoster.info\/cs\/wp-json\/wp\/v2\/posts\/38332","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/prohoster.info\/cs\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/prohoster.info\/cs\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/prohoster.info\/cs\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/prohoster.info\/cs\/wp-json\/wp\/v2\/comments?post=38332"}],"version-history":[{"count":0,"href":"https:\/\/prohoster.info\/cs\/wp-json\/wp\/v2\/posts\/38332\/revisions"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/prohoster.info\/cs\/wp-json\/wp\/v2\/media\/28774"}],"wp:attachment":[{"href":"https:\/\/prohoster.info\/cs\/wp-json\/wp\/v2\/media?parent=38332"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/prohoster.info\/cs\/wp-json\/wp\/v2\/categories?post=38332"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/prohoster.info\/cs\/wp-json\/wp\/v2\/tags?post=38332"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}