Performance bounds for rate envelope multiplexing

Parsimonious estimates of bandwidth requirement for quality of service packet networks

“…Applying this method, in our earlier works we have developed efficient conservative bounds on P sat , WLR, and based on them computationally equivalent formulae have been derived for bounding C equ,sat and C equ,WLR [12,19]. 3 Later, it has also been shown, that an improved approximation technique [17] on buffer overflow probability known in buffered statistical multiplexer can also be applied to approximate P sat under bffm.…”

“…(3). Applying the Chernoff bounding technique for the saturation probability and workload loss ratio, the following conservative bounds can be obtained for the corresponding bandwidth requirement [12,19]:…”

Dynamic Call Admission Control for Centralized CDMA Systems

“…In case of two ring model K = 1 + 6 + 12 = 19. Cell 2-7 belong to the first neighboring ring while the second ring consists of cell [8][9][10][11][12][13][14][15][16][17][18][19]. Therefore, cell 2-19 form the interference region for a mobile located in cell 1.…”

“…One of the most promising classes of algorithms among them is based on Effective Bandwidth concept which was originally introduced for wired networking CAC, [1,2,11,14,15,17]. The aim of this paper is to introduce a promising solution for dynamic CAC.…”

“…The aim of this paper is to introduce a promising solution for dynamic CAC. Inequality (11) represents the well-known tail distribution estimation problem. Because the calculation of convolution is rather time consuming task so the theoretical amount of required capacity is approximated by deterministic values.…”