💳 Maaliyadda — hawlgalka lacag-bixinta Qaabka tooska ah

Aasaas — moodelka ka dambeeya tirooyinka

Xiriir kasta oo jilaha isticmaalo, iyo ilaha uu ka yimid. Mudnaanta lagu calaamadiyay malo-awaal waa hagaajin muunad ah.

Macaamilada cusub waxay imaanayaan heer salka ah oo la dhufto kororka iibka; tirada daqiiqadiiba waa aan la saadaalin karin (Poisson, qiyaas caadi ah) oo leh dhawr burbur.

λ(t) = base × surge(t) (2-min lag); count/min ≈ N(60λ, √(60λ)) × (1 + N(0, 0.03))[2]Malo-awaal: tirada boosaska, waqtiyada adeegga iyo bixiyaha, kala-saarida dhibcaha, heerarka ka gudubka xaqiijinta dheeraadka ah, qaybta shaqada lumay, qadarka iyo qiimaha waa qiyam muunad ah oo loogu talagalay switch cabbir dhexdhexaad ah, ma aha tirooyin shabakad dhab ah.

Dhibcaha khayaanada ee laba-caadi ah: dhibcaha macmiilka sharciga ah iyo khayaanada waa laba qalooc oo caadi ah oo d′ kala fog; xaddu wuxuu doortaa barta qalooca ROC.

genuine score ~ N(0,1), fraud ~ N(d′,1), d′ = 2.5; FPR(t) = 1 − Φ(t), TPR(t) = 1 − Φ(t − d′); AUC = Φ(d′/√2) ≈ 0.96[6][7]Malo-awaal: tirada boosaska, waqtiyada adeegga iyo bixiyaha, kala-saarida dhibcaha, heerarka ka gudubka xaqiijinta dheeraadka ah, qaybta shaqada lumay, qadarka iyo qiimaha waa qiyam muunad ah oo loogu talagalay switch cabbir dhexdhexaad ah, ma aha tirooyin shabakad dhab ah.

Xadka kharashka ugu fiican: diid marka isku-dheelitirka suurtagalnimadu ka sarreeyo isku-dheelitirka kharashka oo lagu miisaamay heerka salka — khayaano toban jibaar ka badan wuxuu xadka hoos u kaxeeyaa ln 10 / d′ ≈ 0.9σ.

decline when e^(d′x − d′²/2) ≥ (1 − π)·c_FP / (π·c_FN) ⇒ t* = [ln((1 − π)c_FP/(π c_FN)) + d′²/2] / d′[8][7]

Xaqiijinta dheeraadka ah: dhibcaha xariijinta xadka hoostiisa waa la caqabadeeyaa halkii la go'aamin lahaa.

scores in [t − b, t) are challenged: genuine pass 85 %, fraud pass 5 %; scores ≥ t declined[10]Malo-awaal: tirada boosaska, waqtiyada adeegga iyo bixiyaha, kala-saarida dhibcaha, heerarka ka gudubka xaqiijinta dheeraadka ah, qaybta shaqada lumay, qadarka iyo qiimaha waa qiyam muunad ah oo loogu talagalay switch cabbir dhexdhexaad ah, ma aha tirooyin shabakad dhab ah.

Dib-u-dhaca bixiyuhu waa mid isa-sii-yaraanaya; boosku waa la haystaa dib-u-dhaca ama waqti-dhammaadka, kuwaas oo ka horreeya.

L ~ Exp(mean m); E[min(L, T)] = m(1 − e^(−T/m)), P(L > T) = e^(−T/m); S = 80 ms + forwarded × Σ share·E[min(L,T)][2][9]

Sharciga Little: boosaska mashquulka ah = heerka imaanshaha × waqtiga hayntu.

busy slots = λ·S (Little) ⇒ utilization = λ·S / (32 × servers)[3]

Erlang C: fursadda macaamilku sugayo boos bannaan, iyo fursadda uu sugayo wax ka badan waqti-dhammaadka safka ee 2 s.

P(W > 2 s) = C(a, N)·e^(−(N/S − λ)·2 s), a = λS; mean wait = C / (N/S − λ)[1][2]

Awoodda ka sarraysa switch-ku wuxuu sidoo kale shaqo ku lumiyaa codsiyo dambe tuurto, sidaa darteed kala-goysyada waxtarka leh wuu hoos u dhacaa marka culayska kordho; tuurista culayskuna dheeraadka si jaban ayay u diidaa.

λ ≥ N/S: goodput = (N/S − ω·λ)/(1 − ω), ω = 0.3; load shedding admits ≤ 0.9·N/S and answers the rest at once[4][5]Malo-awaal: tirada boosaska, waqtiyada adeegga iyo bixiyaha, kala-saarida dhibcaha, heerarka ka gudubka xaqiijinta dheeraadka ah, qaybta shaqada lumay, qadarka iyo qiimaha waa qiyam muunad ah oo loogu talagalay switch cabbir dhexdhexaad ah, ma aha tirooyin shabakad dhab ah.

Dib-isku-dayga macmiilka: fashil farsamo kasta waxaa la dib-isku-dayaa ilaa saddex jeer, isla markiiba ama dib-u-dhigid isa-sii-kordhisa oo aan ka mid ahayn.

failed attempt → retry with p = 0.95, ≤ 3 retries; immediate: next minute; backoff: delay ~ Exp(mean 1, 2, 4 min)[4][5]Malo-awaal: tirada boosaska, waqtiyada adeegga iyo bixiyaha, kala-saarida dhibcaha, heerarka ka gudubka xaqiijinta dheeraadka ah, qaybta shaqada lumay, qadarka iyo qiimaha waa qiyam muunad ah oo loogu talagalay switch cabbir dhexdhexaad ah, ma aha tirooyin shabakad dhab ah.

Waqti-dhammaadka bixiyaha, buriska iyo oggolaanshaha beddelka: qadarku waa lognormal, sidaa darteed qaybta xadka ka hooseysa iyo cabbirka la oggolaaday waxay ka soo baxaan shaqada qaybinta caadiga ah.

issuer timeout → reversal; stand-in approves if amount ≤ limit: P = Φ((ln L − μ)/σ), volume = e^(μ+σ²/2)·Φ((ln L − μ − σ²)/σ)[9][11]

Heerka khayaanada oo ah dhibco aasaas ah oo qadarka la oggolaaday; 13 bp waxaa loo isticmaalaa cabbir tixraac ah ee lacag-bixinta kaarka yar ee fog.

fraud rate = approved fraud amount / approved amount × 10,000 bp (reference scale: 13 bp)[10]

Joogteyaal kale oo hawlgal oo moodelku isticmaalo.

32 slots per server, 2–24 servers, +5 min boot, 6 u per server-hour · switch time 80 ms · queue timeout 2 s · issuer latency 250 ms (group B = 25 % of traffic, ±15 % per minute) · amounts lognormal, median 40 u, σ = 1, fraud ×1.5 · ω = 0.3 · shedding at 90 % · reversal = 80 ms of switch timeMalo-awaal: tirada boosaska, waqtiyada adeegga iyo bixiyaha, kala-saarida dhibcaha, heerarka ka gudubka xaqiijinta dheeraadka ah, qaybta shaqada lumay, qadarka iyo qiimaha waa qiyam muunad ah oo loogu talagalay switch cabbir dhexdhexaad ah, ma aha tirooyin shabakad dhab ah.

Aan-kala-sooc: abuurahaha mulberry32 oo abuur leh; qaybinta la isticmaalay — isku-mid, tibaax (CDF rogan), caadi (Box–Muller), Poisson (Knuth). Abuurka waa la muujiyaa waana la wadaagi karaa.

Ilaha

1. Teletraffic Engineering Handbook — Erlang C formula; waiting-time distribution for M/M/n, FCFS — ITU-D Study Group 2 Question 16/2 (V. B. Iversen), 2005
2. M. Harchol-Balter — Performance Modeling and Design of Computer Systems: Queueing Theory in Action (M/M/k, capacity provisioning) — Cambridge University Press, 2013
3. J. D. C. Little — A Proof for the Queuing Formula: L = λW — Operations Research 9(3):383–387, 1961
4. Site Reliability Engineering — Ch. 22 Addressing Cascading Failures (retries, randomized exponential backoff, load shedding, work on requests past their deadline) — Beyer, Jones, Petoff, Murphy (eds.), O'Reilly, 2016
5. N. Bronson, A. Aghayev, A. Charapko, T. Zhu — Metastable Failures in Distributed Systems — HotOS ’21, ACM, 2021
6. T. Fawcett — An introduction to ROC analysis — Pattern Recognition Letters 27(8):861–874, 2006
7. R. J. Bolton, D. J. Hand — Statistical Fraud Detection: A Review — Statistical Science 17(3):235–255, 2002
8. C. Elkan — The Foundations of Cost-Sensitive Learning — IJCAI 2001, 2001
9. ISO 8583-1:2003 Financial transaction card originated messages — Interchange message specifications — Part 1 (authorization, reversal messages) — ISO/TC 68/SC 9, 2003
10. Commission Delegated Regulation (EU) 2018/389 — RTS on strong customer authentication, Annex: reference fraud rates (0.13 % for remote card payments up to EUR 100) — Official Journal of the European Union, 2018
11. N. L. Johnson, S. Kotz, N. Balakrishnan — Continuous Univariate Distributions, Vol. 1 (lognormal distribution, partial moments) — Wiley, 1994