Efficient blocking probability computation of complex traffic flows for network dimensioning (Q925826): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4894817 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5485393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A nonstationary offered-load model for packet networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on conditional probabilities with applications in multi-user communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sharp concentration inequality with applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concentration inequalities for functions of independent variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3720271 / rank
 
Normal rank

Latest revision as of 09:42, 28 June 2024

scientific article
Language Label Description Also known as
English
Efficient blocking probability computation of complex traffic flows for network dimensioning
scientific article

    Statements

    Efficient blocking probability computation of complex traffic flows for network dimensioning (English)
    0 references
    0 references
    23 May 2008
    0 references
    blocking probability
    0 references
    link utilization
    0 references
    multirate traffic
    0 references
    network design
    0 references
    network dimensioning
    0 references
    network optimization
    0 references

    Identifiers