{"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":"Studim: krijimi i nj\u00eb sh\u00ebrbimi proxy rezistent ndaj bllokimeve p\u00ebrmes teoris\u00eb s\u00eb loj\u00ebrave","gt_translate_keys":[{"key":"rendered","format":"text"}]},"content":{"rendered":"

\"Studim:<\/a><\/noindex><\/p>\n

Para disa vjet\u00ebsh, nj\u00eb grup nd\u00ebrkomb\u00ebtar shkenc\u00ebtar\u00ebsh nga universitetet e Masachusetsit, Pensilvanis\u00eb dhe Mynihut n\u00eb Gjermani kreu<\/a><\/noindex> nj\u00eb studim mbi efikasitetin 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 anashkaluar bllokimet, t\u00eb bazuar n\u00eb teorin\u00eb e loj\u00ebrave. Ne p\u00ebrgatit\u00ebm 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 anashkalimin e bllokimeve, si Tor, \u00ebsht\u00eb e bazuar n\u00eb shp\u00ebrndarjen private dhe selektive t\u00eb adresave IP t\u00eb proksive mes klient\u00ebve nga rajonet q\u00eb p\u00ebrballen me bllokime. Si rezultat, klient\u00ebt duhet t\u00eb mbeten t\u00eb paditur nga organizmat ose autoritetet q\u00eb vendosin bllokime. N\u00eb rastin e Tor, k\u00ebto shp\u00ebrndar\u00ebs proksie quhen ura. <\/p>\n

Problemi kryesor me sh\u00ebrbime t\u00eb tilla \u00ebsht\u00eb sulmi i brendsh\u00ebm. Agjent\u00ebt q\u00eb merren me bllokimin mund t\u00eb p\u00ebrdorin gjithashtu proksit\u00eb p\u00ebr t\u00eb zbuluar adresat e tyre dhe p\u00ebr t'i bllokuar ato. P\u00ebr t\u00eb minimizuar mund\u00ebsin\u00eb e identifikimit t\u00eb proksive, mjetet e anashkalimit 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-heuristika, e cila mund t\u00eb anashkalohet. P\u00ebr t\u00eb zgjidhur k\u00ebt\u00eb problem, shkenc\u00ebtar\u00ebt vendos\u00ebn t\u00eb paraqesin luft\u00ebn e sh\u00ebrbimeve q\u00eb merren me bllokimin dhe sh\u00ebrbimeve p\u00ebr ta anashkaluar at\u00eb si nj\u00eb loj\u00eb. Duke p\u00ebrdorur teorin\u00eb e loj\u00ebrave, ata zhvilluan strategji optimale p\u00ebr secil\u00ebn nga pal\u00ebt - ve\u00e7an\u00ebrisht, kjo i lejoi q\u00eb t\u00eb krijonin nj\u00eb mekaniz\u00ebm p\u00ebr shp\u00ebrndarjen e proksive.<\/p>\n

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

\nVeglat p\u00ebr anashkalimin e bllokimeve, si Tor, Lantern dhe Psiphon, p\u00ebrdorin nj\u00eb s\u00ebr\u00eb proksish jasht\u00eb rajonit me kufizime t\u00eb vendosura, t\u00eb cilat p\u00ebrdoren p\u00ebr t\u00eb nd\u00ebrruar 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 - p\u00ebr shembull, pasi ata vet\u00eb e p\u00ebrdorin at\u00eb - \u00ebsht\u00eb e leht\u00eb ta vendosin at\u00eb n\u00eb nj\u00eb list\u00eb t\u00eb zez\u00eb dhe ta bllokojn\u00eb. Prandaj, n\u00eb realitet, adresat IP t\u00eb k\u00ebtyre proksive kurr\u00eb nuk iu japin publikut, dhe ndarja e p\u00ebrdoruesve n\u00eb at\u00eb ose k\u00ebt\u00eb proksi b\u00ebhet p\u00ebrmes mekanizmave t\u00eb ndrysh\u00ebm. P\u00ebr shembull, n\u00eb Tor ekziston nj\u00eb sistem bridge. <\/p>\n

Kjo do t\u00eb thot\u00eb se detyra kryesore \u00ebsht\u00eb t\u00eb ofrohet p\u00ebrdoruesve qasje n\u00eb burime t\u00eb bllokuara, dhe t\u00eb minimalizohet probabiliteti i zbulohet adres\u00ebs s\u00eb proksi.<\/p>\n

Zgjidhja e k\u00ebsaj \u00e7\u00ebshtjeje n\u00eb praktik\u00eb nuk \u00ebsht\u00eb aq e leht\u00eb \u2013 me sakt\u00ebsi t\u00eb lart\u00eb t\u00eb dallosh p\u00ebrdoruesit normal\u00eb nga cenzor\u00ebt q\u00eb jan\u00eb duke iu fshehur atyre, \u00ebsht\u00eb shum\u00eb e v\u00ebshtir\u00eb. P\u00ebr t\u00eb fshehur informacionin p\u00ebrdoren mekanizma heuristik\u00eb. P\u00ebr shembull, Tor kufizon numrin e adresave IP t\u00eb bridges q\u00eb i jan\u00eb n\u00eb dispozicion klient\u00ebve, n\u00eb tre brenda nj\u00eb k\u00ebrkese. <\/p>\n

Kjo nuk e pengoi qeverin\u00eb kineze t\u00eb lokalizoj\u00eb t\u00eb gjitha Tor-bridg\u00ebt p\u00ebr nj\u00eb koh\u00eb t\u00eb shkurt\u00ebr. Vendosja e kufizimeve t\u00eb tjera do t\u00eb ndikonte ndjesh\u00ebm n\u00eb p\u00ebrdorshm\u00ebrin\u00eb e sistemit p\u00ebrkalues t\u00eb bllokadave, do t\u00eb thot\u00eb se disa p\u00ebrdorues nuk do t\u00eb mund t\u00eb ken\u00eb qasje n\u00eb proksi. <\/p>\n

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

\nMetoda e p\u00ebrshkruar n\u00eb k\u00ebt\u00eb pun\u00eb \u00ebsht\u00eb e bazuar n\u00eb at\u00eb q\u00eb quhet \u2018loj\u00eb e pranimit n\u00eb kolegj\u2019 (college admissions game). P\u00ebr m\u00eb tep\u00ebr, supozohet se agjent\u00ebt e cenzur\u00ebs n\u00eb internet mund t\u00eb komunikojn\u00eb me nj\u00ebri-tjetrin n\u00eb koh\u00eb reale dhe t\u00eb p\u00ebrdorin nj\u00eb taktik\u00eb t\u00eb avancuar \u2013 p\u00ebr shembull, t\u00eb mos bllokojn\u00eb proksit menj\u00ebher\u00eb ose ta b\u00ebjn\u00eb k\u00ebt\u00eb menj\u00ebher\u00eb n\u00eb var\u00ebsi t\u00eb kushteve t\u00eb ndryshme.<\/p>\n

Si p\u00ebr organizohet pranimi n\u00eb kolegj
\n<\/h3>\n

\nSupozoni se kemi n student\u00eb dhe m kolegje. \u00c7do student harton list\u00ebn e tij t\u00eb preferencave p\u00ebr institucionet 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 rendisin student\u00ebt q\u00eb kan\u00eb d\u00ebrguar dokumentet, sipas preferencave t\u00eb tyre.<\/p>\n

S\u00eb pari, kolegji heq ata q\u00eb nuk p\u00ebrmbushin kriteret e p\u00ebrzgjedhjes \u2013 ata nuk do t\u00eb pranohen madje as n\u00eb rast se ka mungesa. M\u00eb pas, pranimet filtrohen sipas nj\u00eb algoritmi q\u00eb merr parasysh parametrat e nevojsh\u00ebm. <\/p>\n

Mund t\u00eb ekzistojn\u00eb \"pranime t\u00eb paq\u00ebndrueshme\" \u2013 p\u00ebr shembull, n\u00ebse ka dy student\u00eb 1 dhe 2, t\u00eb cil\u00ebt jan\u00eb pranuar n\u00eb kolegjet a dhe b p\u00ebrkat\u00ebsisht, por studenti i dyt\u00eb do t\u00eb donte t\u00eb studionte n\u00eb universitetin a. N\u00eb rastin e eksperimentit t\u00eb p\u00ebrshkruar, u mor\u00ebn parasysh vet\u00ebm lidhjet stabile midis objekteve.<\/p>\n

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

\nSi ishte th\u00ebn\u00eb m\u00eb par\u00eb, ekziston nj\u00eb num\u00ebr student\u00ebsh q\u00eb kolegji nuk do t'i pranoj\u00eb n\u00ebn asnj\u00eb rrethan\u00eb. Prandaj, n\u00eb algoritmin e pranimit t\u00eb vonuar, supozohet se k\u00ebtyre student\u00ebve nuk u lejohet t\u00eb dor\u00ebzojn\u00eb dokumente n\u00eb k\u00ebt\u00eb universitet. N\u00eb k\u00ebt\u00eb rast, t\u00eb gjith\u00eb student\u00ebt p\u00ebrpiqen t\u00eb regjistrohen n\u00eb kolegjet q\u00eb u p\u00eblqejn\u00eb m\u00eb shum\u00eb.<\/p>\n

Institucioni arsimor me kapacitet q student\u00ebsh vendos n\u00eb list\u00ebn e prisnin q persona 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, dhe k\u00ebta student\u00eb dor\u00ebzojn\u00eb dokumente n\u00eb universitetin e ardhsh\u00ebm nga lista e preferencave t\u00eb tyre. Ky kolegj gjithashtu p\u00ebrzgjedh q student\u00eb me renditjen m\u00eb t\u00eb lart\u00eb mes atyre q\u00eb dor\u00ebzuan dokumentet menj\u00ebher\u00eb dhe atyre q\u00eb nuk u pranuan n\u00eb kolegjin e par\u00eb. P\u00ebrs\u00ebri, nj\u00eb far\u00eb numri i njer\u00ebzve nuk kalon. <\/p>\n

Procedura p\u00ebrfundon n\u00ebse \u00e7do student \u00ebsht\u00eb n\u00eb list\u00ebn e prisnin t\u00eb nj\u00eb kolegji ose i \u00ebsht\u00eb refuzuar n\u00eb t\u00eb gjitha institucionet arsimore ku ai mund t\u00eb regjistrohet. N\u00eb fund, kolegjet regjistrojn\u00eb p\u00ebrfundimisht t\u00eb gjith\u00eb nga listat e tyre t\u00eb pritjes.<\/p>\n

\u00c7far\u00eb ka lidhje k\u00ebtu me proxy<\/h3>\n

\nP\u00ebr t\u00eb nj\u00ebjt\u00ebn m\u00ebnyr\u00eb si student\u00ebt dhe kolegjet, shkenc\u00ebtar\u00ebt u ndan\u00eb secilit klient nj\u00eb proxy t\u00eb caktuar. K\u00ebshtu u krijua nj\u00eb loj\u00eb e quajtur loja e caktimit t\u00eb proksive. Klient\u00ebt, duke p\u00ebrfshir\u00eb agjent\u00ebt e mundsh\u00ebm cenzor\u00eb, veprojn\u00eb si student\u00eb q\u00eb duan t\u00eb zbulojn\u00eb adres\u00ebn e proxy-t, e cila vepron si kolegje \u2013 ata kan\u00eb nj\u00eb kapacitet maksimal 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 \u201es\u00eb ardhmes\u201c s\u00eb klientit. Nd\u00ebr k\u00ebta n p\u00ebrdorues, m \u2013 jan\u00eb agjent\u00ebt - cenzor\u00eb, 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 instruksione prej tij. <\/p>\n

Gjithashtu konsiderohet se ka nj\u00eb grup proxy P = {p1, p2, …, pl}. Pas \u00e7do k\u00ebrkese, klienti merr nga objekti shp\u00ebrndar\u00ebs informacion (adres\u00ebn IP) p\u00ebr k proxy. Koha ndahet n\u00eb intervale - faza, t\u00eb sh\u00ebnuara si t (loja fillon kur t = 0). <\/p>\n

\u00c7do klient p\u00ebrdor nj\u00eb funksion skoringu p\u00ebr t\u00eb vler\u00ebsuar proksit. Shkenc\u00ebtar\u00ebt p\u00ebrdor\u00ebn funksionin \"Studim:, p\u00ebr t\u00eb sh\u00ebnuar rezultatin q\u00eb p\u00ebrdoruesi ai i ka dh\u00ebn\u00eb proxy px n\u00eb faz\u00ebn t. Nd\u00ebrkoh\u00eb, \u00e7do proxy p\u00ebrdor nj\u00eb funksion p\u00ebr t\u00eb vler\u00ebsuar klient\u00ebt. Pra, \"Studim: \u2013 rezultati q\u00eb proxy px i ka dh\u00ebn\u00eb klientit ai n\u00eb faz\u00ebn t.<\/p>\n

\u00cbsht\u00eb e r\u00ebnd\u00ebsishme t\u00eb mbahet mend se e gjith\u00eb loja \u00ebsht\u00eb virtuale, pra n\u00eb t\u00eb luan vet\u00eb \u00abdistribuesi\u00bb n\u00eb em\u00ebr t\u00eb proxy-ve dhe klient\u00ebve. P\u00ebr k\u00ebt\u00eb, nuk nevojitet t\u00eb dihet tipi i klientit, preferencat e tyre p\u00ebr proxy. N\u00eb \u00e7do faz\u00eb ndodh loja, gjithashtu p\u00ebrdoret nj\u00eb algorit\u00ebm i pranimit t\u00eb vonuar. <\/p>\n

Rezultatet<\/h2>\n

\nSipas rezultateve t\u00eb simulimeve, metoda q\u00eb p\u00ebrdor teorin\u00eb e lojrave tregoi eficienc\u00eb m\u00eb t\u00eb lart\u00eb n\u00eb krahasim me sistemet e njohura t\u00eb anashkalimit t\u00eb bllokimeve.<\/p>\n

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

N\u00eb t\u00eb nj\u00ebjt\u00ebn koh\u00eb, shkenc\u00ebtar\u00ebt identifikuan disa pika t\u00eb r\u00ebnd\u00ebsishme q\u00eb mund t\u00eb ndikojn\u00eb n\u00eb cil\u00ebsin\u00eb e funksionimit t\u00eb k\u00ebtyre sistemeve:<\/p>\n