{"id":34367,"date":"2019-10-31T21:57:56","date_gmt":"2019-10-31T18:57:56","guid":{"rendered":"https:\/\/prohoster.info\/blog\/issledovanie-sozdanie-ustojchivogo-k-blokirovkam-proksi-servisa-s-pomoshhyu-teorii-igr\/"},"modified":"2019-10-31T21:57:56","modified_gmt":"2019-10-31T18:57:56","slug":"issledovanie-sozdanie-ustojchivogo-k-blokirovkam-proksi-servisa-s-pomoshhyu-teorii-igr","status":"publish","type":"post","link":"https:\/\/prohoster.info\/sq\/blog\/administrirovanie\/issledovanie-sozdanie-ustojchivogo-k-blokirovkam-proksi-servisa-s-pomoshhyu-teorii-igr","title":{"rendered":"K\u00ebrkimi: krijimi i nj\u00eb sh\u00ebrbimi proxy t\u00eb q\u00ebndruesh\u00ebm ndaj bllokimeve duke p\u00ebrdorur teorin\u00eb e lojrave","gt_translate_keys":[{"key":"rendered","format":"text"}]},"content":{"rendered":"

\"K\u00ebrkimi:<\/a><\/noindex><\/p>\n

Para disa vitesh, nj\u00eb grup nd\u00ebrkomb\u00ebtar shkenc\u00ebtar\u00ebsh nga universitetet e Massachusetts, Pennsylvania dhe Mynihu n\u00eb Gjermani realizoi<\/a><\/noindex> k\u00ebrkoi efektivitetin e proksive tradicionale si nj\u00eb mjet p\u00ebr t\u00eb luftuar censur\u00ebn. Si rezultat, shkenc\u00ebtar\u00ebt propozuan nj\u00eb metod\u00eb t\u00eb re p\u00ebr t\u00eb p\u00ebrballuar bllokimet, e bazuar n\u00eb teorin\u00eb e loj\u00ebrave. Ne kemi p\u00ebrgatitur nj\u00eb p\u00ebrkthim t\u00eb p\u00ebrshtatur t\u00eb pikave kryesore t\u00eb k\u00ebsaj pune.<\/a><\/noindex><\/p>\n

Hyrje<\/h2>\n

\nQasja e mjeteve popullore p\u00ebr t\u00eb p\u00ebrballuar bllokimet, si Tor, bazohet n\u00eb shp\u00ebrndarjen private dhe selektive t\u00eb adresave IP t\u00eb proksive nd\u00ebrmjet klient\u00ebve nga regjionet q\u00eb po p\u00ebrballen me bllokime. Si rezultat, klient\u00ebt duhet t\u00eb mbeten t\u00eb panjohur p\u00ebr organizatat ose autoritetet q\u00eb vendosin bllokimet. N\u00eb rastin e Tor, k\u00ebto shp\u00ebrndar\u00ebs proksish quhen urat. <\/p>\n

Problemi kryesor n\u00eb rastin e sh\u00ebrbimeve t\u00eb tilla \u00ebsht\u00eb sulmi i brendsh\u00ebm. Agjent\u00ebt q\u00eb merren me bllokimet mund gjithashtu t\u00eb p\u00ebrdorin proksi p\u00ebr t\u00eb zbuluar adresat e tyre dhe t'i bllokojn\u00eb ato. P\u00ebr t\u00eb minimizuar mund\u00ebsin\u00eb e zbulimit t\u00eb proksive, mjetet e p\u00ebrballimit t\u00eb bllokimeve p\u00ebrdorin mekanizma t\u00eb ndrysh\u00ebm p\u00ebr caktimin e adresave.<\/p>\n

N\u00eb k\u00ebt\u00eb rast, p\u00ebrdoret qasja e ashtuquajtur ad hoc-heuristik\u00eb, e cila mund t\u00eb anashkalohet. P\u00ebr t\u00eb zgjidhur k\u00ebt\u00eb problem, shkenc\u00ebtar\u00ebt vendos\u00ebn ta paraqesin luft\u00ebn nd\u00ebrmjet sh\u00ebrbimeve q\u00eb merren me bllokimet dhe sh\u00ebrbimeve p\u00ebr t'i p\u00ebrballuar ato si nj\u00eb loj\u00eb. Duke p\u00ebrdorur teorin\u00eb e loj\u00ebrave, ata zhvilluan strategjit\u00eb optimale t\u00eb sjelljes p\u00ebr secil\u00ebn pal\u00eb \u2013 ve\u00e7an\u00ebrisht, kjo lejoi zhvillimin e nj\u00eb mekanizmi p\u00ebr shp\u00ebrndarjen e proksive.<\/p>\n

Si funksionojn\u00eb sistemet tradicionale p\u00ebr p\u00ebrballimin e bllokimeve<\/h2>\n

\nMjetet p\u00ebr t\u00eb p\u00ebrballuar bllokimet, si Tor, Lantern dhe Psiphon, p\u00ebrdorin nj\u00eb s\u00ebr\u00eb proksish jasht\u00eb rajoneve me kufizime, t\u00eb cilat p\u00ebrdoren p\u00ebr t\u00eb nd\u00ebrprer\u00eb trafikun e p\u00ebrdoruesve nga k\u00ebto rajone dhe p\u00ebr ta d\u00ebrguar at\u00eb n\u00eb burimet e bllokuara.<\/p>\n

N\u00ebse cenzor\u00ebt e zbulojn\u00eb adres\u00ebn IP t\u00eb nj\u00eb proksi t\u00eb till\u00eb \u2013 p\u00ebr shembull, pasi ata vet\u00eb e p\u00ebrdorin at\u00eb \u2013 \u00ebsht\u00eb e leht\u00eb ta vendosin n\u00eb nj\u00eb list\u00eb t\u00eb zez\u00eb dhe ta bllokojn\u00eb. K\u00ebshtu, n\u00eb realitet, adresat IP t\u00eb k\u00ebtyre proksive nuk zbulohet kurr\u00eb, dhe dakordimi i p\u00ebrdoruesve me nj\u00eb proksi t\u00eb caktuar ndodh p\u00ebrmes mekanizmave t\u00eb ndrysh\u00ebm. P\u00ebr shembull, n\u00eb Tor ekziston nj\u00eb sistem urash. <\/p>\n

Pra k\u00ebto, detyra kryesore \u00ebsht\u00eb t\u00eb ofrojm\u00eb p\u00ebrdoruesve qasje n\u00eb burimet e bllokuara dhe t\u00eb minimizojm\u00eb mund\u00ebsin\u00eb e zbulimit t\u00eb adres\u00ebs s\u00eb proxy-t.<\/p>\n

Zgjidhja e k\u00ebsaj detyre n\u00eb praktik\u00eb nuk \u00ebsht\u00eb aq e thjesht\u00eb \u2013 \u00ebsht\u00eb shum\u00eb e v\u00ebshtir\u00eb t\u00eb dallosh me sakt\u00ebsi p\u00ebrdoruesit e zakonsh\u00ebm nga cenzor\u00ebt q\u00eb fshehin identitetin e tyre. P\u00ebr t\u00eb fshehur informacionin p\u00ebrdoren mekanizma heuristik\u00eb. P\u00ebr shembull, Tor kufizon numrin e adresave IP t\u00eb bridge-ve, q\u00eb jan\u00eb t\u00eb disponueshme p\u00ebr klient\u00ebt, n\u00eb tre brenda nj\u00eb k\u00ebrkese. <\/p>\n

Kjo nuk e pengoi qeverin\u00eb kineze ta gjej\u00eb t\u00eb gjith\u00eb bridge-t e Tor-it n\u00eb nj\u00eb koh\u00eb t\u00eb shkurt\u00ebr. Implementimi i kufizimeve t\u00eb tjera do t\u00eb ndikonte ndjesh\u00ebm n\u00eb p\u00ebrdorshm\u00ebrin\u00eb e sistemit p\u00ebr kap\u00ebrcimin e bllokimeve, \u00e7ka do t\u00eb thot\u00eb se disa p\u00ebrdorues nuk do t\u00eb mund t\u00eb aksesojn\u00eb proxy. <\/p>\n

Si e zgjidh teoria e loj\u00ebrave k\u00ebt\u00eb problem<\/h2>\n

\nMetoda e p\u00ebrshkruar n\u00eb k\u00ebt\u00eb punim \u00ebsht\u00eb e bazuar n\u00eb at\u00eb q\u00eb quhet \"loj\u00eb e pranimit n\u00eb kolegj\" (college admissions game). P\u00ebr m\u00eb tep\u00ebr, supozohet q\u00eb agjent\u00ebt cenzor\u00eb t\u00eb internetit mund t\u00eb komunikojn\u00eb midis tyre n\u00eb koh\u00eb reale dhe t\u00eb p\u00ebrdorin taktika t\u00eb nd\u00ebrlikuara - p\u00ebr shembull, t\u00eb mos bllokojn\u00eb proxy-n\u00eb menj\u00ebher\u00eb apo ta b\u00ebjn\u00eb k\u00ebt\u00eb menj\u00ebher\u00eb var\u00ebsisht nga kushte t\u00eb ndryshme.<\/p>\n

Si funksionon pranimi n\u00eb kolegj
\n<\/h3>\n

\nSupozoni se kemi n student\u00eb dhe m kolegje. \u00c7do student p\u00ebrgatit list\u00ebn e tij t\u00eb preferencave midis institucioneve arsimore, t\u00eb bazuara n\u00eb disa kritere (dmth. renditen vet\u00ebm kolegjet ku jan\u00eb dor\u00ebzuar dokumentet). Nga ana tjet\u00ebr, kolegjet gjithashtu renditin student\u00ebt q\u00eb kan\u00eb dor\u00ebzuar dokumentet, sipas preferencave t\u00eb tyre.<\/p>\n

S\u00eb pari, kolegji p\u00ebrjashton ata q\u00eb nuk p\u00ebrmbushin kriteret e seleksionit - ata nuk do t\u00eb pranohen as n\u00eb rast t\u00eb n\u00ebnkryerjes. M\u00eb pas, ata q\u00eb jan\u00eb pranuar seleksionohen sipas nj\u00eb algoritmi q\u00eb merr parasysh parametrat e nevojsh\u00ebm. <\/p>\n

Mund t\u00eb ekzistoj\u00eb \"pranimi i paq\u00ebndruesh\u00ebm\" - p\u00ebr shembull, n\u00ebse kemi dy student\u00eb 1 dhe 2, t\u00eb cil\u00ebt jan\u00eb pranuar n\u00eb kolegje a dhe b p\u00ebrkat\u00ebsisht, por studenti i dyt\u00eb do t\u00eb d\u00ebshironte t\u00eb studionte n\u00eb universitetin a. N\u00eb rastin e eksperimentit t\u00eb p\u00ebrshkruar, jan\u00eb marr\u00eb parasysh vet\u00ebm lidhjet e q\u00ebndrueshme midis objekteve.<\/p>\n

Algoritmi i pranimit t\u00eb vonuar<\/h3>\n

\nSi \u00ebsht\u00eb th\u00ebn\u00eb m\u00eb par\u00eb, ekziston nj\u00eb num\u00ebr i caktuar student\u00ebsh q\u00eb kolegji nuk do t'i pranoj\u00eb n\u00eb asnj\u00eb rast. Prandaj, n\u00eb algoritmin e pranimit t\u00eb vonuar supozohet se k\u00ebtyre student\u00ebve nuk u lejohet t\u00eb paraqesin dokumentet e tyre n\u00eb k\u00ebt\u00eb institucion. N\u00eb k\u00ebt\u00eb m\u00ebnyr\u00eb, t\u00eb gjith\u00eb student\u00ebt p\u00ebrpiqen t\u00eb b\u00ebjn\u00eb pranimin n\u00eb ata kolegje q\u00eb i p\u00eblqejn\u00eb m\u00eb shum\u00eb.<\/p>\n

Institucioni arsimor me kapacitet q student\u00ebsh vendos n\u00eb list\u00ebn e pritjes q individ\u00eb me renditjen m\u00eb t\u00eb lart\u00eb sipas kritereve t\u00eb tij, ose t\u00eb gjith\u00eb, n\u00ebse numri i aplikant\u00ebve \u00ebsht\u00eb m\u00eb i vog\u00ebl se numri i vendeve t\u00eb lira. T\u00eb tjer\u00ebve u refuzohet regjistrimi, dhe k\u00ebta student\u00eb paraqesin dokumentet n\u00eb kolegjin e radh\u00ebs n\u00eb list\u00ebn e preferencave t\u00eb tyre. Ky kolegj gjithashtu selekton q student\u00eb me renditjen m\u00eb t\u00eb lart\u00eb nga ata q\u00eb kan\u00eb aplikuar menj\u00ebher\u00eb dhe ata q\u00eb nuk jan\u00eb pranuar n\u00eb kolegjin e par\u00eb. Po ashtu, p\u00ebrs\u00ebri nj\u00eb num\u00ebr i caktuar njer\u00ebzish nuk kalon. <\/p>\n

Procedura p\u00ebrfundon kur \u00e7do student ndodhet n\u00eb list\u00ebn e pritjes s\u00eb ndonj\u00eb kolegji ose \u00ebsht\u00eb refuzuar nga t\u00eb gjitha institucionet arsimore ku ai mund t\u00eb aplikohej. Si rezultat, kolegjet p\u00ebrfundimisht regjistrojn\u00eb t\u00eb gjith\u00eb ata n\u00eb listat e pritjes.<\/p>\n

\u00c7far\u00eb ka t\u00eb b\u00ebj\u00eb me proksin<\/h3>\n

\nPo ashtu si student\u00ebt dhe kolegjet, shkenc\u00ebtar\u00ebt i kan\u00eb rritur \u00e7do klient me nj\u00eb proksi t\u00eb caktuar. Lindi nj\u00eb loj\u00eb e quajtur loja e caktimit t\u00eb proksive. Klient\u00ebt, duke p\u00ebrfshir\u00eb agjent\u00ebt e mundsh\u00ebm t\u00eb censur\u00ebs, veprojn\u00eb si student\u00eb q\u00eb duan t\u00eb din\u00eb adres\u00ebn e proksit, i cili luan rolin e kolegjeve - ata kan\u00eb nj\u00eb kapacitet t\u00eb njohur paraprakisht. <\/p>\n

N\u00eb modelin e p\u00ebrshkruar ka n p\u00ebrdorues (klient\u00eb) A =
\n{a1, a2, ..., an}, q\u00eb k\u00ebrkojn\u00eb qasje n\u00eb proxy p\u00ebr t\u00eb anashkaluar bllokimet. K\u00ebshtu ai \u2013 \u00ebsht\u00eb identifikuesi i \u2018totalit\u2019 t\u00eb klientit. Mes k\u00ebtyre n p\u00ebrdoruesve, m \u2013 jan\u00eb agjent\u00ebt censurues, t\u00eb sh\u00ebnuar si J = {j1, j2, ..., jm}, t\u00eb tjer\u00ebt jan\u00eb p\u00ebrdorues t\u00eb zakonsh\u00ebm. T\u00eb gjith\u00eb m agjent\u00ebt kontrollohen nga nj\u00eb organ qendror dhe marrin udh\u00ebzime prej tij. <\/p>\n

Gjithashtu mendohet se ka nj\u00eb grup proxy P = {p1, p2, ..., pl}. Pas \u00e7do k\u00ebrkese, klienti merr nga objekti shp\u00ebrndar\u00ebs informacione (adresa IP) p\u00ebr k proxy. Koha ndahet n\u00eb Intervalet-Faza, t\u00eb sh\u00ebnuara si t (loj\u00ebn e fillon kur t=0). <\/p>\n

\u00c7do klient p\u00ebrdor nj\u00eb funksion vler\u00ebsimi p\u00ebr t\u00eb vler\u00ebsuar proksit. Shkenc\u00ebtar\u00ebt p\u00ebrdor\u00ebn funksionin \"K\u00ebrkimi:, p\u00ebr t\u00eb sh\u00ebnuar pik\u00ebn q\u00eb p\u00ebrdoruesi ai i dha proxy px n\u00eb faz\u00ebn t. Gjithashtu, \u00e7do proxy p\u00ebrdor nj\u00eb funksion p\u00ebr t\u00eb vler\u00ebsuar klient\u00ebt. K\u00ebshtu, \"K\u00ebrkimi: \u2013 pika q\u00eb proxy px i dha klientit ai n\u00eb faz\u00ebn t.<\/p>\n

\u00cbsht\u00eb e r\u00ebnd\u00ebsishme t\u00eb mbani mend se e gjith\u00eb loja \u00ebsht\u00eb virtuale, dometh\u00ebn\u00eb n\u00eb em\u00ebr t\u00eb proxy-ve dhe klient\u00ebve luan vet\u00eb \"distribucioni\". P\u00ebr k\u00ebt\u00eb, nuk \u00ebsht\u00eb e nevojshme t\u00eb dihet lloji i klientit, preferencat e tyre p\u00ebr proxy. N\u00eb \u00e7do faz\u00eb ndodh loja, gjithashtu p\u00ebrdoret nj\u00eb algorit\u00ebm i prishjes s\u00eb vonuar. <\/p>\n

Rezultatet<\/h2>\n

\nSipas rezultateve t\u00eb simulimeve, metoda q\u00eb p\u00ebrdor teorin\u00eb e loj\u00ebrave tregoi nj\u00eb eficienc\u00eb m\u00eb t\u00eb lart\u00eb n\u00eb krahasim me sistemet e njohura p\u00ebr kalimin e bllokimeve.<\/p>\n

\"K\u00ebrkimi:
\n
\nKrahasimi me sh\u00ebrbimin VPN rBridge<\/i><\/p>\n

N\u00eb k\u00ebt\u00eb kuad\u00ebr, studiuesit e dalluan disa pika t\u00eb r\u00ebnd\u00ebsishme q\u00eb mund t\u00eb ndikojn\u00eb n\u00eb cil\u00ebsin\u00eb e pun\u00ebs s\u00eb k\u00ebtyre sistemeve:<\/p>\n