SFWRENG 4E03 Study Guide - Final Guide: Jackson Network, Memorylessness, Poisson Point Process

• School: McMaster University
• Department: Software Engineering
• Course: SFWRENG 4E03
• Professor: Kemal Ahmed

Document Summary

Note: material covered in stats 3y03 summary will not be covered in this summary. To find a unit ctrl-f (cid:862)[](cid:863), e. g. fo(cid:396) nu(cid:373)(cid:271)e(cid:396) of jo(cid:271)s i(cid:374) s(cid:455)ste(cid:373), ctrl-f (cid:862)[n](cid:863) Do(cid:374)"t (cid:272)ha(cid:374)ge p(cid:396)o(cid:271)a(cid:271)ilit(cid:455), but square x for calculation only. Cumulative distribution function (cdf) [f(cid:894)(cid:454)(cid:895)]: cdf = pdf, i. e. (cid:1005) e (cid:644)(cid:454) Pdf: 1 / (b a) , a (cid:1095) x (cid:1095) b. Variance: n p (1 p) Probability distribution function (pdf) [p(x)]: (n c x)px(1 p)n x. Cumulative distribution function (cdf) [f(x)]: x i. Device [i]: units that are in terms of i are specific to an individual device or node within a system. Service time [s]: time per specific job (cid:1005)/(cid:645) Visitation [v]: given or projected visits/jobs (closed system); cannot be calculated; basically a probability. Demand [d]: total service time for all jobs. Time in system [t]: time the job is in the system. Response time [r]: time the job is being processed in the system.