{"action":"published","release":{"url":"https://api.github.com/repos/parsiad/fast-engset/releases/4522972","assets_url":"https://api.github.com/repos/parsiad/fast-engset/releases/4522972/assets","upload_url":"https://uploads.github.com/repos/parsiad/fast-engset/releases/4522972/assets{?name,label}","html_url":"https://github.com/parsiad/fast-engset/releases/tag/v2.4.0","id":4522972,"tag_name":"v2.4.0","target_commitish":"master","name":"fast-engset","draft":false,"author":{"login":"parsiad","id":79781,"avatar_url":"https://avatars.githubusercontent.com/u/79781?v=3","gravatar_id":"","url":"https://api.github.com/users/parsiad","html_url":"https://github.com/parsiad","followers_url":"https://api.github.com/users/parsiad/followers","following_url":"https://api.github.com/users/parsiad/following{/other_user}","gists_url":"https://api.github.com/users/parsiad/gists{/gist_id}","starred_url":"https://api.github.com/users/parsiad/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/parsiad/subscriptions","organizations_url":"https://api.github.com/users/parsiad/orgs","repos_url":"https://api.github.com/users/parsiad/repos","events_url":"https://api.github.com/users/parsiad/events{/privacy}","received_events_url":"https://api.github.com/users/parsiad/received_events","type":"User","site_admin":false},"prerelease":false,"created_at":"2016-10-31T03:43:19Z","published_at":"2016-10-31T03:43:58Z","assets":[],"tarball_url":"https://api.github.com/repos/parsiad/fast-engset/tarball/v2.4.0","zipball_url":"https://api.github.com/repos/parsiad/fast-engset/zipball/v2.4.0","body":"fast-engset\r\n===========\r\n\r\nPython code to compute the blocking probability ```P``` in the Engset model:\r\n\r\n```\r\n                         m\r\n         binom{N - 1}{m}M                            E/N\r\nP = --------------------------    where    M = ---------------.\r\n     __ m                    X                  1 - E/N(1 - P)\r\n    \\        binom{N - 1}{X}M\r\n    /__ X = 0\r\n```\r\n\r\n```N``` denotes the number of *sources*, ```m``` the number of *servers*, and ```E``` the *offered traffic* from __all__ sources.\r\n\r\n```E``` is the *total offered traffic* given by ```E = N * alpha```, where ```alpha``` is the *offered traffic per-source*.\r\n\r\nInstallation\r\n=======\r\n`pip install fast_engset`\r\n\r\nExample\r\n=======\r\n\r\n```python\r\nfrom fast_engset import fe\r\n\r\nm     = 5          # Number of servers\r\nN     = 10         # Number of sources\r\nalpha = 0.2        # Offered traffic from a SINGLE source\r\nE     = N * alpha  # Total offered traffic from ALL sources\r\n\r\n# Blocking probability\r\nP = fe.compute(m, N, E)\r\n```\r\n\r\nCitation\r\n========\r\n\r\nIf you are using this in an academic work, please cite the corresponding paper:\r\n\r\n```\r\n@article{azimzadeh2015fast,\r\n  title={Fast Engset computation},\r\n  author={Azimzadeh, Parsiad and Carpenter, Tommy},\r\n  journal={Operations Research Letters},\r\n  volume={44},\r\n  number={3},\r\n  pages={313--318},\r\n  year={2016},\r\n  issn={0167-6377},\r\n  doi={10.1016/j.orl.2016.02.011},\r\n  url={http://dx.doi.org/10.1016/j.orl.2016.02.011}\r\n}\r\n```"}}
{"actor":{"display_login":"parsiad"}}