2006
DOI: 10.1002/dac.748
|View full text |Cite
|
Sign up to set email alerts
|

Engset multi-rate state-dependent loss models with QoS guarantee

Abstract: SUMMARYWe consider a single link loss system of quasi-random input, described by the Engset multirate loss model (EnMLM). Blocked calls may once reattempt to be connected to the system requiring less bandwidth; then the system is described by the single retry model for finite sources (f-SRM). The EnMLM and the f-SRM are extended with the single threshold finite source model (f-STM), where calls may attempt to be connected to the system with less bandwidth requirements, according to the link occupancy, before b… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
16
0

Year Published

2011
2011
2019
2019

Publication Types

Select...
2
2
2

Relationship

1
5

Authors

Journals

citations
Cited by 22 publications
(16 citation statements)
references
References 14 publications
0
16
0
Order By: Relevance
“…To the best of our knowledge, most of the studies on finite queues with losses consider Engset models and are mainly concerned with formulas for the blocking probability in the multi-server queues with exponential service times (Dahmouni et al 2005;Moscholios and Logothetis 2006;Overby 2005;Zukerman et al 2004). In these models it is assumed that the customers are ready to produce new calls immediately after the failures.…”
Section: Introductionmentioning
confidence: 99%
“…To the best of our knowledge, most of the studies on finite queues with losses consider Engset models and are mainly concerned with formulas for the blocking probability in the multi-server queues with exponential service times (Dahmouni et al 2005;Moscholios and Logothetis 2006;Overby 2005;Zukerman et al 2004). In these models it is assumed that the customers are ready to produce new calls immediately after the failures.…”
Section: Introductionmentioning
confidence: 99%
“…The accuracy of the new model is verified by simulation. Extensions of the CDTM for quasi-random traffic and the BR policy appear in [9,10]. Finally, we generalize the proposed model by incorporating service classes with either random or quasi-random arrivals.…”
mentioning
confidence: 99%
“…Extensions of the CDTM for quasi-random traffic and the BR policy appear in [9,10]. In the retry models [6], a blocked call is allowed to retry one or more times, requesting for less bandwidth each time in order to be accepted for service.…”
mentioning
confidence: 99%
See 2 more Smart Citations