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

Dnes za\u010dneme studovat protokol EIGRP, kter\u00fd je d\u016fle\u017eit\u00fdm t\u00e9matem kurzu CCNA, stejn\u011b jako studium OSPF. <\/p>\n

\"\u0160kolen\u00ed
\n
\nPozd\u011bji se vr\u00e1t\u00edme k \u010d\u00e1sti 2.5, ale te\u010f hned po \u010d\u00e1sti 2.4 p\u0159ejdeme k \u010d\u00e1sti 2.6 \u201eNastaven\u00ed, ov\u011b\u0159en\u00ed a \u0159e\u0161en\u00ed probl\u00e9m\u016f s EIGRP protokolem IPv4 (s v\u00fdjimkou autentizace, filtrov\u00e1n\u00ed, manu\u00e1ln\u00edho sou\u010dtov\u00e1n\u00ed, redistribuce a konfigurace stub)\u201c.
\nDnes m\u00e1me \u00favodn\u00ed hodinu, b\u011bhem kter\u00e9 v\u00e1m p\u0159edstav\u00edm koncept vylep\u0161en\u00e9ho intern\u00edho protokolu sm\u011brov\u00e1n\u00ed br\u00e1ny EIGRP, a v n\u00e1sleduj\u00edc\u00edch dvou hodin\u00e1ch se zam\u011b\u0159\u00edme na nastaven\u00ed a odstra\u0148ov\u00e1n\u00ed probl\u00e9m\u016f tohoto protokolu. Ale nejd\u0159\u00edve v\u00e1m chci sd\u011blit n\u00e1sleduj\u00edc\u00ed.<\/a><\/noindex><\/p>\n

B\u011bhem n\u011bkolika posledn\u00edch hodin jsme studovali OSPF. Te\u010f bych cht\u011bl, abyste si vzpomn\u011bli, \u017ee kdy\u017e jsme p\u0159ed mnoha m\u011bs\u00edci studovali protokol RIP, mluvili jsme o sm\u011brovac\u00edch smy\u010dk\u00e1ch a technologi\u00edch, kter\u00e9 zabra\u0148uj\u00ed cyklen\u00ed provozu. Jak lze zabr\u00e1nit vzniku sm\u011brovac\u00edch smy\u010dek p\u0159i pou\u017eit\u00ed OSPF? Je mo\u017en\u00e9 pou\u017e\u00edt metody jako \u201eotravov\u00e1n\u00ed sm\u011brov\u00e1n\u00ed\u201c (Route Poison) nebo \u201erozd\u011blen\u00fd horizont\u201c (Split Horizon)? To jsou ot\u00e1zky, na kter\u00e9 byste m\u011bli odpov\u011bd\u011bt sami. M\u016f\u017eete pou\u017e\u00edt dal\u0161\u00ed t\u00e9matick\u00e9 zdroje, ale najd\u011bte odpov\u011bdi na tyto ot\u00e1zky. Chci, abyste se nau\u010dili nach\u00e1zet odpov\u011bdi samostatn\u011b, pracuj\u00edc\u00ed s r\u016fzn\u00fdmi zdroji, a po\u017e\u00e1d\u00e1m v\u00e1s, abyste zanechali sv\u00e9 koment\u00e1\u0159e pod t\u00edmto videem, abych mohl vid\u011bt, kolik m\u00fdch student\u016f zvl\u00e1dlo tento \u00fakol. <\/p>\n

Co je EIGRP? Je to hybridn\u00ed sm\u011brovac\u00ed protokol, kter\u00fd kombinuje u\u017eite\u010dn\u00e9 funkce jak vzd\u00e1lenostn\u011b-vektorov\u00e9ho protokolu, jako je RIP, tak protokolu sleduj\u00edc\u00edho stav linky typu OSPF. <\/p>\n

\"\u0160kolen\u00ed
\n
\nEIGRP je propriet\u00e1rn\u00ed protokol Cisco, kter\u00fd byl vyd\u00e1n pro ve\u0159ejnost v roce 2013. Z protokolu sleduj\u00edc\u00edho stav linky p\u0159evzal algoritmus pro nav\u00e1z\u00e1n\u00ed sousedstv\u00ed, na rozd\u00edl od RIP, kter\u00fd nevytv\u00e1\u0159\u00ed sousedy. RIP tak\u00e9 sd\u00edl\u00ed tabulky sm\u011brov\u00e1n\u00ed s ostatn\u00edmi \u00fa\u010dastn\u00edky protokolu, av\u0161ak OSPF p\u0159ed zah\u00e1jen\u00edm takov\u00e9ho sd\u00edlen\u00ed formuje sousedstv\u00ed. EIGRP funguje obdobn\u011b.<\/p>\n

Protokol RIP prov\u00e1d\u00ed ka\u017ed\u00fdch 30 sekund pravideln\u00e9 aktualizace cel\u00e9 sm\u011brovac\u00ed tabulky a rozes\u00edl\u00e1 informace o v\u0161ech rozhran\u00edch a v\u0161ech tras\u00e1ch v\u0161em sv\u00fdm soused\u016fm. EIGRP nevykon\u00e1v\u00e1 pravidelnou \u00faplnou aktualizaci informac\u00ed, m\u00edsto toho pou\u017e\u00edv\u00e1 koncept rozes\u00edl\u00e1n\u00ed Hello zpr\u00e1v, podobn\u011b jako OSPF. Ka\u017ed\u00fdch n\u011bkolik sekund pos\u00edl\u00e1 Hello, aby se ujistil, \u017ee soused je st\u00e1le \"\u017eiv\u00fd\".<\/p>\n

Na rozd\u00edl od vzd\u00e1len\u011b-vektorov\u00e9ho protokolu, kter\u00fd zkoum\u00e1 celou topologii s\u00edt\u011b, ne\u017e se rozhodne o vytv\u00e1\u0159en\u00ed trasy, EIGRP podobn\u011b jako RIP vytv\u00e1\u0159\u00ed trasy na z\u00e1klad\u011b \u201adrb\u016f\u2018. Kdy\u017e \u0159\u00edk\u00e1m \u201adrby\u2018, m\u00e1m na mysli, \u017ee kdy\u017e soused n\u011bco oznamuje, EIGRP s t\u00edm bezv\u00fdhradn\u011b souhlas\u00ed. Nap\u0159\u00edklad, pokud soused \u0159\u00edk\u00e1, \u017ee v\u00ed, jak dos\u00e1hnout 10.1.1.2, EIGRP mu v\u011b\u0159\u00ed, ani se nept\u00e1: \u201eOdkud to v\u00ed\u0161? \u0158ekni mi o topologii cel\u00e9 s\u00edt\u011b!\u201c. <\/p>\n

Do roku 2013, pokud jste pou\u017e\u00edvali pouze infrastrukturu Cisco, mohli jste vyu\u017e\u00edvat EIGRP, proto\u017ee tento protokol byl vytvo\u0159en ji\u017e v roce 1994. Nicm\u00e9n\u011b mnoh\u00e9 spole\u010dnosti, i kdy\u017e pou\u017e\u00edvaly vybaven\u00ed Cisco, necht\u011bly s t\u00edmto protokolem pracovat. Podle m\u00e9ho n\u00e1zoru je EIGRP v sou\u010dasnosti nejlep\u0161\u00edm protokolem dynamick\u00e9ho sm\u011brov\u00e1n\u00ed, proto\u017ee je mnohem snaz\u0161\u00ed na pou\u017eit\u00ed, p\u0159esto lid\u00e9 i nad\u00e1le preferuj\u00ed OSPF. Mysl\u00edm, \u017ee je to t\u00edm, \u017ee se necht\u011bj\u00ed \"upoutat\" na produkty Cisco. Cisco v\u0161ak tento protokol u\u010dinila ve\u0159ejn\u011b dostupn\u00fdm, proto\u017ee podporuje s\u00ed\u0165ov\u00e9 vybaven\u00ed od t\u0159et\u00edch stran, nap\u0159\u00edklad Juniper, a pokud se spoj\u00edte se spole\u010dnost\u00ed, kter\u00e1 nepou\u017e\u00edv\u00e1 vybaven\u00ed Cisco, nebudete m\u00edt \u017e\u00e1dn\u00e9 probl\u00e9my. <\/p>\n

D\u011blejme si kr\u00e1tk\u00fd exkurz do historie s\u00ed\u0165ov\u00fdch protokol\u016f. <\/p>\n

\"\u0160kolen\u00ed
\n
\nProtokol RIPv1, kter\u00fd se objevil v 80. letech, m\u011bl \u0159adu omezen\u00ed, nap\u0159\u00edklad maxim\u00e1ln\u00ed po\u010det hop\u016f rovn\u00fd 16, a tedy nemohl zajistit sm\u011brov\u00e1n\u00ed v rozs\u00e1hl\u00fdch s\u00edt\u00edch. O n\u011bco pozd\u011bji byl vyvinut vnit\u0159n\u00ed protokol sm\u011brov\u00e1n\u00ed br\u00e1ny IGRP, kter\u00fd byl mnohem lep\u0161\u00ed ne\u017e RIP. Byl v\u0161ak v\u00edce vzd\u00e1len\u011b-vektorov\u00fdm protokolem ne\u017e protokolem stavu kan\u00e1l\u016f. Na konci 80. let se objevil otev\u0159en\u00fd standard \u2013 protokol sledov\u00e1n\u00ed stavu kan\u00e1l\u016f OSPFv2 pro protokol IPv4. <\/p>\n

Na za\u010d\u00e1tku 90. let se Cisco rozhodla, \u017ee je t\u0159eba zlep\u0161it protokol IGRP, a vydala vylep\u0161enou verzi intern\u00edho sm\u011brovac\u00edho protokolu EIGRP. Byl mnohem efektivn\u011bj\u0161\u00ed ne\u017e OSPF, proto\u017ee kombinoval vlastnosti RIP i OSPF. A\u017e se za\u010dneme v\u011bnovat jeho studiu, zjist\u00edte, \u017ee nastavit EIGRP je mnohem jednodu\u0161\u0161\u00ed ne\u017e OSPF. Cisco se sna\u017eila vytvo\u0159it protokol, kter\u00fd by zajistil co nejrychlej\u0161\u00ed konvergenci s\u00edt\u011b. <\/p>\n

Na konci 90. let byla vyd\u00e1na aktualizovan\u00e1 bezt\u0159\u00eddn\u00ed verze protokolu RIPv2. V 2000. letech se objevila t\u0159et\u00ed verze OSPF, RIPng a EIGRPv6, kter\u00e9 podporovaly protokol IPv6. Sv\u011bt se postupn\u011b bl\u00ed\u017e\u00ed k \u00fapln\u00e9mu p\u0159echodu na IPv6 a v\u00fdvoj\u00e1\u0159i sm\u011brovac\u00edch protokol\u016f se cht\u011bj\u00ed na to p\u0159ipravit. <\/p>\n

Pokud si vzpom\u00edn\u00e1te, studovali jsme, \u017ee p\u0159i v\u00fdb\u011bru optim\u00e1ln\u00ed trasy se RIP, jako\u017eto protokol s vzd\u00e1lenostn\u00edmi vektory, \u0159\u00edd\u00ed pouze jedn\u00edm krit\u00e9riem \u2014 minim\u00e1ln\u00edm po\u010dtem skok\u016f, nebo minim\u00e1ln\u00ed vzd\u00e1lenost\u00ed k c\u00edlov\u00e9mu rozhran\u00ed. Router R1 tedy zvol\u00ed p\u0159\u00edmou trasu k routeru R3, i kdy\u017e rychlost na t\u00e9to trase je 64 kbit\/s, co\u017e je daleko m\u00e9n\u011b ne\u017e rychlost trasy R1-R2-R3, kter\u00e1 \u010din\u00ed 1544 kbit\/s. Protokol RIP pova\u017euje za optim\u00e1ln\u00ed pomalou trasu s jedn\u00edm skokem, nikoli rychlou trasu se dv\u011bma skoky. <\/p>\n

\"\u0160kolen\u00ed
\n
\nOSPF prozkoum\u00e1 celou topologii s\u00edt\u011b a rozhodne, \u017ee pro spojen\u00ed s routerem R3 pou\u017eije trasu p\u0159es router R2, proto\u017ee je rychlej\u0161\u00ed. Jako metrikou RIP pou\u017e\u00edv\u00e1 po\u010det skok\u016f, zat\u00edmco metrikou OSPF je cena, kter\u00e1 je v\u011bt\u0161inou proporcion\u00e1ln\u00ed \u0161\u00ed\u0159ce p\u00e1sma kan\u00e1lu. <\/p>\n

EIGRP se tak\u00e9 zam\u011b\u0159uje na n\u00e1klady na trasu, jeho metrika je v\u0161ak mnohem slo\u017eit\u011bj\u0161\u00ed ne\u017e metrika OSPF a spol\u00e9h\u00e1 na mnoho faktor\u016f, v\u010detn\u011b \u0161\u00ed\u0159ky p\u00e1sma Bandwidth, zpo\u017ed\u011bn\u00ed Delay, spolehlivosti Reliability, zat\u00ed\u017een\u00ed Loading a maxim\u00e1ln\u00ed velikosti paketu MTU. Nap\u0159\u00edklad, pokud je n\u011bjak\u00fd uzel zat\u00ed\u017een v\u00edce ne\u017e ostatn\u00ed, EIGRP analyzuje zat\u00ed\u017een\u00ed cel\u00e9 trasy a zvol\u00ed jin\u00fd uzel s men\u0161\u00edm zat\u00ed\u017een\u00edm.<\/p>\n

V kurzu CCNA budeme br\u00e1t v \u00favahu pouze takov\u00e9 faktory utv\u00e1\u0159en\u00ed metriky, jako jsou Bandwidth a Delay, pr\u00e1v\u011b ty pou\u017eije vzorec metriky. <\/p>\n

\"\u0160kolen\u00ed
\n
\nD\u00e1lkov\u011b-vektorov\u00fd protokol RIP vyu\u017e\u00edv\u00e1 dva pojmy: vzd\u00e1lenost a sm\u011br. Pokud m\u00e1me t\u0159i routery a jeden z nich je p\u0159ipojen k s\u00edti 20.0.0.0, v\u00fdb\u011br bude prov\u00e1d\u011bn podle vzd\u00e1lenosti \u2013 co\u017e jsou hopky, v tomto p\u0159\u00edpad\u011b 1 hop, a podle sm\u011bru, tedy kter\u00fdm sm\u011brem \u2013 horn\u00edm nebo doln\u00edm \u2013 pos\u00edlat provoz. <\/p>\n

Krom\u011b toho RIP vyu\u017e\u00edv\u00e1 periodick\u00e9 aktualizace informac\u00ed, kdy rozes\u00edl\u00e1 celou tabulku sm\u011brov\u00e1n\u00ed po cel\u00e9 s\u00edti ka\u017ed\u00fdch 30 sekund. Tato aktualizace vykon\u00e1v\u00e1 dv\u011b funkce. Prvn\u00ed \u2013 vlastn\u00ed aktualizace tabulky sm\u011brov\u00e1n\u00ed, druh\u00e1 \u2013 kontrola \u017eivotnosti souseda. Pokud za\u0159\u00edzen\u00ed nedost\u00e1v\u00e1 odpov\u011bdn\u00e9 aktualizace tabulky nebo nov\u00e9 informace o trase od souseda po dobu 30 s, ch\u00e1pe, \u017ee trasa k sousedovi ji\u017e nen\u00ed pou\u017eiteln\u00e1. Router pos\u00edl\u00e1 aktualizaci ka\u017ed\u00fdch 30 sekund, aby zjistil, zda je soused \u201e\u017eiv\u00fd\u201c a zda je trasa st\u00e1le platn\u00e1. <\/p>\n

Jak jsem \u0159\u00edkal, pro prevenci sm\u011brov\u00fdch smy\u010dek se pou\u017e\u00edv\u00e1 technologie Split Horizon. To znamen\u00e1, \u017ee aktualizace se neodes\u00edl\u00e1 zp\u011bt na rozhran\u00ed, ze kter\u00e9ho p\u0159i\u0161la. Druhou technologi\u00ed pro prevenci smy\u010dek je Route Poison. Pokud byla p\u0159eru\u0161ena spojen\u00ed se zobrazenou s\u00edt\u00ed 20.0.0.0, router, ke kter\u00e9mu byla p\u0159ipojena, ode\u0161le soused\u016fm \u201eotr\u00e1venou trasu\u201c, ve kter\u00e9 oznamuje, \u017ee tato s\u00ed\u0165 je nyn\u00ed dostupn\u00e1 v 16 hop\u016f, tedy prakticky nedosa\u017eiteln\u00e1. Takto funguje protokol RIP.<\/p>\n

Jak funguje EIGRP? Pokud si vzpomenete z lekc\u00ed o OSPF, tento protokol vykon\u00e1v\u00e1 t\u0159i funkce: vytv\u00e1\u0159\u00ed sousedstv\u00ed, pomoc\u00ed LSA aktualizuje datab\u00e1zi LSDB podle zm\u011bn v topologii s\u00edt\u011b a vytv\u00e1\u0159\u00ed tabulku sm\u011brov\u00e1n\u00ed. Vytv\u00e1\u0159en\u00ed sousedstv\u00ed je pom\u011brn\u011b slo\u017eit\u00fd postup, kter\u00fd vyu\u017e\u00edv\u00e1 \u0159adu parametr\u016f. Nap\u0159\u00edklad kontrola a zm\u011bna spojen\u00ed 2WAY \u2013 n\u011bkter\u00e1 spojen\u00ed z\u016fst\u00e1vaj\u00ed ve stavu obousm\u011brn\u00e9 komunikace, jin\u00e1 p\u0159ech\u00e1zej\u00ed do stavu FULL. Na rozd\u00edl od OSPF, v protokolu EIGRP k tomu nedoch\u00e1z\u00ed \u2013 kontroluje pouze 4 parametry. <\/p>\n

\"\u0160kolen\u00ed
\n
\nStejn\u011b jako OSPF, tento protokol ka\u017ed\u00fdch 10 sekund odes\u00edl\u00e1 zpr\u00e1vu Hello, kter\u00e1 obsahuje 4 parametry. Prvn\u00ed je krit\u00e9rium autentizace, pokud byla p\u0159edem nastavena. V\u0161echna za\u0159\u00edzen\u00ed, se kter\u00fdmi se vytv\u00e1\u0159\u00ed sousedstv\u00ed, mus\u00ed m\u00edt stejn\u00e9 parametry autentizace.<\/p>\n

Druh\u00fd parametr slou\u017e\u00ed k ov\u011b\u0159en\u00ed, \u017ee za\u0159\u00edzen\u00ed pat\u0159\u00ed do stejn\u00e9 autonomn\u00ed soustavy, tedy pro vytvo\u0159en\u00ed sousedstv\u00ed pomoc\u00ed protokolu EIGRP mus\u00ed m\u00edt ob\u011b za\u0159\u00edzen\u00ed stejn\u00e9 \u010d\u00edslo autonomn\u00ed soustavy. T\u0159et\u00ed parametr slou\u017e\u00ed k ov\u011b\u0159en\u00ed, \u017ee zpr\u00e1vy Hello jsou rozes\u00edl\u00e1ny z jedn\u00e9 IP adresy zdroje Source IP. <\/p>\n

\u010ctvrt\u00fd parametr se pou\u017e\u00edv\u00e1 k ov\u011b\u0159en\u00ed shody prom\u011bnn\u00fdch koeficient\u016f K-Values. Protokol EIRGP pou\u017e\u00edv\u00e1 5 takov\u00fdch koeficient\u016f od K1 do K5. Pokud si pamatujete, p\u0159i hodnot\u011b K=0 se parametry ignoruj\u00ed, pokud je K=1, parametry se pou\u017e\u00edvaj\u00ed ve vzorci pro v\u00fdpo\u010det metriky. Tak\u017ee hodnoty K1-5 pro r\u016fzn\u00e1 za\u0159\u00edzen\u00ed mus\u00ed b\u00fdt shodn\u00e9. V kurzu CCNA budeme br\u00e1t hodnoty t\u011bchto koeficient\u016f jako v\u00fdchoz\u00ed: K1 a K3 rovny 1, zat\u00edmco K2, K4 a K5 rovny 0.<\/p>\n

Pokud tedy tyto 4 parametry souhlas\u00ed, EIGRP vytv\u00e1\u0159\u00ed sousedsk\u00e9 vztahy a za\u0159\u00edzen\u00ed se vz\u00e1jemn\u011b zapisuj\u00ed do tabulky soused\u016f. N\u00e1sledn\u011b doch\u00e1z\u00ed k zm\u011bn\u00e1m v tabulce topologie. <\/p>\n

\"\u0160kolen\u00ed
\n
\nV\u0161echny zpr\u00e1vy Hello se odes\u00edlaj\u00ed na multicastovou IP adresu 224.0.0.10, zat\u00edmco aktualizace podle nastaven\u00ed se zas\u00edlaj\u00ed na unicastov\u00e9 adresy soused\u016f nebo na multicastovou adresu. Tato aktualizace neprob\u00edh\u00e1 pomoc\u00ed UDP nebo TCP, ale pou\u017e\u00edv\u00e1 jin\u00fd protokol nazvan\u00fd RTP, Reliable Transport Protocol, nebo 'spolehliv\u00fd p\u0159enosov\u00fd protokol'. Tento protokol kontroluje, zda soused aktualizaci obdr\u017eel, a jak nazna\u010duje jeho n\u00e1zev, jeho kl\u00ed\u010dovou funkc\u00ed je zaji\u0161t\u011bn\u00ed spolehlivosti spojen\u00ed. Pokud se aktualizace nedostane k sousedovi, p\u0159enos se zopakuje, dokud ji neobdr\u017e\u00ed. V OSPF chyb\u00ed mechanismus pro kontrolu p\u0159\u00edjemce za\u0159\u00edzen\u00ed, tak\u017ee syst\u00e9m nev\u00ed, zda sousedn\u00ed za\u0159\u00edzen\u00ed aktualizaci obdr\u017eela nebo ne.
\nPokud si vzpom\u00edn\u00e1te, RIP ka\u017ed\u00fdch 30 sekund rozes\u00edl\u00e1 aktualizaci pln\u00e9 topologie s\u00edt\u011b. EIGRP to d\u011bl\u00e1 pouze tehdy, kdy\u017e se v s\u00edti objev\u00ed nov\u00e9 za\u0159\u00edzen\u00ed nebo dojde k n\u011bjak\u00fdm zm\u011bn\u00e1m. Pokud dojde ke zm\u011bn\u011b topologie pods\u00edt\u011b, protokol ode\u0161le aktualizaci, ale ne cel\u00e9 tabulky topologie, pouze z\u00e1znamy t\u00fdkaj\u00edc\u00ed se t\u00e9to zm\u011bny. Pokud se zm\u011bn\u00ed n\u011bjak\u00e1 pods\u00ed\u0165, bude aktualizov\u00e1na pouze jej\u00ed topologie. To vypad\u00e1 jako \u010d\u00e1ste\u010dn\u00e1 aktualizace, kter\u00e1 prob\u00edh\u00e1, kdy\u017e je to pot\u0159eba. <\/p>\n

Jak v\u00edte, OSPF rozes\u00edl\u00e1 LSA ka\u017ed\u00fdch 30 minut, a\u0165 u\u017e do\u0161lo v s\u00edti k n\u011bjak\u00fdm zm\u011bn\u00e1m, \u010di nikoliv. EIGRP nebude po del\u0161\u00ed dobu rozes\u00edlat \u017e\u00e1dn\u00e9 aktualizace, dokud nedojde k n\u011bjak\u00fdm zm\u011bn\u00e1m v s\u00edti. Proto je EIGRP mnohem efektivn\u011bj\u0161\u00ed ne\u017e OSPF.<\/p>\n

Pot\u00e9, co si sm\u011brova\u010de vym\u011bn\u00ed bal\u00ed\u010dky aktualizac\u00ed, p\u0159ich\u00e1z\u00ed t\u0159et\u00ed f\u00e1ze \u2013 vytv\u00e1\u0159en\u00ed sm\u011brovac\u00ed tabulky na z\u00e1klad\u011b metriky, kter\u00e1 se po\u010d\u00edt\u00e1 podle vzorce uveden\u00e9ho na obr\u00e1zku. Po\u010d\u00edt\u00e1 n\u00e1klady a na z\u00e1klad\u011b t\u011bchto n\u00e1klad\u016f p\u0159ij\u00edm\u00e1 rozhodnut\u00ed.
\nP\u0159edstavme si, \u017ee R1 poslal Hello sm\u011brova\u010di R2 a ten vr\u00e1til Hello sm\u011brova\u010di R1. Pokud v\u0161echny parametry souhlas\u00ed, sm\u011brova\u010de vytvo\u0159\u00ed tabulku soused\u016f. R2 do t\u00e9to tabulky zapsal z\u00e1znam o sm\u011brova\u010di R1 a R1 vytvo\u0159\u00ed z\u00e1znam o R2. Pot\u00e9 sm\u011brova\u010d R1 ode\u0161le aktualizaci do p\u0159ipojen\u00e9 s\u00edt\u011b 10.1.1.0\/24. V sm\u011brovac\u00ed tabulce to vypad\u00e1 jako informace o IP adrese s\u00edt\u011b, o rozhran\u00ed sm\u011brova\u010de, kter\u00e9 s n\u00ed spojuje, a o n\u00e1kladech na cestu p\u0159es toto rozhran\u00ed. Pokud si pamatujete, n\u00e1klady EIGRP jsou 90 a pot\u00e9 je uvedena hodnota Distance value, o kter\u00e9 budeme mluvit pozd\u011bji. <\/p>\n

\"\u0160kolen\u00ed
\n
\n\u00dapln\u00fd vzorec metriky vypad\u00e1 mnohem slo\u017eit\u011bji, proto\u017ee zahrnuje hodnoty koeficient\u016f K a r\u016fzn\u00e1 p\u0159evody. Na webu Cisco je uvedena kompletn\u00ed podoba vzorce, av\u0161ak pokud provedete dosazen\u00ed z\u00e1kladn\u00edch hodnot koeficient\u016f, p\u0159evede se do jednodu\u0161\u0161\u00ed podoby \u2013 metrika bude rovna (bandwidth + Delay) * 256.<\/p>\n

\"\u0160kolen\u00ed
\n
\nBudeme pou\u017e\u00edvat pr\u00e1v\u011b tento zjednodu\u0161en\u00fd typ vzorce pro v\u00fdpo\u010det metriky, kde propustnost v kilobitech je rovna 107 d\u011bleno nejmen\u0161\u00ed propustnost\u00ed v\u0161ech rozhran\u00ed vedouc\u00edch k c\u00edlov\u00e9 s\u00edti least-bandwidth, a zpo\u017ed\u011bn\u00ed cumulative-delay je celkov\u00e9 zpo\u017ed\u011bn\u00ed v des\u00edtk\u00e1ch mikrosekund na v\u0161ech rozhran\u00edch vedouc\u00edch k c\u00edlov\u00e9 s\u00edti. <\/p>\n

P\u0159i studiu EIGRP se mus\u00edme nau\u010dit \u010dty\u0159i definice: Feasible Distance (mo\u017en\u00e1 vzd\u00e1lenost), Reported Distance (hl\u00e1\u0161en\u00e1 vzd\u00e1lenost), Successor (sousedn\u00ed sm\u011brova\u010d s nejmen\u0161\u00ed n\u00e1klady na cestu k c\u00edlov\u00e9 s\u00edti) a Feasible Successor (z\u00e1lo\u017en\u00ed sousedn\u00ed sm\u011brova\u010d). Abychom pochopili, co to znamen\u00e1, pod\u00edvejme se na n\u00e1sleduj\u00edc\u00ed topologii s\u00edt\u011b. <\/p>\n

\"\u0160kolen\u00ed
\n
\nZa\u010dneme vytvo\u0159en\u00edm sm\u011brovac\u00ed tabulky R1 s c\u00edlem zvolit nejlep\u0161\u00ed cestu k s\u00edti 10.1.1.0\/24. Vedle ka\u017ed\u00e9ho za\u0159\u00edzen\u00ed je uvedena propustnost v kbit\/s a zpo\u017ed\u011bn\u00ed v ms. Pou\u017e\u00edv\u00e1me rozhran\u00ed GigabitEthernet s propustnost\u00ed 100 Mbit\/s, nebo 1000000 kbit\/s, rozhran\u00ed FastEthernet s rychlost\u00ed 100000 kbit\/s, Ethernet s rychlost\u00ed 10000 kbit\/s a s\u00e9riov\u00e9 rozhran\u00ed s rychlost\u00ed 1544 kbit\/s. Tato \u010d\u00edsla m\u016f\u017eete zjistit, pokud se pod\u00edv\u00e1te na nastaven\u00ed sm\u011brova\u010de a vlastnosti odpov\u00eddaj\u00edc\u00edch fyzick\u00fdch rozhran\u00ed.
\nPropustnost s\u00e9riov\u00fdch rozhran\u00ed je ve v\u00fdchoz\u00edm nastaven\u00ed 1544 kbit\/s, a i kdy\u017e m\u00e1te linku 64 kbit\/s, propustnost bude st\u00e1le 1544 kbit\/s. Proto se jako s\u00ed\u0165ov\u00fd administr\u00e1tor mus\u00edte ujistit, \u017ee pou\u017e\u00edv\u00e1te spr\u00e1vnou hodnotu bandwidth. Pro konkr\u00e9tn\u00ed rozhran\u00ed ji m\u016f\u017eete nastavit pomoc\u00ed p\u0159\u00edkazu bandwidth, a pomoc\u00ed p\u0159\u00edkazu delay m\u016f\u017eete zm\u011bnit v\u00fdchoz\u00ed hodnotu zpo\u017ed\u011bn\u00ed. Nemus\u00edte se ob\u00e1vat v\u00fdchoz\u00edch hodnot bandwidth pro rozhran\u00ed GigabitEthernet nebo Ethernet, ale bu\u010fte opatrn\u00ed p\u0159i v\u00fdb\u011bru rychlosti linky, pokud pou\u017e\u00edv\u00e1te s\u00e9riov\u00e9 rozhran\u00ed. <\/p>\n

V\u0161imn\u011bte si, \u017ee na tomto sch\u00e9matu je zpo\u017ed\u011bn\u00ed ozna\u010deno jako v milisekund\u00e1ch ms, ale ve skute\u010dnosti je to mikrosekundy, prost\u011b nem\u00e1m p\u00edsmeno \u03bc pro spr\u00e1vn\u00e9 ozna\u010den\u00ed mikrosekund \u03bcs. <\/p>\n

V\u011bnujte pozornost n\u00e1sleduj\u00edc\u00ed skute\u010dnosti. Pokud zad\u00e1te p\u0159\u00edkaz show interface g0\/0, syst\u00e9m zobraz\u00ed zpo\u017ed\u011bn\u00ed v des\u00edtk\u00e1ch mikrosekund, nikoli pouze v mikrosekund\u00e1ch. <\/p>\n

Podrobn\u011b se t\u00edmto probl\u00e9mem budeme zab\u00fdvat v n\u00e1sleduj\u00edc\u00edm videu v\u011bnovan\u00e9m nastaven\u00ed EIGRP. Zat\u00edm si zapamatujte, \u017ee p\u0159i dosazen\u00ed hodnoty zpo\u017ed\u011bn\u00ed do vzorce 100 \u03bcs se sch\u00e9ma m\u011bn\u00ed na 10, proto\u017ee vzorec pou\u017e\u00edv\u00e1 des\u00edtky mikrosekund, nikoli jednotky. <\/p>\n

Na sch\u00e9matu ozna\u010d\u00edm \u010derven\u00fdmi te\u010dkami rozhran\u00ed, k nim\u017e se vztahuj\u00ed zobrazen\u00e9 propustnosti a zpo\u017ed\u011bn\u00ed. <\/p>\n

\"\u0160kolen\u00ed
\n
\nNejprve mus\u00edme ur\u010dit mo\u017en\u00e9 vzd\u00e1lenosti Feasible Distance. To je metrika FD, kter\u00e1 se po\u010d\u00edt\u00e1 podle vzorce. Pro \u00fasek od R5 k vn\u011bj\u0161\u00ed s\u00edti mus\u00edme vyd\u011blit 107 hodnotou 106 a dostaneme 10. N\u00e1sledn\u011b k t\u00e9to hodnot\u011b bandwidth mus\u00edme p\u0159i\u010d\u00edst zpo\u017ed\u011bn\u00ed, kter\u00e9 je rovno 1, proto\u017ee m\u00e1me 10 mikrosekund, tedy jeden des\u00edtek. V\u00fdsledn\u00e1 hodnota 11 se n\u00e1sob\u00ed 256, tak\u017ee hodnota metriky bude 2816. Toto je hodnota FD pro tento \u00fasek s\u00edt\u011b. <\/p>\n

Tuto hodnotu router R5 ode\u0161le routeru R2, p\u0159i\u010dem\u017e pro R2 se stane ozn\u00e1menou vzd\u00e1lenost\u00ed Reported Distance, tedy hodnotou, kterou mu sd\u011blil soused. T\u00edm p\u00e1dem bude ozn\u00e1men\u00e1 vzd\u00e1lenost RD pro v\u0161echna ostatn\u00ed za\u0159\u00edzen\u00ed rovna mo\u017en\u00e9 vzd\u00e1lenosti FD za\u0159\u00edzen\u00ed, kter\u00e9 v\u00e1m ji sd\u011blilo. <\/p>\n

Router R2 prov\u00e1d\u00ed v\u00fdpo\u010dty FD na z\u00e1klad\u011b sv\u00fdch dat, tedy d\u011bl\u00ed 107 hodnotou 105 a z\u00edsk\u00e1v\u00e1 100. Pot\u00e9 k t\u00e9to hodnot\u011b p\u0159i\u010d\u00edt\u00e1 sou\u010det zpo\u017ed\u011bn\u00ed na cest\u011b k vn\u011bj\u0161\u00ed s\u00edti: zpo\u017ed\u011bn\u00ed R5, kter\u00e9 je rovno jednomu des\u00edtku mikrosekund, a jeho vlastn\u00ed zpo\u017ed\u011bn\u00ed, kter\u00e9 je rovno deseti des\u00edtk\u00e1m. Celkov\u00e9 zpo\u017ed\u011bn\u00ed bude 11 des\u00edtek mikrosekund. P\u0159id\u00e1v\u00e1me ho k z\u00edskan\u00e9 stovce a dost\u00e1v\u00e1me 111, tuto hodnotu n\u00e1sob\u00edme 256 a z\u00edsk\u00e1v\u00e1me FD=28416. Podobn\u011b postupuje router R3 a po proveden\u00fdch v\u00fdpo\u010dtech dost\u00e1v\u00e1 hodnotu FD=281856. Router R4 po\u010d\u00edt\u00e1 hodnotu FD=3072 a p\u0159ed\u00e1v\u00e1 ji R1 jako RD. <\/p>\n

V\u0161imn\u011bte si, \u017ee router R1 p\u0159i v\u00fdpo\u010dtu FD pou\u017e\u00edv\u00e1 ve vzorci nikoli svou propustnost 1000000 kbit\/s, ale ni\u017e\u0161\u00ed propustnost routeru R2, kter\u00e1 je 100000 kbit\/s, proto\u017ee ve vzorci se v\u017edy pou\u017e\u00edv\u00e1 minim\u00e1ln\u00ed propustnost rozhran\u00ed vedouc\u00edho k c\u00edlov\u00e9 s\u00edti. V tomto p\u0159\u00edpad\u011b na cest\u011b k s\u00edti 10.1.1.0\/24 jsou um\u00edst\u011bny routery R2 a R5, ale proto\u017ee propustnost p\u00e1t\u00e9ho routeru je vy\u0161\u0161\u00ed, do vzorce se dosad\u00ed nejni\u017e\u0161\u00ed hodnota propustnosti routeru R2. Celkov\u00e1 latence na cest\u011b R1-R2-R5 je 1+10+1 (des\u00edtky) = 12, uv\u00e1d\u011bn\u00e1 propustnost je 100 a sou\u010det t\u011bchto \u010d\u00edsel, vyn\u00e1soben\u00fd 256, d\u00e1 hodnotu FD=30976. <\/p>\n

Tak\u017ee v\u0161echna za\u0159\u00edzen\u00ed spo\u010d\u00edtala FD sv\u00fdch rozhran\u00ed, a router R1 m\u00e1 3 trasy sm\u011b\u0159uj\u00edc\u00ed k c\u00edlov\u00e9 s\u00edti. To jsou trasy R1-R2, R1-R3 a R1-R4. Router vybere minim\u00e1ln\u00ed hodnotu mo\u017en\u00e9 vzd\u00e1lenosti FD, kter\u00e1 je 30976 \u2013 to je trasa k routeru R2. Tento router se st\u00e1v\u00e1 Successorem, nebo \"n\u00e1sledovn\u00edkem\". V tabulce sm\u011brov\u00e1n\u00ed je tak\u00e9 uveden Feasible Successor (rezervn\u00ed n\u00e1sledovn\u00edk) \u2013 to znamen\u00e1, \u017ee v p\u0159\u00edpad\u011b p\u0159eru\u0161en\u00ed spojen\u00ed mezi R1 a Successorem, bude trasa realizov\u00e1na p\u0159es rezervn\u00ed router Feasible Successor.<\/p>\n

Feasible Successors jsou ur\u010dov\u00e1na podle jedin\u00e9ho pravidla: vyhl\u00e1\u0161en\u00e1 vzd\u00e1lenost RD tohoto sm\u011brova\u010de mus\u00ed b\u00fdt men\u0161\u00ed ne\u017e FD routeru na \u00faseku k Successoru. V na\u0161em p\u0159\u00edpad\u011b R1-R2 m\u00e1 FD=30976, RD na \u00faseku R1-K3 je 281856, a RD na \u00faseku R1-R4 je 3072. Proto\u017ee 3072 < 30976, je jako Feasible Successor vybr\u00e1n router R4. <\/p>\n

To znamen\u00e1, \u017ee p\u0159i p\u0159eru\u0161en\u00ed spojen\u00ed na \u00faseku s\u00edt\u011b R1-R2 bude provoz k s\u00edti 10.1.1.0\/24 sm\u011brov\u00e1n po trase R1-R4-R5. P\u0159epnut\u00ed sm\u011bru p\u0159i pou\u017eit\u00ed RIP trv\u00e1 n\u011bkolik des\u00edtek sekund, p\u0159i pou\u017eit\u00ed OSPF n\u011bkolik sekund, zat\u00edmco v EIGRP nast\u00e1v\u00e1 okam\u017eit\u011b. To je dal\u0161\u00ed v\u00fdhoda EIGRP ve srovn\u00e1n\u00ed s jin\u00fdmi sm\u011brovac\u00edmi protokoly. <\/p>\n

Co se stane, pokud se sou\u010dasn\u011b p\u0159eru\u0161\u00ed spojen\u00ed s Successor a Feasible Successor? V takov\u00e9m p\u0159\u00edpad\u011b EIGRP aktivuje algoritmus DUAL, kter\u00fd m\u016f\u017ee vypo\u010d\u00edtat z\u00e1lo\u017en\u00ed trasu p\u0159es pravd\u011bpodobn\u00e9ho n\u00e1stupce. To m\u016f\u017ee trvat n\u011bkolik sekund, b\u011bhem kter\u00fdch EIGRP najde jin\u00e9ho souseda, kter\u00e9ho lze pou\u017e\u00edt k p\u0159enosu provozu, a um\u00edst\u00ed jeho \u00fadaje do sm\u011brovac\u00ed tabulky. Pot\u00e9 protokol pokra\u010duje v b\u011b\u017en\u00e9 pr\u00e1ci na zaji\u0161t\u011bn\u00ed sm\u011brov\u00e1n\u00ed. <\/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 \u043f\u0440\u043e\u0442\u043e\u043a\u043e\u043b\u0430 EIGRP, \u043a\u043e\u0442\u043e\u0440\u043e\u0435 \u043d\u0430\u0440\u0430\u0432\u043d\u0435 \u0441 \u0438\u0437\u0443\u0447\u0435\u043d\u0438\u0435\u043c OSPF \u044f\u0432\u043b\u044f\u0435\u0442\u0441\u044f \u0432\u0430\u0436\u043d\u0435\u0439\u0448\u0435\u0439 \u0442\u0435\u043c\u043e\u0439 \u043a\u0443\u0440\u0441\u0430 CCNA. \u041f\u043e\u0437\u0436\u0435 \u043c\u044b \u0432\u0435\u0440\u043d\u0435\u043c\u0441\u044f \u043a \u0440\u0430\u0437\u0434\u0435\u043b\u0443 2.5, \u0430 \u0441\u0435\u0439\u0447\u0430\u0441 \u0441\u0440\u0430\u0437\u0443 \u043f\u043e\u0441\u043b\u0435 \u0440\u0430\u0437\u0434\u0435\u043b\u0430 2.4 \u043f\u0435\u0440\u0435\u0439\u0434\u0435\u043c \u043a \u0440\u0430\u0437\u0434\u0435\u043b\u0443 2.6 \u00ab\u041d\u0430\u0441\u0442\u0440\u043e\u0439\u043a\u0430, \u043f\u0440\u043e\u0432\u0435\u0440\u043a\u0430 \u0438 \u0443\u0441\u0442\u0440\u0430\u043d\u0435\u043d\u0438\u0435 \u043d\u0435\u043f\u043e\u043b\u0430\u0434\u043e\u043a EIGRP \u043f\u043e \u043f\u0440\u043e\u0442\u043e\u043a\u043e\u043b\u0443 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, \u043f\u0435\u0440\u0435\u0440\u0430\u0441\u043f\u0440\u0435\u0434\u0435\u043b\u0435\u043d\u0438\u044f \u0438 \u043a\u043e\u043d\u0444\u0438\u0433\u0443\u0440\u0430\u0446\u0438\u0438 stub)\u00bb. \u0421\u0435\u0433\u043e\u0434\u043d\u044f \u0443 \u043d\u0430\u0441 \u0431\u0443\u0434\u0435\u0442 […]<\/p>\n","protected":false,"gt_translate_keys":[{"key":"rendered","format":"html"}]},"author":1,"featured_media":28820,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[688],"tags":[],"class_list":["post-38396","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\udd47Tr\u00e9nink Cisco 200-125 CCNA v3.0. Den 49. \u00davod do EIGRP | ProHoster","description":"Dnes za\u010dneme studovat protokol EIGRP, kter\u00fd je d\u016fle\u017eit\u00fdm t\u00e9matem kurzu CCNA, stejn\u011b jako studium OSPF.","canonical_url":"https:\/\/prohoster.info\/cs\/blog\/administrirovanie\/trening-cisco-200-125-ccna-v3-0-den-49-vvedenie-v-eigrp","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 49. \u0412\u0432\u0435\u0434\u0435\u043d\u0438\u0435 \u0432 EIGRP | 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 \u043f\u0440\u043e\u0442\u043e\u043a\u043e\u043b\u0430 EIGRP, \u043a\u043e\u0442\u043e\u0440\u043e\u0435 \u043d\u0430\u0440\u0430\u0432\u043d\u0435 \u0441 \u0438\u0437\u0443\u0447\u0435\u043d\u0438\u0435\u043c OSPF \u044f\u0432\u043b\u044f\u0435\u0442\u0441\u044f \u0432\u0430\u0436\u043d\u0435\u0439\u0448\u0435\u0439 \u0442\u0435\u043c\u043e\u0439 \u043a\u0443\u0440\u0441\u0430 CCNA.","og:url":"https:\/\/prohoster.info\/cs\/blog\/administrirovanie\/trening-cisco-200-125-ccna-v3-0-den-49-vvedenie-v-eigrp","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:30+00:00","article:modified_time":"2019-10-31T19:23:30+00:00","article:publisher":"https:\/\/www.facebook.com\/prohoster","article:author":"https:\/\/www.facebook.com\/prohoster"},"aioseo_meta_data":{"post_id":"38396","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:52:20","breadcrumb_settings":null,"limit_modified_date":false,"reviewed_by":null,"ai":null,"created":"2021-03-01 01:10:22","updated":"2026-01-23 21:52:20","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\/38396","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=38396"}],"version-history":[{"count":0,"href":"https:\/\/prohoster.info\/cs\/wp-json\/wp\/v2\/posts\/38396\/revisions"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/prohoster.info\/cs\/wp-json\/wp\/v2\/media\/28820"}],"wp:attachment":[{"href":"https:\/\/prohoster.info\/cs\/wp-json\/wp\/v2\/media?parent=38396"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/prohoster.info\/cs\/wp-json\/wp\/v2\/categories?post=38396"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/prohoster.info\/cs\/wp-json\/wp\/v2\/tags?post=38396"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}