{"id":93710,"date":"2020-09-09T07:42:42","date_gmt":"2020-09-09T05:42:42","guid":{"rendered":"https:\/\/prohoster.info\/blog\/administrirovanie\/politiki-hraneniya-veeam-br-rasputyvaem-bekapnye-czepi-vmeste-s-tehpodderzhkoj"},"modified":"2020-09-09T07:42:42","modified_gmt":"2020-09-09T05:42:42","slug":"politiki-hraneniya-veeam-br-rasputyvaem-bekapnye-czepi-vmeste-s-tehpodderzhkoj","status":"publish","type":"post","link":"https:\/\/prohoster.info\/cs\/blog\/administrirovanie\/politiki-hraneniya-veeam-br-rasputyvaem-bekapnye-czepi-vmeste-s-tehpodderzhkoj","title":{"rendered":"Politiky uchov\u00e1v\u00e1n\u00ed Veeam B&R \u2014 rozmot\u00e1v\u00e1me z\u00e1lohovac\u00ed \u0159et\u011bzce spole\u010dn\u011b s technickou podporou","gt_translate_keys":[{"key":"rendered","format":"text"}]},"content":{"rendered":"

V\u00edt\u00e1m \u010dten\u00e1\u0159e na\u0161eho blogu! \u010c\u00e1ste\u010dn\u011b se u\u017e zn\u00e1me \u2013 moje anglick\u00e9 p\u0159\u00edsp\u011bvky se zde objevovaly v p\u0159ekladu m\u00e9 drah\u00e9 kolegyn\u011b polarowl<\/a><\/noindex>. Tentokr\u00e1t jsem se rozhodl obr\u00e1tit p\u0159\u00edmo na rusky mluv\u00edc\u00ed publikum. <\/p>\n

Pro sv\u016fj debut jsem cht\u011bl naj\u00edt t\u00e9ma, kter\u00e9 by zaj\u00edmalo co nej\u0161ir\u0161\u00ed publikum a vy\u017eadovalo podrobn\u00e9 prozkoum\u00e1n\u00ed. Daniel Defoe tvrdil, \u017ee ka\u017ed\u00e9ho \u010dlov\u011bka \u010dekaj\u00ed smrt a dan\u011b. Za sebe mohu \u0159\u00edct, \u017ee ka\u017ed\u00e9ho podp\u016frn\u00e9ho in\u017een\u00fdra \u010dekaj\u00ed ot\u00e1zky o politik\u00e1ch uchov\u00e1v\u00e1n\u00ed bod\u016f obnoven\u00ed (nebo jednodu\u0161e \u2013 retenci). Jak funguje retence, jsem za\u010dal vysv\u011btlovat p\u0159ed 4 lety, kdy\u017e jsem byl juniorsk\u00fdm in\u017een\u00fdrem prvn\u00edho stupn\u011b, a st\u00e1le to vysv\u011btluji nyn\u00ed, u\u017e jako t\u00fdmov\u00fd l\u00eddr \u0161pan\u011blsky a italsky mluv\u00edc\u00edho t\u00fdmu. Jsem si jist\u00fd, \u017ee moji kolegov\u00e9 druh\u00e9 a dokonce i t\u0159et\u00ed \u00farovn\u011b podpory tak\u00e9 pravideln\u011b odpov\u00eddaj\u00ed na stejn\u00e9 ot\u00e1zky. <\/p>\n

V tomto sv\u011btle jsem cht\u011bl napsat kone\u010dn\u00fd, co nejpodrobn\u011bj\u0161\u00ed p\u0159\u00edsp\u011bvek, ke kter\u00e9mu by se rusky mluv\u00edc\u00ed u\u017eivatel\u00e9 mohli vracet znovu a znovu jako k p\u0159\u00edru\u010dce. Okam\u017eik je vhodn\u00fd \u2013 ned\u00e1vno vydan\u00e1 jubilejn\u00ed des\u00e1t\u00e1 verze p\u0159idala nov\u00e9 mo\u017enosti k z\u00e1kladn\u00edmu funk\u010dn\u00edmu celku, kter\u00fd se roky nem\u011bnil. M\u016fj p\u0159\u00edsp\u011bvek je orientov\u00e1n p\u0159edev\u0161\u00edm na tuto verzi \u2014 i kdy\u017e v\u011bt\u0161ina napsan\u00e9ho plat\u00ed i pro p\u0159edchoz\u00ed verze, n\u011bco z popisovan\u00e9ho funk\u010dn\u00edho celku tam prost\u011b nenajdete. Nakonec, malinko nahl\u00e9dnu do budoucnosti a \u0159eknu, \u017ee v dal\u0161\u00ed verzi se o\u010dek\u00e1vaj\u00ed n\u011bkter\u00e9 zm\u011bny, ale o tom budeme mluvit, a\u017e p\u0159ijde \u010das. Tak\u017ee, poj\u010fme na to.<\/p>\n

\"Politiky
\n<\/a><\/noindex><\/p>\n

\u00dakoly z\u00e1lohov\u00e1n\u00ed (Backup job)<\/h2>\n

\nNejprve se pod\u00edvejme na tu \u010d\u00e1st, kter\u00e1 se ve verzi 10 nezm\u011bnila. Politika retence je definov\u00e1na n\u011bkolika parametry. Otev\u0159eme okno pro vytvo\u0159en\u00ed nov\u00e9ho \u00fakolu a p\u0159ejdeme na kartu Storage. Zde uvid\u00edme parametr, kter\u00fd ur\u010duje po\u017eadovan\u00fd po\u010det bod\u016f obnoven\u00ed:<\/p>\n

\"Politiky
\n
\nTo v\u0161ak je jen \u010d\u00e1st rovnice. Skute\u010dn\u00fd po\u010det bod\u016f je tak\u00e9 ur\u010den re\u017eimem z\u00e1lohy nastaven\u00fdm pro \u00fakol. Pro v\u00fdb\u011br tohoto parametru je t\u0159eba kliknout na tla\u010d\u00edtko Advanced na stejn\u00e9 kart\u011b. To otev\u0159e nov\u00e9 okno s mnoha mo\u017enostmi. \u010c\u00edslujeme je a prozkoum\u00e1me po jednom:<\/p>\n

\"Politiky
\n
\nPokud aktivujete pouze mo\u017enost 1, \u00faloha bude pracovat v re\u017eimu \"nekone\u010dn\u00e9 inkrementace\" (forever forward incremental). Nebudou s t\u00edm \u017e\u00e1dn\u00e9 pot\u00ed\u017ee \u2013 \u00faloha si uchov\u00e1v\u00e1 stanoven\u00fd po\u010det bod\u016f obnoven\u00ed od kompletn\u00edho z\u00e1lohov\u00e1n\u00ed (soubor s p\u0159\u00edponou VBK) po posledn\u00ed inkrement (soubor s p\u0159\u00edponou VIB). Jakmile po\u010det bod\u016f p\u0159ekro\u010d\u00ed stanovenou hodnotu, nejstar\u0161\u00ed inkrement bude slou\u010den s kompletn\u00edm z\u00e1lohov\u00e1n\u00edm. Jin\u00fdmi slovy, pokud je \u00faloha nastavena na uchov\u00e1v\u00e1n\u00ed 3 bod\u016f, ihned po dal\u0161\u00ed relaci budou na \u00falo\u017ei\u0161ti 4 body, po \u010dem\u017e bude kompletn\u00ed z\u00e1lohov\u00e1n\u00ed slou\u010deno s nejstar\u0161\u00edm inkrementem a celkov\u00fd po\u010det bod\u016f se vr\u00e1t\u00ed na 3. <\/p>\n

\"Politiky
\n
\nTak\u00e9 je velmi jednoduch\u00e9 spravovat retenci pro re\u017eim \"zp\u011btn\u00e9 inkrementace\" (reverse incremental) (mo\u017enost 2). V tomto p\u0159\u00edpad\u011b bude nejnov\u011bj\u0161\u00ed bod kompletn\u00edm z\u00e1lohov\u00e1n\u00edm, za kter\u00fdm bude n\u00e1sledovat \u0159et\u011bzec takzvan\u00fdch rollback\u016f (soubor\u016f s p\u0159\u00edponou VRB), tak\u017ee pro aplikaci retence sta\u010d\u00ed jednodu\u0161e odstranit nejstar\u0161\u00ed rollback. Situace bude stejn\u00e1: ihned po relaci po\u010det bod\u016f p\u0159ekro\u010d\u00ed stanovenou hodnotu o 1, po \u010dem\u017e se vr\u00e1t\u00ed na po\u017eadovanou hodnotu.<\/p>\n

\"Politiky
\n
\nM\u011bjte na pam\u011bti, \u017ee s re\u017eimem zp\u011btn\u00e9 inkrementace lze tak\u00e9 aktivovat periodick\u00e9 kompletn\u00ed z\u00e1lohov\u00e1n\u00ed (mo\u017enost 4), ale to na podstat\u011b nic nem\u011bn\u00ed. Ano, v \u0159et\u011bzci se objev\u00ed kompletn\u00ed body obnoven\u00ed, ale v\u017edy jednodu\u0161e odstran\u00edme ty nejstar\u0161\u00ed body jeden po druh\u00e9m. <\/p>\n

Nakonec se dost\u00e1v\u00e1me k zaj\u00edmav\u00e9 \u010d\u00e1sti. Pokud aktivujete inkrement\u00e1ln\u00ed z\u00e1lohov\u00e1n\u00ed, ale nav\u00edc zapnete mo\u017enosti 3 nebo 4 (nebo ob\u011b najednou), \u00faloha za\u010dne vytv\u00e1\u0159et periodick\u00e1 kompletn\u00ed z\u00e1lohov\u00e1n\u00ed \"aktivn\u00ed\" nebo syntetickou metodou. Zp\u016fsob vytvo\u0159en\u00ed kompletn\u00edho z\u00e1lohov\u00e1n\u00ed nen\u00ed d\u016fle\u017eit\u00fd \u2013 bude obsahovat ta sam\u00e1 data, a inkrement\u00e1ln\u00ed \u0159et\u011bzec bude rozd\u011blen na \"pod\u0159et\u011bzce\". Tento zp\u016fsob se naz\u00fdv\u00e1 forward incremental a pr\u00e1v\u011b on vyvol\u00e1v\u00e1 zna\u010dnou \u010d\u00e1st ot\u00e1zek na\u0161ich z\u00e1kazn\u00edk\u016f. <\/p>\n

Retention here is applied by removing the oldest part of the chain (from a full backup to increments). In this case, we will not remove just the empty backup or just part of the increments. The entire \"subchain\" is deleted completely at once. The meaning of the setting for the number of points changes \u2013 if in other methods it is the maximum allowed number after which retention needs to be applied, here this setting determines the minimum number. In other words, after the oldest \"subchain\" is deleted, the number of points in the remaining part should not fall below this minimum. <\/p>\n

I will try to illustrate this concept graphically. Suppose retention is set to 3 points, and the task runs every day with a full backup on Monday. Retention will be applied in this case when the total number of points reaches 10:<\/p>\n

\"Politiky
\n
\nWhy 10 when we've set 3? A full backup was created on Monday. From Tuesday to Sunday, the task created increments. Finally, the next Monday, a full backup is created again, and only when 2 increments have been created can the entire old part of the chain be deleted because the remaining number of points will not drop below the established 3. <\/p>\n

If the idea is clear, I suggest you try to calculate retention yourself. Let\u2019s take the following conditions: the task runs for the first time on Thursday (naturally, a full backup will be made). The task is set to create full backups on Wednesdays and Sundays, retaining 8 recovery points. When will retention be applied for the first time?<\/p>\n

To answer this question, I recommend you take a piece of paper, draw it by the days of the week, and write down which point is created each day. The answer will become obvious.<\/p>\n

Odpov\u011b\u010f<\/b>
\n \"Politiky
\nExplanation: to answer, it is enough to ask yourself \"when will retention be applied\"? The answer is when we can delete the first 3 points (VBK, VIB, VIB) and the remaining chain does not fall below the required 8 points. It becomes clear that we can do this when we have a total of 11 points, that is, on the Sunday of the second week. <\/p>\n

Some readers may object: \"why all this, if there is rps.dewin.me<\/a><\/noindex>?\u00bb. \u0411\u0435\u0437 \u0441\u043e\u043c\u043d\u0435\u043d\u0438\u044f, \u044d\u0442\u043e \u043e\u0447\u0435\u043d\u044c \u043f\u043e\u043b\u0435\u0437\u043d\u044b\u0439 \u0438\u043d\u0441\u0442\u0440\u0443\u043c\u0435\u043d\u0442, \u0438 \u0432 \u043d\u0435\u043a\u043e\u0442\u043e\u0440\u044b\u0445 \u0441\u043b\u0443\u0447\u0430\u044f\u0445 \u044f \u0431\u044b \u043f\u0440\u0438\u043c\u0435\u043d\u044f\u043b \u0438\u043c\u0435\u043d\u043d\u043e \u0435\u0433\u043e, \u043d\u043e \u0435\u0441\u0442\u044c \u0443 \u043d\u0435\u0433\u043e \u0438 \u043e\u0433\u0440\u0430\u043d\u0438\u0447\u0435\u043d\u0438\u044f. \u041f\u0440\u0435\u0436\u0434\u0435 \u0432\u0441\u0435\u0433\u043e, \u043e\u043d \u043d\u0435 \u043f\u043e\u0437\u0432\u043e\u043b\u044f\u0435\u0442 \u0443\u043a\u0430\u0437\u0430\u0442\u044c \u043d\u0430\u0447\u0430\u043b\u044c\u043d\u044b\u0435 \u0443\u0441\u043b\u043e\u0432\u0438\u044f, \u0430 \u0432\u043e \u043c\u043d\u043e\u0433\u0438\u0445 \u0441\u043b\u0443\u0447\u0430\u044f\u0445 \u0441\u043b\u0443\u0447\u0430\u0435\u0432 \u0432\u043e\u043f\u0440\u043e\u0441 \u0437\u0432\u0443\u0447\u0438\u0442 \u0438\u043c\u0435\u043d\u043d\u043e \u00ab\u0443 \u043d\u0430\u0441 \u0435\u0441\u0442\u044c \u0442\u0430\u043a\u0430\u044f \u0446\u0435\u043f\u043e\u0447\u043a\u0430, \u0447\u0442\u043e \u0431\u0443\u0434\u0435\u0442, \u0435\u0441\u043b\u0438 \u0438\u0437\u043c\u0435\u043d\u0438\u0442\u044c \u0442\u0430\u043a\u0438\u0435-\u0442\u043e \u043d\u0430\u0441\u0442\u0440\u043e\u0439\u043a\u0438?\u00bb. \u0412\u043e-\u0432\u0442\u043e\u0440\u044b\u0445, \u0438\u043d\u0441\u0442\u0440\u0443\u043c\u0435\u043d\u0442\u0443 \u0432\u0441\u0435-\u0442\u0430\u043a\u0438 \u043d\u0435\u0441\u043a\u043e\u043b\u044c\u043a\u043e \u043d\u0435 \u0445\u0432\u0430\u0442\u0430\u0435\u0442 \u043d\u0430\u0433\u043b\u044f\u0434\u043d\u043e\u0441\u0442\u0438. \u041f\u043e\u043a\u0430\u0437\u044b\u0432\u0430\u044f \u0441\u0442\u0440\u0430\u043d\u0438\u0447\u043a\u0443 RPS \u043a\u043b\u0438\u0435\u043d\u0442\u0430\u043c, \u044f \u043d\u0435 \u043d\u0430\u0445\u043e\u0434\u0438\u043b \u043f\u043e\u043d\u0438\u043c\u0430\u043d\u0438\u044f, \u0430 \u0432\u043e\u0442 \u0440\u0430\u0441\u043f\u0438\u0441\u0430\u0432 \u0435\u0435 \u043a\u0430\u043a \u0432 \u043f\u0440\u0438\u043c\u0435\u0440\u0435 (\u0434\u0430\u0436\u0435 \u0438\u0441\u043f\u043e\u043b\u044c\u0437\u0443\u044f \u0442\u043e\u0442 \u0436\u0435 Paint), \u0434\u0435\u043d\u044c \u0437\u0430 \u0434\u043d\u0435\u043c, \u0432\u0441\u0435 \u0441\u0442\u0430\u043d\u043e\u0432\u0438\u043b\u043e\u0441\u044c \u044f\u0441\u043d\u043e. <\/p>\n

Nakonec jsme se nezab\u00fdvali mo\u017enost\u00ed \u201eTransformovat p\u0159edchoz\u00ed z\u00e1lohovac\u00ed \u0159et\u011bzce na n\u00e1vraty\u201c (ozna\u010denou \u010d\u00edslem 5). Tato mo\u017enost n\u011bkdy mate z\u00e1kazn\u00edky, kte\u0159\u00ed ji aktivuj\u00ed \u201eautomaticky\u201c, cht\u011bj\u00ed jen zahrnout syntetickou z\u00e1lohu. Mezit\u00edm tato mo\u017enost aktivuje zcela zvl\u00e1\u0161tn\u00ed re\u017eim z\u00e1lohov\u00e1n\u00ed. Ani\u017e bychom zach\u00e1zeli do podrobnost\u00ed, ihned \u0159eknu, \u017ee v tomto st\u00e1diu v\u00fdvoje produktu je \u201eTransformovat p\u0159edchoz\u00ed z\u00e1lohovac\u00ed \u0159et\u011bzce na n\u00e1vraty\u201c zastaral\u00e1 volba a nedok\u00e1\u017eu si p\u0159edstavit ani jeden sc\u00e9n\u00e1\u0159, kdy by se m\u011bla pou\u017e\u00edvat. Jej\u00ed hodnota je tak pochybn\u011b mal\u00e1, \u017ee n\u011bjakou dobu s\u00e1m Anton Gostevi vyz\u00fdval prost\u0159ednictv\u00edm f\u00f3ra, aby mu poslali p\u0159\u00edklady jej\u00edho u\u017eite\u010dn\u00e9ho pou\u017eit\u00ed (pokud n\u011bjak\u00e9 m\u00e1te, napi\u0161te do koment\u00e1\u0159\u016f, velmi m\u011b to zaj\u00edm\u00e1). Pokud se \u017e\u00e1dn\u00e9 nenajdou (mysl\u00edm, \u017ee to tak bude), tak bude mo\u017enost odstran\u011bna v dal\u0161\u00edch verz\u00edch. <\/p>\n

\u00dakol bude vytv\u00e1\u0159et inkrementy (VIB) a\u017e do dne, kdy je pl\u00e1nov\u00e1na syntetick\u00e1 kompletn\u00ed z\u00e1loha. V tento den se skute\u010dn\u011b vytv\u00e1\u0159\u00ed VBK, ale v\u0161echny body p\u0159ed t\u00edmto VBK se transformuj\u00ed na n\u00e1vraty (VRB). Pot\u00e9 \u00fakol bude pokra\u010dovat v vytv\u00e1\u0159en\u00ed inkrement\u016f k pln\u00e9 z\u00e1loze a\u017e do dal\u0161\u00ed syntetick\u00e9 z\u00e1lohy. Nakonec se v \u0159et\u011bzci vytvo\u0159\u00ed sm\u011bsice z VBK, VBR a VIB soubor\u016f. Reten\u010dn\u00ed pravidlo se pak aplikuje velmi jednodu\u0161e \u2013 odstran\u011bn\u00edm posledn\u00edho VBR:<\/p>\n

\"Politiky
\n<\/p>\n

Probl\u00e9my<\/h3>\n

\nKrom\u011b samotn\u00e9ho pochopen\u00ed, jak to funguje, v\u011bt\u0161ina probl\u00e9m\u016f, kter\u00e9 nastanou p\u0159i pou\u017e\u00edv\u00e1n\u00ed inkrement\u00e1ln\u00edho re\u017eimu, obvykle souvis\u00ed s \u00faplnou z\u00e1lohou. Pravideln\u00e1 \u00fapln\u00e1 z\u00e1loha je pro tento re\u017eim nezbytn\u00e1, jinak bude \u00falo\u017ei\u0161t\u011b shroma\u017e\u010fovat body, dokud nep\u0159epln\u00ed. <\/p>\n

Nap\u0159\u00edklad, \u00fapln\u00e1 z\u00e1loha m\u016f\u017ee b\u00fdt vytv\u00e1\u0159ena p\u0159\u00edli\u0161 z\u0159\u00eddka. \u0158ekn\u011bme, \u017ee je \u00fakol nastaven na ulo\u017een\u00ed 10 bod\u016f, zat\u00edmco \u00fapln\u00e1 z\u00e1loha je vytv\u00e1\u0159ena jednou za m\u011bs\u00edc. Je jasn\u00e9, \u017ee skute\u010dn\u00fd po\u010det bod\u016f zde bude v\u00fdrazn\u011b vy\u0161\u0161\u00ed, ne\u017e je nastavena hodnota. Nebo je \u00fakol nastaven na pr\u00e1ci v nekone\u010dn\u011b inkrement\u00e1ln\u00edm re\u017eimu a uchov\u00e1n\u00ed 50 bod\u016f. Pak n\u011bkdo n\u00e1hodou vytvo\u0159il \u00faplnou z\u00e1lohu. V\u0161echno, od nyn\u011bj\u0161ka \u00fakol \u010dek\u00e1, a\u017e pln\u00fd bod shrom\u00e1\u017ed\u00ed 49 inkrement\u016f, pot\u00e9 aplikuje reten\u010dn\u00ed pravidlo a vr\u00e1t\u00ed se do nekone\u010dn\u011b pln\u00e9ho re\u017eimu.<\/p>\n

Jindy se pln\u00fd z\u00e1lohov\u00e1n\u00ed nastavuje na pravidelnou \u00fadr\u017ebu, ale z n\u011bjak\u00e9ho d\u016fvodu se to ned\u011bje. Zde pop\u00ed\u0161u nejv\u00edce roz\u0161\u00ed\u0159enou p\u0159\u00ed\u010dinu. N\u011bkte\u0159\u00ed klienti d\u00e1vaj\u00ed p\u0159ednost pou\u017e\u00edv\u00e1n\u00ed mo\u017enosti pl\u00e1nov\u00e1n\u00ed \u201eb\u011b\u017eet po\u201c a nastavuj\u00ed \u00fakoly tak, aby pracovaly ve vedlej\u0161\u00edch sekvenc\u00edch. Vezm\u011bme takov\u00fd p\u0159\u00edklad: existuj\u00ed 3 \u00fakoly, kter\u00e9 prob\u00edhaj\u00ed ka\u017ed\u00fd den a vytv\u00e1\u0159ej\u00ed plnou z\u00e1lohu v ned\u011bli. Prvn\u00ed \u00fakol se spou\u0161t\u00ed v 22:30, ostatn\u00ed se spou\u0161t\u011bj\u00ed po \u0159et\u011bzu. Inkrement\u00e1ln\u00ed z\u00e1loha trv\u00e1 10 minut, a proto do 23:00 v\u0161echny \u00fakoly kon\u010d\u00ed. Ale pln\u00e1 z\u00e1loha trv\u00e1 hodinu, a proto v ned\u011bli nast\u00e1v\u00e1 n\u00e1sleduj\u00edc\u00ed: prvn\u00ed \u00fakol pracuje od 22:30 do 23:30. N\u00e1sleduj\u00edc\u00ed od 23:30 do 00:30. A t\u0159et\u00ed \u00fakol se u\u017e spou\u0161t\u00ed v pond\u011bl\u00ed. Pln\u00e1 z\u00e1loha je nastavena na ned\u011bli, tak\u017ee v tom p\u0159\u00edpad\u011b jednodu\u0161e nebude. \u00dakol bude \u010dekat na plnou z\u00e1lohu, aby mohl aplikovat retenci. Proto bu\u010fte opatrn\u00ed p\u0159i pou\u017e\u00edv\u00e1n\u00ed mo\u017enosti \u201eb\u011b\u017eet po\u201c nebo ji v\u016fbec nepou\u017e\u00edvejte \u2013 nastavte \u00fakoly, aby se spou\u0161t\u011bly ve stejnou dobu, a nechte pl\u00e1nova\u010d zdroj\u016f d\u011blat svou pr\u00e1ci. <\/p>\n

Slo\u017eit\u00e1 mo\u017enost \u201eOdebrat smazan\u00e9 polo\u017eky\u201c<\/h2>\n

\nP\u0159i proch\u00e1zen\u00ed nastaven\u00ed \u00fakolu \u00dalo\u017ei\u0161t\u011b \u2013 Pokro\u010dil\u00e9 \u2013 \u00dadr\u017eba, m\u016f\u017eete narazit na mo\u017enost \u201eodebrat data smazan\u00fdch polo\u017eek po\u201c, m\u011b\u0159enou v dnech. <\/p>\n

\"Politiky
\n
\nN\u011bkte\u0159\u00ed klienti o\u010dek\u00e1vaj\u00ed, \u017ee to je retence. Ve skute\u010dnosti je to zcela samostatn\u00e1 mo\u017enost, jej\u00ed\u017e nepochopen\u00ed m\u016f\u017ee v\u00e9st k neo\u010dek\u00e1van\u00fdm d\u016fsledk\u016fm. Nicm\u00e9n\u011b nejprve je t\u0159eba vysv\u011btlit, jak B&R reaguje na situace, kdy b\u011bhem sezen\u00ed \u00fasp\u011b\u0161n\u011b z\u00e1lohuj\u00ed pouze n\u011bkter\u00e9 stroje. <\/p>\n

P\u0159edstavme si takov\u00fd sc\u00e9n\u00e1\u0159: nekone\u010dn\u011b inkrement\u00e1ln\u00ed \u00fakol, nastaven\u00fd na uchov\u00e1n\u00ed 6 bod\u016f. V \u00fakolu jsou 2 stroje, jeden se v\u017edy \u00fasp\u011b\u0161n\u011b z\u00e1lohoval, zat\u00edmco druh\u00fd ob\u010das selhal. V d\u016fsledku toho se k sedm\u00e9mu bodu vytvo\u0159ila takov\u00e1 situace:<\/p>\n

\"Politiky
\n
\nJe \u010das aplikovat retenci, ale na jednom stroji je 7 bod\u016f, zat\u00edmco na druh\u00e9m pouze 4. Bude zde aplikov\u00e1na retence? Odpov\u011b\u010f zn\u00ed \u2013 ano, bude. Pokud byl alespo\u0148 jeden objekt z\u00e1lohov\u00e1n, B&R pova\u017euje, \u017ee bod byl vytvo\u0159en. <\/p>\n

Podobn\u00e1 situace m\u016f\u017ee nastat, pokud byla n\u011bjak\u00e1 ma\u0161ina jednodu\u0161e vylou\u010dena z \u00fakolu b\u011bhem ur\u010dit\u00e9 relace. K tomu doch\u00e1z\u00ed nap\u0159\u00edklad, kdy\u017e jsou ma\u0161iny do \u00fakolu p\u0159id\u00e1v\u00e1ny nikoli individu\u00e1ln\u011b, ale v r\u00e1mci kontejner\u016f (slo\u017eek, \u00falo\u017ei\u0161\u0165) a n\u011bjak\u00e1 ma\u0161ina do\u010dasn\u011b migruje do jin\u00e9ho kontejneru. \u00dakol bude v takov\u00e9m p\u0159\u00edpad\u011b pova\u017eov\u00e1n za \u00fasp\u011b\u0161n\u00fd, ale ve statistik\u00e1ch najdete zpr\u00e1vu, kter\u00e1 v\u00e1s vyz\u00fdv\u00e1, abyste si uv\u011bdomili, \u017ee tato ma\u0161ina ji\u017e nen\u00ed \u00fakolem zpracov\u00e1v\u00e1na. <\/p>\n

\"Politiky
\n
\nCo se stane, pokud na to nebudete br\u00e1t z\u0159etel? V p\u0159\u00edpad\u011b nekone\u010dn\u011b inkrement\u00e1ln\u00edho nebo obr\u00e1cen\u011b inkrement\u00e1ln\u00edho re\u017eimu se po\u010det bod\u016f obnoven\u00ed \"probl\u00e9mov\u00e9\" ma\u0161iny bude s ka\u017edou relac\u00ed sni\u017eovat, dokud nedos\u00e1hne 1, ulo\u017een\u00e9 ve VBK. Jin\u00fdmi slovy, i kdy\u017e ma\u0161ina dlouho nebude z\u00e1lohov\u00e1na, jeden bod obnoven\u00ed p\u0159esto z\u016fstane. Situace je jin\u00e1, pokud jsou povoleny pravideln\u00e9 celkov\u00e9 z\u00e1lohy. Pokud ignorujete sign\u00e1ly od B&R, nakonec m\u016f\u017ee b\u00fdt posledn\u00ed bod odstran\u011bn spolu se starou \u010d\u00e1st\u00ed \u0159et\u011bzce. <\/p>\n

Pochopen\u00edm t\u011bchto detail\u016f lze kone\u010dn\u011b zv\u00e1\u017eit mo\u017enost \u201eOdstranit data smazan\u00fdch polo\u017eek po\u201c. Tato volba odstran\u00ed v\u0161echny body pro konkr\u00e9tn\u00ed ma\u0161inu, pokud tato ma\u0161ina nen\u00ed z\u00e1lohov\u00e1na po dobu X dn\u016f. V\u0161imn\u011bte si, \u017ee tato nastaven\u00ed nereaguj\u00ed na chyby (vyzkou\u0161eli jsme \u2013 nefungovalo to). Nem\u011bla by prob\u011bhnout ani pokus o z\u00e1lohu ma\u0161iny. Zd\u00e1 se, \u017ee je tato volba u\u017eite\u010dn\u00e1 a m\u011bla by b\u00fdt v\u017edy zapnut\u00e1. Pokud spr\u00e1vce odstranil ma\u0161inu z \u00fakolu, je logick\u00e9 po n\u011bjak\u00e9 dob\u011b vy\u010distit nepot\u0159ebn\u00e1 data a \u0159et\u011bzec. Nicm\u00e9n\u011b tato nastaven\u00ed vy\u017eaduj\u00ed discipl\u00ednu a pozornost.<\/p>\n

Uvedu p\u0159\u00edklad z praxe: do \u00fakolu bylo p\u0159id\u00e1no n\u011bkolik kontejner\u016f, jejich\u017e slo\u017een\u00ed bylo pom\u011brn\u011b dynamick\u00e9. V d\u016fsledku nedostatku RAM m\u011bl B&R server probl\u00e9my, kter\u00e9 z\u016fstaly bez pov\u0161imnut\u00ed. \u00dakol byl spu\u0161t\u011bn a pokusil se prov\u00e9st z\u00e1lohu stroj\u016f, s v\u00fdjimkou jednoho, kter\u00fd v t\u00e9 dob\u011b v kontejneru nebyl. Proto\u017ee mnoh\u00e9 stroje vyk\u00e1zaly chyby, m\u011bl B&R podle defaultn\u00edho nastaven\u00ed prov\u00e9st 3 dal\u0161\u00ed pokusy o z\u00e1lohu <\/p>\n

V t\u00e9to souvislosti mohu \u0159\u00edci n\u00e1sleduj\u00edc\u00ed: pokud m\u00e1te nastaven\u00e9 notifikace ohledn\u011b v\u00fdsledk\u016f \u00fakol\u016f, a je\u0161t\u011b l\u00e9pe \u2014 pokud pou\u017e\u00edv\u00e1te integraci s Veeam ONE, je velmi pravd\u011bpodobn\u00e9, \u017ee se v\u00e1m to nestane. Pokud se ale na B&R server pod\u00edv\u00e1te jednou t\u00fddn\u011b, abyste zkontrolovali, \u017ee v\u0161e funguje, doporu\u010duji se vzd\u00e1t mo\u017enost\u00ed, kter\u00e9 potenci\u00e1ln\u011b mohou v\u00e9st k odstran\u011bn\u00ed z\u00e1loh. <\/p>\n

Co se p\u0159idalo ve verzi 10<\/h2>\n

\nTo, o \u010dem jsme hovo\u0159ili d\u0159\u00edve, existovalo v B&R po mnoho verz\u00ed. Ujasn\u011bn\u00edm t\u011bchto pracovn\u00edch princip\u016f se nyn\u00ed pod\u00edvejme, co bylo p\u0159id\u00e1no v jubilejn\u00ed \"des\u00edtce\". <\/p>\n

Denn\u00ed uchov\u00e1v\u00e1n\u00ed<\/h3>\n

\nShora jsme zkoumali \"klasickou\" politiku uchov\u00e1v\u00e1n\u00ed, zalo\u017eenou na po\u010dtu bod\u016f. Alternativn\u00ed p\u0159\u00edstup - nastavit v tomt\u00e9\u017e menu \"dny\" m\u00edsto \"bod\u016f pro obnoven\u00ed\". <\/p>\n

\"Politiky
\n
\nMy\u0161lenka je jasn\u00e1 z n\u00e1zvu \u2013 uchov\u00e1v\u00e1n\u00ed bude m\u00edt nastaven\u00fd po\u010det dn\u016f, p\u0159i\u010dem\u017e po\u010det bod\u016f v ka\u017ed\u00e9m dni nen\u00ed d\u016fle\u017eit\u00fd. P\u0159i tom je pot\u0159eba m\u00edt na pam\u011bti n\u00e1sleduj\u00edc\u00ed:<\/p>\n