z-logo
open-access-imgOpen Access
On time to buffer saturation in a GI/M/1/N-type queue
Author(s) -
Wojciech M. Kempa
Publication year - 2012
Publication title -
international journal of advances in telecommunications electrotechnics signals and systems
Language(s) - English
Resource type - Journals
ISSN - 1805-5443
DOI - 10.11601/ijates.v1i2-3.15
Subject(s) - erlang distribution , erlang (programming language) , poisson distribution , exponential distribution , queue , queueing system , saturation (graph theory) , mathematics , queueing theory , buffer (optical fiber) , exponential function , computer science , combinatorics , statistics , mathematical analysis , computer network , theoretical computer science , functional programming , telecommunications

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom