Modeling Erlang's ideal grading with multirate BPP traffic (Q1954792)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Modeling Erlang's ideal grading with multirate BPP traffic |
scientific article; zbMATH DE number 6173295
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Modeling Erlang's ideal grading with multirate BPP traffic |
scientific article; zbMATH DE number 6173295 |
Statements
Modeling Erlang's ideal grading with multirate BPP traffic (English)
0 references
11 June 2013
0 references
Summary: We present a complete methodology for modeling gradings (also called non-full-availability groups) servicing single-service and multi-service traffic streams. The methodology worked out by the authors makes it possible to determine traffic characteristics of various types of gradings with state-dependent call arrival processes, including a new proposed structure of the Erlang's Ideal Grading with the multirate links. The elaborated models of the gradings can be used for modeling different systems of modern networks, for example, the radio interfaces of the UMTS system, switching networks carrying a mixture of different multirate traffic streams, and video-on-demand systems. The results of the analytical calculations are compared with the results of the simulation data for selected gradings, which confirm high accuracy of the proposed methodology.
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.7417157888412476
0 references
0.7360799908638
0 references
0.7071262001991272
0 references
0.7070470452308655
0 references
0.7070056200027466
0 references