Skip to content

fast-engset

Choose a tag to compare

@parsiad parsiad released this 31 Oct 03:43
· 16 commits to master since this release

fast-engset

Python code to compute the blocking probability P in the Engset model:

                         m
         binom{N - 1}{m}M                            E/N
P = --------------------------    where    M = ---------------.
     __ m                    X                  1 - E/N(1 - P)
    \        binom{N - 1}{X}M
    /__ X = 0

N denotes the number of sources, m the number of servers, and E the offered traffic from all sources.

E is the total offered traffic given by E = N * alpha, where alpha is the offered traffic per-source.

Installation

pip install fast_engset

Example

from fast_engset import fe

m     = 5          # Number of servers
N     = 10         # Number of sources
alpha = 0.2        # Offered traffic from a SINGLE source
E     = N * alpha  # Total offered traffic from ALL sources

# Blocking probability
P = fe.compute(m, N, E)