Modelling of systems with overflow multi-rate traffic and finite number of traffic sources

Głąbowski, Mariusz; Kubasik, K.; Stasiak, Maciej

doi:10.1109/csndsp.2008.4610800

Cited by 12 publications

(11 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Unlike in modelling methods that use Hayward's approach [8], [9], [13], in the convolution algorithm the capacities of both groups remain the same and are not modified, and the same applies to the number of demanded BBUs by a single call. The occupancy distributions…”

Section: B Division Of the System Into Subsystemsmentioning

confidence: 99%

“…The majority of reference works devoted to modelling of systems with traffic overflow, both single-service and multiservice, assumes that the call stream offered to primary resources is distributed to according to the Poisson distribution or binomial distribution [4]- [9]. The variety of offered network services currently available makes the formerly adopted assumptions, however, insufficient for a precise description of call streams generated in packet networks.…”

Section: Introductionmentioning

confidence: 99%

“…According to the traffic distribution strategy in networks with traffic overflow, to service calls arriving at telecommunications systems free resources are to be found in available direct groups. Part of this traffic (the so-called overflow traffic) that cannot be serviced by a first-choice group due to its occupancy is offered to an alternative group, also known as the overflow group [8], [9]). …”

Section: Introductionmentioning

confidence: 99%

“…The theoretical foundations for systems with traffic overflow consider systems in which the total primary resources are composed of a number of independent resources, called in telecommunications direct groups or first-choice groups [8], [9]. According to the traffic distribution strategy in networks with traffic overflow, to service calls arriving at telecommunications systems free resources are to be found in available direct groups.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Optimized two dimensional convolution algorithm for modelling systems with overflow traffic

Kaliszan

Głąbowski

Stasiak

2014

2014 9th International Symposium on Communication Systems, Networks &Amp; Digital Sign (CSNDSP)

Self Cite

View full text Add to dashboard Cite

This article proposes a new method for a determination of the two-dimensional distribution in systems with overflow traffic. The method proposed in the article offers a significant reduction of computational complexity as compared to two-dimensional convolution methods hitherto proposed. The proposed method is based on a determination of the twodimensional distribution in the system with traffic overflow on the basis of the one-dimensional distribution. The accuracy of the proposed method, verified and validated in the course of relevant simulation experiments, supports its wider applicability in engineering practice to analyse and dimension multiservice networks with traffic overflow. The algorithm developed by the authors allows researchers to model systems with any type of traffic offered to primary resources.

show abstract

Section: B Division Of the System Into Subsystemsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Optimized two dimensional convolution algorithm for modelling systems with overflow traffic

Kaliszan

Głąbowski

Stasiak

2014

2014 9th International Symposium on Communication Systems, Networks &Amp; Digital Sign (CSNDSP)

Self Cite

View full text Add to dashboard Cite

show abstract

“…The author of [28] attempts to approach the problem of modelling resources with overflow traffic with the assumption of hyperexponential service time, whereas single-service systems with overflow traffic generated by a finite number of traffic sources (pure chance traffic of type 2 (PCT2) (pure chance traffic of type 2 (PCT2); the traffic generated by a finite number of sources. Each idle source has its own arrival rate and the total arrival rate is proportional to the number of simultaneous idle sources) traffic [23]) are considered in, for example, [29][30][31].…”

Section: Modelling Of Single-service Systems With Traffic Overflowmentioning

confidence: 99%

Modelling of Cellular Networks with Traffic Overflow

Głąbowski

Hanczewski

Stasiak

2015

Mathematical Problems in Engineering

Self Cite

View full text Add to dashboard Cite

The paper proposes a new method for modelling multiservice cellular networks with traffic overflow. The proposed method employs a model of Erlang’s Ideal Grading (EIG) with multiservice traffic and differentiated availability. The fundamental advantage of the proposed method, as compared to other relevant methods, is a major simplification in modelling systems with traffic overflow that results from the elimination of the necessity of a determination of the parameters of overflow traffic, that is, the average value and the variance. According to the proposed method, calculations in the overflow system can be reduced to calculations in a system composed of one grading only. The paper presents the method for determining availability in such a grading that models a system with traffic overflow. The results of analytical calculations were compared with the results of simulation experiments. The results of the research study confirm high accuracy of the proposed method.

show abstract