{"id":32477,"date":"2019-10-31T21:47:17","date_gmt":"2019-10-31T18:47:17","guid":{"rendered":"https:\/\/prohoster.info\/blog\/rezervnoe-kopirovanie-chast-1-naznachenie-obzor-metodov-i-tehnologij\/"},"modified":"2019-10-31T21:47:17","modified_gmt":"2019-10-31T18:47:17","slug":"rezervnoe-kopirovanie-chast-1-naznachenie-obzor-metodov-i-tehnologij","status":"publish","type":"post","link":"https:\/\/prohoster.info\/ro\/blog\/administrirovanie\/rezervnoe-kopirovanie-chast-1-naznachenie-obzor-metodov-i-tehnologij","title":{"rendered":"Backup, partea 1: Scopul, revizuirea metodelor \u0219i tehnologiilor","gt_translate_keys":[{"key":"rendered","format":"text"}]},"content":{"rendered":"<p><img decoding=\"async\" alt=\"Backup, partea 1: Scopul, revizuirea metodelor \u0219i tehnologiilor\" src=\"\/wp-content\/uploads\/2019\/04\/08d5ae9677c96628896868d3e19efd8f.jpeg\" style=\"display:block;margin: 0 auto;\" \/><br \/>\nDe ce este important s\u0103 facem copie de rezerv\u0103? De\u0219i echipamentele sunt foarte fiabile, exist\u0103 \u0219i \u201ecloud-uri\u201d care sunt mai fiabile dec\u00e2t serverele fizice: dac\u0103 sunt configurate corect, un server \u201ecloud\u201d poate supravie\u021bui cu u\u0219urin\u021b\u0103 unei defec\u021biuni a infrastructurii unui server fizic, iar din perspectiva utilizatorilor, va exista o mic\u0103, aproape imperceptibil\u0103, cre\u0219tere a timpului de r\u0103spuns. \u00cen plus, duplicarea informa\u021biilor necesit\u0103 adesea plata pentru \u201etimpul de procesor suplimentar\u201d, sarcina pe disc \u0219i traficul de re\u021bea.<br \/>\n<noindex><a rel=\"nofollow\" name=\"habracut\"><\/a><\/noindex><\/p>\n<blockquote><p>Programul ideal func\u021bioneaz\u0103 rapid, nu pierde memorie RAM, nu are bug-uri \u0219i nu exist\u0103.<\/p>\n<p>\u2014Necunoscut<\/p><\/blockquote>\n<p> Deoarece programele sunt \u00eenc\u0103 scrise de dezvoltatori, iar procesul de testare adesea lipseste, \u00een plus livrarea programelor se face foarte rar conform \u201ebest practices\u201d (care sunt ele \u00eensele tot programe \u0219i, prin urmare, imperfecte), administratorii de sistem trebuie adesea s\u0103 rezolve sarcini care sun\u0103 succint, dar sunt \u00eenc\u0103rcate: \u201erestaura\u021bi, ca \u00eenainte\u201d, \u201eaduce\u021bi baza la func\u021bionare normal\u0103\u201d, \u201efunc\u021bioneaz\u0103 lent \u2014 revenim\u201d, precum \u0219i preferata mea \u201enu \u0219tiu ce, dar repari\u201d.<\/p>\n<p>Pe l\u00e2ng\u0103 erorile logice care apar din cauza muncii neglijente a dezvoltatorilor, sau a circumstan\u021belor, precum \u0219i a cuno\u0219tin\u021belor incomplete sau a ne\u00een\u021belegerii detaliilor fine ale construirii programelor \u2014 inclusiv a leg\u0103turilor \u0219i sistemelor, inclusiv sistemele de operare, driverele \u0219i firmware-ul \u2014 mai exist\u0103 \u0219i alte tipuri de erori. De exemplu, majoritatea dezvoltatorilor se bazeaz\u0103 pe runtime \u0219i uit\u0103 complet de legile fizicii, pe care nu le pot ocoli prin intermediul programelor. Aceasta include fiabilitatea infinit\u0103 a subsistemului de stocare a discului \u0219i a oric\u0103rui subsistem de stocare a datelor (inclusiv memorie RAM \u0219i cache-ul procesorului!), timpul de procesare zero pe procesor, lipsa erorilor la transmiterea datelor \u00een re\u021bea \u0219i la procesare pe procesor \u0219i \u00eent\u00e2rzierile din re\u021bea, care sunt egale cu 0. Nu trebuie s\u0103 neglij\u0103m nici celebra limit\u0103 de timp, c\u0103ci dac\u0103 nu o respect\u0103m, vor ap\u0103rea probleme mai grave dec\u00e2t complexit\u0103\u021bile func\u021bion\u0103rii re\u021belei \u0219i discului.<\/p>\n<p><img decoding=\"async\" alt=\"Backup, partea 1: Scopul, revizuirea metodelor \u0219i tehnologiilor\" src=\"\/wp-content\/uploads\/2019\/04\/fed33628de53de522bae208f52fd7811.jpeg\" style=\"display:block;margin: 0 auto;\" \/><br \/>\n<br \/>\nCum s\u0103 gestion\u0103m problemele care apar brusc \u0219i amenin\u021b\u0103 datele valoroase? Nu putem \u00eenlocui dezvoltatorii umani, \u0219i nu exist\u0103 nicio garan\u021bie c\u0103 vom putea face acest lucru \u00een cur\u00e2nd. Pe de alt\u0103 parte, p\u00e2n\u0103 acum doar c\u00e2teva proiecte au demonstrat pe deplin c\u0103 programul va func\u021biona conform planului, \u0219i nu este deloc garantat c\u0103 putem aplica acele dovezi la alte proiecte similare. \u00cen plus, astfel de dovezi consum\u0103 mult timp \u0219i necesit\u0103 abilit\u0103\u021bi speciale, ceea ce reduce practic la minimum posibilitatea de aplicare, av\u00e2nd \u00een vedere termenele limit\u0103. De asemenea, \u00eenc\u0103 nu \u0219tim s\u0103 oferim o tehnologie de stocare, procesare \u0219i transmitere a informa\u021biilor care s\u0103 fie extrem de rapid\u0103, ieftin\u0103 \u0219i infinit de fiabil\u0103. Astfel de tehnologii, dac\u0103 exist\u0103, sunt mai degrab\u0103 concepte, sau \u2014 cel mai frecvent \u2014 doar \u00een c\u0103r\u021bi \u0219i filme de science fiction.<\/p>\n<blockquote><p>Artizanii buni copiaz\u0103, artizanii mari fur\u0103.<\/p>\n<p>\u2014Pablo Picasso.<\/p><\/blockquote>\n<p> Cele mai de succes solu\u021bii \u0219i cele mai surprinz\u0103tor de simple lucruri apar, de obicei, acolo unde se \u00eent\u00e2lnesc concepte, tehnologii, cuno\u0219tin\u021be \u0219i domenii de \u0219tiin\u021b\u0103 care sunt absolut incompatibile din punct de vedere al aparen\u021bei.<\/p>\n<p>De exemplu, p\u0103s\u0103rile \u0219i avioanele au aripi, cu toate c\u0103, \u00een ciuda asem\u0103n\u0103rii func\u021bionale \u2014 principiul de func\u021bionare coincide \u00een anumite condi\u021bii \u0219i problemele tehnice sunt rezolvate similar: oasele goale, utilizarea de materiale u\u0219oare \u0219i durabile etc., \u2014 rezultatele sunt complet diferite, de\u0219i foarte asem\u0103n\u0103toare. Cele mai bune exemple pe care le observ\u0103m \u00een tehnica noastr\u0103 sunt, de asemenea, \u00een mare parte \u00eemprumutate din natur\u0103: compartimentele etan\u0219e ale navelor \u0219i submarinelor \u2014 o analogie direct\u0103 cu viermii \u00een inel; construirea de matrice RAID \u0219i verificarea integrit\u0103\u021bii datelor \u2014 duplicarea lan\u021bului ADN; precum \u0219i organele pereche, independen\u021ba func\u021bion\u0103rii diferitelor organe de sistemul nervos central (automatul func\u021bion\u0103rii inimii) \u0219i reflexele \u2014 sisteme autonome \u00een re\u021bea. Desigur, a lua \u0219i a aplica solu\u021bii existente \u201eliteral\u201d este plin de probleme, dar cine \u0219tie, poate c\u0103 nu exist\u0103 alte solu\u021bii.<\/p>\n<blockquote><p>Dac\u0103 a\u0219 fi \u0219tiut unde voi c\u0103dea \u2014 a\u0219 fi preg\u0103tit ni\u0219te paie!<\/p>\n<p>\u2014Zic\u0103toare popular\u0103 belarus\u0103<\/p><\/blockquote>\n<p> A\u0219adar, copiile de rezerv\u0103 sunt esen\u021biale pentru cei care doresc:<\/p>\n<ul>\n<li>S\u0103 aib\u0103 posibilitatea de a-\u0219i restabili func\u021bionarea sistemelor cu timpi de nefunc\u021bionare minimi, sau chiar deloc.<\/li>\n<li>Ac\u021biona\u021bi cu \u00eencredere, pentru c\u0103, \u00een cazul unei erori, exist\u0103 \u00eentotdeauna posibilitatea de a reveni asupra acesteia.<\/li>\n<li>Minimiza\u021bi consecin\u021bele deterior\u0103rii inten\u021bionate a datelor.<\/li>\n<\/ul>\n<p>\n<b class=\"spoiler_title\">Aici \u2014 un pic de teorie.<\/b><\/p>\n<blockquote><p>Orice clasificare este arbitrar\u0103. Natura nu clasific\u0103. Noi clasific\u0103m pentru c\u0103 este mai convenabil pentru noi. Clasific\u0103m pe baza datelor pe care le lu\u0103m, de asemenea, \u00een mod arbitrar.<\/p>\n<p>\u2014Jean Bruhler<\/p><\/blockquote>\n<p> Indiferent de metoda fizic\u0103 de stocare, stocarea logic\u0103 a datelor poate fi \u00eemp\u0103r\u021bit\u0103 \u00een dou\u0103 moduri de acces la aceste date: bloc \u0219i fi\u0219ier. Aceast\u0103 \u00eemp\u0103r\u021bire este destul de vag\u0103 \u00een ultima vreme, deoarece nu exist\u0103 stoc\u0103ri logice pur bloc sau pur fi\u0219ier. Totu\u0219i, pentru simplificare, vom considera c\u0103 exist\u0103.<\/p>\n<p>Stocarea de date pe blocuri presupune existen\u021ba unui dispozitiv fizic \u00een care datele sunt scrise \u00een por\u021bii fixe, blocuri. Accesul la blocuri se face pe baza unei anumite adrese, fiec\u0103rui bloc corespunz\u00e2ndu-i o adres\u0103 specific\u0103 \u00een cadrul dispozitivului.<\/p>\n<p>Backup-ul este de obicei realizat prin copierea blocurilor de date. Pentru a asigura integritatea datelor \u00een momentul copiei, scrierea de noi blocuri \u0219i modificarea celor existente sunt suspendate. Dac\u0103 lu\u0103m o analogie din lumea obi\u0219nuit\u0103, cea mai apropiat\u0103 este un dulap cu celule numerotate identic.<\/p>\n<p><img decoding=\"async\" alt=\"Backup, partea 1: Scopul, revizuirea metodelor \u0219i tehnologiilor\" src=\"\/wp-content\/uploads\/2019\/04\/32408012dbd29ec2e227602351d4bba6.jpeg\" style=\"display:block;margin: 0 auto;\" \/><br \/>\n<br \/>\nStocarea de date pe fi\u0219iere, prin principiul dispozitivului logic, este aproape de cea pe blocuri \u0219i adesea este organizat\u0103 deasupra. Diferen\u021bele importante constau \u00een existen\u021ba unei ierarhii de stocare \u0219i denumiri u\u0219or de \u00een\u021beles. Se eviden\u021biaz\u0103 o abstrac\u021bie sub form\u0103 de fi\u0219ier \u2014 o zon\u0103 denumit\u0103 de date, precum \u0219i un director \u2014 un fi\u0219ier special \u00een care sunt stocate descrierile \u0219i acces\u0103rile altor fi\u0219iere. Fi\u0219ierele pot fi \u00eenso\u021bite de metadate suplimentare: data cre\u0103rii, semnele de acces etc. Backup-urile se fac de obicei astfel: se caut\u0103 fi\u0219ierele modificate, apoi se copiaz\u0103 \u00een alt stocaj de fi\u0219iere de structur\u0103 similar\u0103. Integritatea datelor este de obicei realizat\u0103 prin absen\u021ba fi\u0219ierelor \u00een care se scrie. Metadatele fi\u0219ierelor sunt rezervate \u00een mod similar. Cea mai apropiat\u0103 analogie este o bibliotec\u0103 care are sec\u021biuni cu diferite c\u0103r\u021bi \u0219i, de asemenea, un catalog cu denumiri u\u0219or de \u00een\u021beles ale c\u0103r\u021bilor.<\/p>\n<p><img decoding=\"async\" alt=\"Backup, partea 1: Scopul, revizuirea metodelor \u0219i tehnologiilor\" src=\"\/wp-content\/uploads\/2019\/04\/796162e24eb255a27c51c6077bcb1f07.jpeg\" style=\"display:block;margin: 0 auto;\" \/><br \/>\n<br \/>\nRecent discussions often describe another variant from which, in principle, data file storage began, sharing the same archaic features: object storage.<\/p>\n<p>It differs from file storage in that it has no more than one level of nesting (a flat schema), and while the file names are human-readable, they are more suited for machine processing. In backup solutions, object storage is often handled similarly to file systems, although there are occasionally other approaches.<\/p>\n<blockquote><p> \u2014 There are two types of system administrators: those who do not make backups and those who ALREADY do.<br \/>\n\u2014 Actually, there are three types: there are also those who verify that backups are restorable.<\/p>\n<p>\u2014Necunoscut<\/p><\/blockquote>\n<p> It is also important to understand that the backup process itself is carried out by software, thus inheriting all the same drawbacks as any other program. To mitigate (not eliminate!) dependency on human factors, as well as peculiarities that may not individually have a significant impact but can collectively have a noticeable effect, the so-called 3-2-1 rule is applied. There are many interpretations of it, but I prefer the following: you need to store 3 sets of the same data, 2 sets in different formats, and 1 set in a geographically remote location.<\/p>\n<p>By storage format, one should understand the following:<\/p>\n<ul>\n<li>If there is a dependency on the physical storage method, change the physical method.<\/li>\n<li>If there is a dependency on the logical storage method, change the logical method.<\/li>\n<\/ul>\n<p>\nTo achieve the maximum effect of the 3-2-1 rule, it is recommended to change the storage format using both methods.<\/p>\n<p>From the perspective of a backup's readiness for its direct purpose\u2014restoration of functionality\u2014there are two types of backups: 'hot' and 'cold.' The difference is only one: hot backups are immediately ready for use, whereas cold backups require additional actions for restoration, such as decryption, extraction from the archive, etc.<\/p>\n<p>Nu trebuie s\u0103 confund\u0103m copiile calde \u0219i reci cu copiile online \u0219i offline, care implic\u0103 o izolare fizic\u0103 a datelor \u0219i, \u00een esen\u021b\u0103, reprezint\u0103 o alt\u0103 categorie de clasificare a metodei de backup. Astfel, o copie offline \u2014 care nu este conectat\u0103 direct la sistemul din care trebuie s\u0103 fie restabilit\u0103 \u2014 poate fi fie cald\u0103, fie rece (\u00een ceea ce prive\u0219te preg\u0103tirea pentru restaurare). O copie online poate fi accesibil\u0103 direct acolo unde trebuie restaurat\u0103 \u0219i, cel mai adesea, este cald\u0103, dar pot exista \u0219i copie reci.<\/p>\n<p>\u00cen plus, nu trebuie s\u0103 uit\u0103m c\u0103 procesul de creare a backup-urilor de obicei nu se \u00eencheie dup\u0103 crearea unei singure copii, iar num\u0103rul de copii poate fi destul de mare. Prin urmare, trebuie s\u0103 facem distinc\u021bia \u00eentre backup-urile complete, adic\u0103 cele care pot fi restaurate independent de alte copii de backup, \u0219i copiile diferen\u021biale (incrementale, diferen\u021biale, decremetale etc.) \u2014 cele care nu pot fi restaurate singure \u0219i necesit\u0103 restaurarea prealabil\u0103 a uneia sau mai multor alte copii de backup.<\/p>\n<p>Copiile diferen\u021biale incremental sunt o \u00eencercare de a reduce dimensiunea spa\u021biului de stocare pentru backup-uri. Astfel, \u00een copia de backup sunt scrise doar datele modificate din ultima copie de backup.<\/p>\n<p>Copiile diferen\u021biale decremetale sunt create cu aceea\u0219i scop, dar printr-o metod\u0103 pu\u021bin diferit\u0103: se face o copie de backup complet\u0103, dar se p\u0103streaz\u0103 de fapt doar diferen\u021ba \u00eentre copia proasp\u0103t\u0103 \u0219i cea anterioar\u0103.<\/p>\n<p>Separat, merit\u0103 analizat procesul de backup deasupra unui stocaj care suport\u0103 absen\u021ba stoc\u0103rii de duplicat. Astfel, dac\u0103 scriem copii complete de backup deasupra lui, de fapt va fi \u00eenregistrat\u0103 doar diferen\u021ba \u00eentre copiile de backup, totu\u0219i procesul de restaurare a copiilor de backup va avea loc \u00een mod similar cu restaurarea dintr-o copie complet\u0103 \u0219i va fi complet transparent.<\/p>\n<blockquote><p>Quis custodiet ipsos custodes?<\/p>\n<p>(Cine va face paz\u0103 paznicilor? \u2014 lat.)<\/p><\/blockquote>\n<p>Este foarte nepl\u0103cut c\u00e2nd nu exist\u0103 backup-uri, dar este mult mai r\u0103u dac\u0103 backup-ul pare c\u0103 a fost efectuat, dar la restaurare se constat\u0103 c\u0103 nu poate fi restaurat, deoarece:<\/p>\n<ul>\n<li>Integritatea datelor originale a fost compromis\u0103.<\/li>\n<li>Stocajul cu backup-uri este deteriorat.<\/li>\n<li>Recuperarea func\u021bioneaz\u0103 destul de lent, nu se pot folosi datele care sunt par\u021bial restaurate.<\/li>\n<\/ul>\n<p>Un proces de backup bine construit trebuie s\u0103 ia \u00een considerare astfel de observa\u021bii, \u00een special primele dou\u0103.<\/p>\n<p>Integritatea datelor originale poate fi garantat\u0103 \u00een mai multe moduri. Cele mai utilizate sunt urm\u0103toarele: a) crearea de copii ale sistemului de fi\u0219iere la nivel de bloc, b) \"\u00eenghe\u021barea\" st\u0103rii sistemului de fi\u0219iere, c) un dispozitiv bloc special pentru stocarea versiunilor, d) scrierea secven\u021bial\u0103 a fi\u0219ierelor sau blocurilor. De asemenea, se aplic\u0103 sume de control pentru a asigura verificarea datelor la restaurare.<\/p>\n<p>Deteriorarea stoc\u0103rii poate fi, de asemenea, detectat\u0103 cu ajutorul sumelor de control. O metod\u0103 suplimentar\u0103 este utilizarea dispozitivelor specializate sau a sistemelor de fi\u0219iere \u00een care datele deja scrise nu pot fi modificate, dar se pot ad\u0103uga noi.<\/p>\n<p>Pentru a accelera recuperarea, se aplic\u0103 restaurarea datelor cu mai multe procese de recuperare \u2014 cu condi\u021bia s\u0103 nu existe un \"g\u00e2t de sticle\" sub forma unei re\u021bele lente sau a unui sistem de discuri nu foarte rapid. Pentru a ocoli situa\u021bia cu date par\u021bial restaurate, procesul de backup poate fi \u00eemp\u0103r\u021bit \u00een subtask-uri relativ mici, fiecare dintre ele execut\u00e2ndu-se separat. Astfel, se ofer\u0103 posibilitatea de a restaura func\u021bionalitatea treptat, previzion\u00e2nd timpul de recuperare. Aceast\u0103 problem\u0103 se afl\u0103 cel mai adesea \u00een planul organiza\u021bional (SLA), astfel \u00eenc\u00e2t nu ne vom opri asupra acestui aspect detaliat.<\/p>\n<blockquote><p>Cine \u0219tie s\u0103 foloseasc\u0103 condimentele nu este acela care le adaug\u0103 \u00een fiecare m\u00e2ncare, ci acela care nu va ad\u0103uga niciodat\u0103 nimic \u00een plus.<\/p>\n<p>\u2014V. Siniavski<\/p><\/blockquote>\n<p>Practicile din partea software-ului aplicat de administratorii de sistem pot varia, dar principiile generale r\u0103m\u00e2n totu\u0219i acelea\u0219i, \u00een special:<\/p>\n<ul>\n<li>Se recomand\u0103 cu insisten\u021b\u0103 utilizarea solu\u021biilor gata f\u0103cute.<\/li>\n<li>Programele trebuie s\u0103 func\u021bioneze predictibil, adic\u0103 nu trebuie s\u0103 existe caracteristici documentate sau puncte slabe.<\/li>\n<li>Configura\u021bia fiec\u0103rei programe trebuie s\u0103 fie suficient de simpl\u0103, astfel \u00eenc\u00e2t s\u0103 nu fie necesar\u0103 citirea manualului sau a fi\u0219ei de ajutor de fiecare dat\u0103.<\/li>\n<li>Solu\u021bia ar trebui s\u0103 fie universal\u0103, deoarece serverele pot diferi semnificativ \u00een func\u021bie de specifica\u021biile hardware.<\/li>\n<\/ul>\n<p>Pentru crearea copiilor de siguran\u021b\u0103 de pe dispozitivele bloc, exist\u0103 urm\u0103toarele programe frecvent utilizate:<\/p>\n<ul>\n<li>dd, cunoscut\u0103 veteranilor \u00een administrarea sistemelor, iar aici intr\u0103 \u0219i programe similare (de exemplu, dd_rescue).<\/li>\n<li>Programe (utilitare) \u00eencorporate \u00een unele sisteme de fi\u0219iere care creeaz\u0103 o copie (dump) a sistemului de fi\u0219iere.<\/li>\n<li>Utilitare versatile; de exemplu, partclone.<\/li>\n<li>Solu\u021bii proprii, adesea personalizate; de exemplu, NortonGhost \u0219i versiunile mai recente.<\/li>\n<\/ul>\n<p>Pentru sistemele de fi\u0219iere, problema cre\u0103rii copiilor de siguran\u021b\u0103 este par\u021bial rezolvat\u0103 prin metode aplicabile dispozitivelor bloc, dar se poate rezolva \u0219i mai eficient, folosind, de exemplu:<\/p>\n<ul>\n<li>Rsync, o program\u0103 \u0219i protocol universal pentru sincronizarea st\u0103rii sistemelor de fi\u0219iere.<\/li>\n<li>Instrumente \u00eencorporate pentru arhivare (ZFS).<\/li>\n<li>Instrumente de arhivare din ter\u021b\u0103 parte; cel mai popular reprezentant este tar. Exist\u0103 \u0219i altele, cum ar fi dar - o alternativ\u0103 la tar orientat\u0103 spre sistemele moderne.<\/li>\n<\/ul>\n<p>\nEste important s\u0103 men\u021bion\u0103m instrumentele software pentru asigurarea consisten\u021bei datelor \u00een timpul cre\u0103rii copiilor de siguran\u021b\u0103. Cele mai frecvente op\u021biuni utilizate sunt:<\/p>\n<ul>\n<li>Montarea sistemului de fi\u0219iere \u00een modul doar citire (ReadOnly) sau \u00eenghe\u021barea sistemului de fi\u0219iere (freeze) - metoda este aplicabil\u0103 \u00eentr-o m\u0103sur\u0103 limitat\u0103.<\/li>\n<li>Crearea copiilor st\u0103rii sistemului de fi\u0219iere sau a dispozitivului bloc (LVM, ZFS).<\/li>\n<li>Utilizarea de instrumente din ter\u021b\u0103 parte pentru organizarea copiilor, chiar \u0219i \u00een cazurile \u00een care punctele anterioare nu pot fi asigurate din diverse motive (programe de tip hotcopy).<\/li>\n<li>Tehnica de copiere la modificare (CopyOnWrite), \u00eens\u0103 de obicei este legat\u0103 de sistemul de fi\u0219iere utilizat (BTRFS, ZFS).<\/li>\n<\/ul>\n<p>Prin urmare, pentru un server mic, este necesar s\u0103 se asigure un sistem de backup care s\u0103 \u00eendeplineasc\u0103 urm\u0103toarele cerin\u021be:<\/p>\n<ul>\n<li>Simplu de utilizat \u2014 nu necesit\u0103 ac\u021biuni speciale suplimentare \u00een timpul func\u021bion\u0103rii, ac\u021biuni minime pentru crearea \u0219i restaurarea copiilor.<\/li>\n<li>Universal \u2014 func\u021bioneaz\u0103 at\u00e2t pe servere mari, c\u00e2t \u0219i pe cele mici; acest lucru este important pe m\u0103sur\u0103 ce num\u0103rul <a class=\"wpil_keyword_link\" href=\"https:\/\/prohoster.info\/ro\/server\/\"   title=\"servere\" data-wpil-keyword-link=\"linked\"  data-wpil-monitor-id=\"1319\">servere<\/a> sau scalarea cre\u0219te.<\/li>\n<li>Se instaleaz\u0103 printr-un manager de pachete, sau \u00een una-dou\u0103 comenzi de tip \u201edesc\u0103rca\u021bi \u0219i dezarhiva\u021bi\u201d.<\/li>\n<li>Stabil \u2014 se folose\u0219te un format standard sau bine stabilit de stocare.<\/li>\n<li>Rapid \u00een func\u021bionare.<\/li>\n<\/ul>\n<p>\nCandidatul care r\u0103spunde oarecum cerin\u021belor:<\/p>\n<ul>\n<li>rdiff-backup<\/li>\n<li>rsnapshot<\/li>\n<li>burp<\/li>\n<li>duplicati<\/li>\n<li>duplicity<\/li>\n<li>deja dup<\/li>\n<li>dar<\/li>\n<li>zbackup<\/li>\n<li>restic<\/li>\n<li>borgbackup<\/li>\n<\/ul>\n<p>\n<img decoding=\"async\" alt=\"Backup, partea 1: Scopul, revizuirea metodelor \u0219i tehnologiilor\" src=\"\/wp-content\/uploads\/2019\/04\/bc9e31c37656c1b6998f08939763a563.jpeg\" style=\"display:block;margin: 0 auto;\" \/><br \/>\n<br \/>\nPentru sta\u021bia de testare se va folosi o ma\u0219in\u0103 virtual\u0103 (bazat\u0103 pe XenServer) cu urm\u0103toarele caracteristici:<\/p>\n<ul>\n<li>4 nuclee de 2.5 GHz,<\/li>\n<li>16 GB de RAM,<\/li>\n<li>50 GB de stocare hibrid\u0103 (SAS cu caching SSD de 20% din dimensiunea discului virtual) sub form\u0103 de disc virtual separat f\u0103r\u0103 parti\u021bionare,<\/li>\n<li>Canal de 200 Mbps \u00een internet.<\/li>\n<\/ul>\n<p>\nCa server de primire a copiilor de rezerv\u0103 se va folosi o ma\u0219in\u0103 practic similar\u0103, dar cu un hard disk de 500 GB.<\/p>\n<p>Sistemul de operare \u2014 Centos 7 x64: parti\u021bionare standard, o parti\u021bie suplimentar\u0103 va fi folosit\u0103 ca surs\u0103 de date.<\/p>\n<p>Ca date de origine vom lua un site pe Wordpress, cu fi\u0219iere media de 40 GB \u0219i o baz\u0103 de date pe MySQL. Deoarece <a class=\"wpil_keyword_link\" href=\"https:\/\/prohoster.info\/ro\/vps\/\"   title=\"servere virtuale\" data-wpil-keyword-link=\"linked\"  data-wpil-monitor-id=\"1262\">servere virtuale<\/a> variaz\u0103 semnificativ ca specifica\u021bii, precum \u0219i pentru a asigura o mai bun\u0103 reproducibilitate, aici sunt <\/p>\n<p><b class=\"spoiler_title\">rezultatele test\u0103rii serverului cu ajutorul sysbench.<\/b>sysbench --threads=4 --time=30 --cpu-max-prime=20000 cpu run<br \/>\nsysbench 1.1.0-18a9f86 (folosind LuaJIT 2.1.0-beta3 integrat)<br \/>\nSe ruleaz\u0103 testul cu urm\u0103toarele op\u021biuni:<br \/>\nNum\u0103rul de fire: 4<br \/>\nIni\u021bializarea generatorului de numere aleatoare din timpul curent<\/p>\n<p>Limit\u0103 pentru numere prime: 20000<\/p>\n<p>Ini\u021bializarea firelor de lucru\u2026<\/p>\n<p>Firele au fost pornite!<\/p>\n<p>Viteza CPU:<br \/>\nevenimente pe secund\u0103: 836.69<\/p>\n<p>Debitul:<br \/>\nevenimente\/s (eps): 836.6908<br \/>\ntimpul scurs: 30.0039s<br \/>\nnum\u0103rul total de evenimente: 25104<\/p>\n<p>Latenta (ms):<br \/>\nmin: 2.38<br \/>\nmedie: 4.78<br \/>\nmax: 22.39<br \/>\npercentila 95: 10.46<br \/>\nsuma: 119923.64<\/p>\n<p>Corectitudinea firelor:<br \/>\nevenimente (medie\/devia\u021bie standard): 6276.0000\/13.91<br \/>\ntimpul de execu\u021bie (medie\/devia\u021bie standard): 29.9809\/0.01<\/p>\n<p>sysbench --threads=4 --time=30 --memory-block-size=1K --memory-scope=global --memory-total-size=100G --memory-oper=read memory run<br \/>\nsysbench 1.1.0-18a9f86 (folosind LuaJIT 2.1.0-beta3 integrat)<br \/>\nSe ruleaz\u0103 testul cu urm\u0103toarele op\u021biuni:<br \/>\nNum\u0103rul de fire: 4<br \/>\nIni\u021bializarea generatorului de numere aleatoare din timpul curent<\/p>\n<p>Se ruleaz\u0103 testul de vitez\u0103 a memoriei cu urm\u0103toarele op\u021biuni:<br \/>\ndimensiune bloc: 1KiB<br \/>\ndimensiune total\u0103: 102400MiB<br \/>\nopera\u021biune: citire<br \/>\nsfer\u0103: global<\/p>\n<p>Ini\u021bializarea firelor de lucru\u2026<\/p>\n<p>Firele au fost pornite!<\/p>\n<p>Total opera\u021biuni: 50900446 (1696677.10 pe secund\u0103)<\/p>\n<p>49707.47 MiB transferate (1656.91 MiB\/sec)<\/p>\n<p>Debitul:<br \/>\nevenimente\/s (eps): 1696677.1017<br \/>\ntimpul scurs: 30.0001s<br \/>\nnum\u0103rul total de evenimente: 50900446<\/p>\n<p>Latenta (ms):<br \/>\nmin: 0.00<br \/>\nmedie: 0.00<br \/>\nmax: 24.01<br \/>\npercentila 95: 0.00<br \/>\nsuma: 39106.74<\/p>\n<p>Corectitudinea firelor:<br \/>\nevenimente (medie\/devia\u021bie standard): 12725111.5000\/137775.15<br \/>\ntimp de execu\u021bie (medie\/devia\u021bie standard): 9.7767\/0.10<\/p>\n<p>sysbench --threads=4 --time=30 --memory-block-size=1K --memory-scope=global --memory-total-size=100G --memory-oper=write memory run<br \/>\nsysbench 1.1.0-18a9f86 (folosind LuaJIT 2.1.0-beta3 integrat)<br \/>\nSe ruleaz\u0103 testul cu urm\u0103toarele op\u021biuni:<br \/>\nNum\u0103rul de fire: 4<br \/>\nIni\u021bializarea generatorului de numere aleatoare din timpul curent<\/p>\n<p>Se ruleaz\u0103 testul de vitez\u0103 a memoriei cu urm\u0103toarele op\u021biuni:<br \/>\ndimensiune bloc: 1KiB<br \/>\ndimensiune total\u0103: 102400MiB<br \/>\nopera\u021biune: scriere<br \/>\nsfer\u0103: global<\/p>\n<p>Ini\u021bializarea firelor de lucru\u2026<\/p>\n<p>Firele au fost pornite!<\/p>\n<p>Total opera\u021biuni: 35910413 (1197008.62 pe secund\u0103)<\/p>\n<p>35068.76 MiB transferate (1168.95 MiB\/sec)<\/p>\n<p>Debitul:<br \/>\nevenimente\/s (eps): 1197008.6179<br \/>\ntimpul scurs: 30.0001s<br \/>\nnum\u0103rul total de evenimente: 35910413<\/p>\n<p>Latenta (ms):<br \/>\nmin: 0.00<br \/>\nmedie: 0.00<br \/>\nmax: 16.90<br \/>\npercentila 95: 0.00<br \/>\nsuma: 43604.83<\/p>\n<p>Corectitudinea firelor:<br \/>\nevenimente (medie\/devia\u021bie standard): 8977603.2500\/233905.84<br \/>\ntimp de execu\u021bie (medie\/devia\u021bie standard): 10.9012\/0.41<\/p>\n<p>sysbench --threads=4 --file-test-mode=rndrw --time=60 --file-block-size=4K --file-total-size=1G fileio run<br \/>\nsysbench 1.1.0-18a9f86 (folosind LuaJIT 2.1.0-beta3 integrat)<br \/>\nSe ruleaz\u0103 testul cu urm\u0103toarele op\u021biuni:<br \/>\nNum\u0103rul de fire: 4<br \/>\nIni\u021bializarea generatorului de numere aleatoare din timpul curent<\/p>\n<p>Flagi suplimentare pentru deschiderea fi\u0219ierelor: (none)<br \/>\n128 fi\u0219iere, c\u00e2te 8MiB fiecare<br \/>\n1GiB dimensiune total\u0103 a fi\u0219ierelor<br \/>\nDimensiune bloc 4KiB<br \/>\nNum\u0103rul de cereri IO: 0<br \/>\nRata de citire\/scriere pentru testul IO aleatoriu combinat: 1.50<br \/>\nFSYNC periodic activat, apel\u00e2nd fsync() la fiecare 100 de cereri.<br \/>\nApel\u00e2nd fsync() la sf\u00e2r\u0219itul testului, activat.<br \/>\nFolosind modul I\/O sincron<br \/>\nExecut\u00e2nd un test r\/w aleator<br \/>\nIni\u021bializarea firelor de lucru\u2026<\/p>\n<p>Firele au fost pornite!<\/p>\n<p>Debitul:<br \/>\ncitire: IOPS=3868.21 15.11 MiB\/s (15.84 MB\/s)<br \/>\nscrie: IOPS=2578.83 10.07 MiB\/s (10.56 MB\/s)<br \/>\nfsync: IOPS=8226.98<\/p>\n<p>Latenta (ms):<br \/>\nmin: 0.00<br \/>\nmedie: 0.27<br \/>\nmax: 18.01<br \/>\npercentilul 95: 1.08<br \/>\nsum\u0103: 238469.45<\/p>\n<p>Aceast\u0103 not\u0103 introduce un ciclu amplu <\/p>\n<p><b class=\"spoiler_title\">de articole despre backup<\/b><\/p>\n<ol>\n<li> Backup, partea 1: De ce este necesar backup-ul, revizuirea metodelor, tehnologiilor.<\/li>\n<li> Backup, partea 2: Revizuirea \u0219i testarea instrumentelor de backup bazate pe rsync.<\/li>\n<li> Backup, partea 3: Prezentare general\u0103 \u0219i testare duplicity, duplicaty, deja dup<\/li>\n<li> Backup, partea 4: Revizuirea \u0219i testarea zbackup, restic, borgbackup<\/li>\n<li> Backup, partea 5: Testarea bacula \u0219i veeam backup pentru linux.<\/li>\n<li> Backup, partea 6: Compara\u021bia uneltelor de backup<\/li>\n<li> Backup, partea 7: Concluzii<\/li>\n<\/ol>\n<p>Sursa: <a content=\"nofollow\" rel=\"nofollow\" href=\"https:\/\/habr.com\/ru\/company\/southbridge\/blog\/449282\/\">habr.com<\/a><\/p>","protected":false,"gt_translate_keys":[{"key":"rendered","format":"html"}]},"excerpt":{"rendered":"<p>\u0417\u0430\u0447\u0435\u043c \u0436\u0435 \u043d\u0443\u0436\u043d\u043e \u0434\u0435\u043b\u0430\u0442\u044c \u0440\u0435\u0437\u0435\u0440\u0432\u043d\u044b\u0435 \u043a\u043e\u043f\u0438\u0438? \u0412\u0435\u0434\u044c \u043e\u0431\u043e\u0440\u0443\u0434\u043e\u0432\u0430\u043d\u0438\u0435 \u0432\u0435\u0441\u044c\u043c\u0430 \u0438 \u0432\u0435\u0441\u044c\u043c\u0430 \u043d\u0430\u0434\u0435\u0436\u043d\u043e\u0435, \u043a \u0442\u043e\u043c\u0443 \u0436\u0435 \u0435\u0441\u0442\u044c \u00ab\u043e\u0431\u043b\u0430\u043a\u0430\u00bb, \u043a\u043e\u0442\u043e\u0440\u044b\u0435 \u043f\u043e \u043d\u0430\u0434\u0435\u0436\u043d\u043e\u0441\u0442\u0438 \u043b\u0443\u0447\u0448\u0435 \u0444\u0438\u0437\u0438\u0447\u0435\u0441\u043a\u0438\u0445 \u0441\u0435\u0440\u0432\u0435\u0440\u043e\u0432: \u043f\u0440\u0438 \u043f\u0440\u0430\u0432\u0438\u043b\u044c\u043d\u043e\u0439 \u043d\u0430\u0441\u0442\u0440\u043e\u0439\u043a\u0435 \u00ab\u043e\u0431\u043b\u0430\u0447\u043d\u044b\u0439\u00bb \u0441\u0435\u0440\u0432\u0435\u0440 \u0437\u0430\u043f\u0440\u043e\u0441\u0442\u043e \u043f\u0435\u0440\u0435\u0436\u0438\u0432\u0435\u0442 \u043e\u0442\u043a\u0430\u0437 \u0438\u043d\u0444\u0440\u0430\u0441\u0442\u0440\u0443\u043a\u0442\u0443\u0440\u043d\u043e\u0433\u043e \u0444\u0438\u0437\u0438\u0447\u0435\u0441\u043a\u043e\u0433\u043e \u0441\u0435\u0440\u0432\u0435\u0440\u0430, \u0430 \u0441 \u0442\u043e\u0447\u043a\u0438 \u0437\u0440\u0435\u043d\u0438\u044f \u043f\u043e\u043b\u044c\u0437\u043e\u0432\u0430\u0442\u0435\u043b\u0435\u0439 \u0441\u0435\u0440\u0432\u0438\u0441\u043e\u0432, \u0431\u0443\u0434\u0435\u0442 \u043d\u0435\u0431\u043e\u043b\u044c\u0448\u043e\u0439, \u0435\u043b\u0435 \u0437\u0430\u043c\u0435\u0442\u043d\u044b\u0439 \u0441\u043a\u0430\u0447\u043e\u043a \u0432\u0440\u0435\u043c\u0435\u043d\u0438 \u043e\u0431\u0441\u043b\u0443\u0436\u0438\u0432\u0430\u043d\u0438\u044f. \u041a \u0442\u043e\u043c\u0443 \u0436\u0435 \u0434\u0443\u0431\u043b\u0438\u0440\u043e\u0432\u0430\u043d\u0438\u0435 \u0438\u043d\u0444\u043e\u0440\u043c\u0430\u0446\u0438\u0438 \u0437\u0430\u0447\u0430\u0441\u0442\u0443\u044e \u0442\u0440\u0435\u0431\u0443\u0435\u0442 \u043e\u043f\u043b\u0430\u0442\u0438\u0442\u044c [&hellip;]<\/p>\n","protected":false,"gt_translate_keys":[{"key":"rendered","format":"html"}]},"author":1,"featured_media":24281,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[688],"tags":[],"class_list":["post-32477","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-administrirovanie"],"aioseo_notices":[],"aioseo_head":"\n\t\t<!-- All in One SEO 5.0.2.1 - aioseo.com -->\n\t<meta name=\"description\" content=\"\u0417\u0430\u0447\u0435\u043c \u0436\u0435 \u043d\u0443\u0436\u043d\u043e.\" \/>\n\t<meta name=\"robots\" content=\"max-image-preview:large\" \/>\n\t<meta name=\"author\" content=\"Yuri Gagarin\"\/>\n\t<link rel=\"canonical\" href=\"https:\/\/prohoster.info\/ro\/blog\/administrirovanie\/rezervnoe-kopirovanie-chast-1-naznachenie-obzor-metodov-i-tehnologij\" \/>\n\t<meta name=\"generator\" content=\"All in One SEO (AIOSEO) 5.0.2.1\" \/>\n\t\t<meta property=\"og:locale\" content=\"ro_RO\" \/>\n\t\t<meta property=\"og:site_name\" content=\"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\" \/>\n\t\t<meta property=\"og:type\" content=\"article\" \/>\n\t\t<meta property=\"og:title\" content=\"\ud83e\udd47\u0420\u0435\u0437\u0435\u0440\u0432\u043d\u043e\u0435 \u043a\u043e\u043f\u0438\u0440\u043e\u0432\u0430\u043d\u0438\u0435, \u0447\u0430\u0441\u0442\u044c 1: \u041d\u0430\u0437\u043d\u0430\u0447\u0435\u043d\u0438\u0435, \u043e\u0431\u0437\u043e\u0440 \u043c\u0435\u0442\u043e\u0434\u043e\u0432 \u0438 \u0442\u0435\u0445\u043d\u043e\u043b\u043e\u0433\u0438\u0439 | ProHoster\" \/>\n\t\t<meta property=\"og:description\" content=\"\u0417\u0430\u0447\u0435\u043c \u0436\u0435 \u043d\u0443\u0436\u043d\u043e.\" \/>\n\t\t<meta property=\"og:url\" content=\"https:\/\/prohoster.info\/ro\/blog\/administrirovanie\/rezervnoe-kopirovanie-chast-1-naznachenie-obzor-metodov-i-tehnologij\" \/>\n\t\t<meta property=\"og:image\" content=\"https:\/\/prohoster.info\/wp-content\/uploads\/2021\/11\/logo-350.jpg\" \/>\n\t\t<meta property=\"og:image:secure_url\" content=\"https:\/\/prohoster.info\/wp-content\/uploads\/2021\/11\/logo-350.jpg\" \/>\n\t\t<meta property=\"og:image:width\" content=\"350\" \/>\n\t\t<meta property=\"og:image:height\" content=\"350\" \/>\n\t\t<meta property=\"article:published_time\" content=\"2019-10-31T18:47:17+00:00\" \/>\n\t\t<meta property=\"article:modified_time\" content=\"2019-10-31T18:47:17+00:00\" \/>\n\t\t<meta property=\"article:publisher\" content=\"https:\/\/www.facebook.com\/prohoster\" \/>\n\t\t<meta property=\"article:author\" content=\"https:\/\/www.facebook.com\/prohoster\" \/>\n\t\t<!-- All in One SEO -->\n\n","aioseo_head_json":{"title":"\ud83e\udd47Backup, partea 1: Scop, prezentare general\u0103 a metodelor \u0219i tehnologiilor | ProHoster","description":"De ce este necesar.","canonical_url":"https:\/\/prohoster.info\/ro\/blog\/administrirovanie\/rezervnoe-kopirovanie-chast-1-naznachenie-obzor-metodov-i-tehnologij","robots":"max-image-preview:large","keywords":"","webmasterTools":{"miscellaneous":""},"schema":null,"og:locale":"ro_RO","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\u0420\u0435\u0437\u0435\u0440\u0432\u043d\u043e\u0435 \u043a\u043e\u043f\u0438\u0440\u043e\u0432\u0430\u043d\u0438\u0435, \u0447\u0430\u0441\u0442\u044c 1: \u041d\u0430\u0437\u043d\u0430\u0447\u0435\u043d\u0438\u0435, \u043e\u0431\u0437\u043e\u0440 \u043c\u0435\u0442\u043e\u0434\u043e\u0432 \u0438 \u0442\u0435\u0445\u043d\u043e\u043b\u043e\u0433\u0438\u0439 | ProHoster","og:description":"\u0417\u0430\u0447\u0435\u043c \u0436\u0435 \u043d\u0443\u0436\u043d\u043e.","og:url":"https:\/\/prohoster.info\/ro\/blog\/administrirovanie\/rezervnoe-kopirovanie-chast-1-naznachenie-obzor-metodov-i-tehnologij","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-31T18:47:17+00:00","article:modified_time":"2019-10-31T18:47:17+00:00","article:publisher":"https:\/\/www.facebook.com\/prohoster","article:author":"https:\/\/www.facebook.com\/prohoster"},"aioseo_meta_data":{"post_id":"32477","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-02-09 17:02:19","breadcrumb_settings":null,"limit_modified_date":false,"reviewed_by":null,"ai":null,"created":"2021-02-28 15:35:23","updated":"2026-02-09 17:02:19","focus_keyword":null,"additional_keywords":null,"truseo_locale":null},"gt_translate_keys":[{"key":"link","format":"url"}],"_links":{"self":[{"href":"https:\/\/prohoster.info\/ro\/wp-json\/wp\/v2\/posts\/32477","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/prohoster.info\/ro\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/prohoster.info\/ro\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/prohoster.info\/ro\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/prohoster.info\/ro\/wp-json\/wp\/v2\/comments?post=32477"}],"version-history":[{"count":2,"href":"https:\/\/prohoster.info\/ro\/wp-json\/wp\/v2\/posts\/32477\/revisions"}],"predecessor-version":[{"id":158563,"href":"https:\/\/prohoster.info\/ro\/wp-json\/wp\/v2\/posts\/32477\/revisions\/158563"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/prohoster.info\/ro\/wp-json\/wp\/v2\/media\/24281"}],"wp:attachment":[{"href":"https:\/\/prohoster.info\/ro\/wp-json\/wp\/v2\/media?parent=32477"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/prohoster.info\/ro\/wp-json\/wp\/v2\/categories?post=32477"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/prohoster.info\/ro\/wp-json\/wp\/v2\/tags?post=32477"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}