A Markov Modulated Representation of Heterogeneous Overflow Traffic

Frank BROCHIN; Eric PRADEL

A Markov Modulated Representation of Heterogeneous Overflow Traffic

Frank BROCHIN, Eric PRADEL

Full Text Views

0

Cite this

Summary :

In this paper, we introduce the MMPP⁽¹ⁿ⁾ process, a model that may be used in Integrated Services Digital Networks to represent the superposition of several overflow streams belonging to different classes of traffic. Given an overflow system in a multiclass environment, we show that this Markov Modulated model may be used to match simultaneously the two first moments of each individual overflow process. In addition, it takes into account the presence of congestion and non-congestion periods for the system as well as the dependence among the flows of different classes. Our study is illustrated with numerical examples that prove the accuracy of our approach.

Publication: IEICE TRANSACTIONS on Communications Vol.E76-B No.2 pp.169-177

Publication Date: 1993/02/25

Publicized

Online ISSN

DOI

Type of Manuscript: PAPER

Category: Communication Networks and Service

Authors

Frank BROCHIN
Eric PRADEL

Keyword

Cite this

Copy

Frank BROCHIN, Eric PRADEL, "A Markov Modulated Representation of Heterogeneous Overflow Traffic" in IEICE TRANSACTIONS on Communications, vol. E76-B, no. 2, pp. 169-177, February 1993, doi: .
Abstract: In this paper, we introduce the MMPP⁽¹ⁿ⁾ process, a model that may be used in Integrated Services Digital Networks to represent the superposition of several overflow streams belonging to different classes of traffic. Given an overflow system in a multiclass environment, we show that this Markov Modulated model may be used to match simultaneously the two first moments of each individual overflow process. In addition, it takes into account the presence of congestion and non-congestion periods for the system as well as the dependence among the flows of different classes. Our study is illustrated with numerical examples that prove the accuracy of our approach.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e76-b_2_169/_p

Copy

@ARTICLE{e76-b_2_169,
author={Frank BROCHIN, Eric PRADEL, },
journal={IEICE TRANSACTIONS on Communications},
title={A Markov Modulated Representation of Heterogeneous Overflow Traffic},
year={1993},
volume={E76-B},
number={2},
pages={169-177},
abstract={In this paper, we introduce the MMPP⁽¹ⁿ⁾ process, a model that may be used in Integrated Services Digital Networks to represent the superposition of several overflow streams belonging to different classes of traffic. Given an overflow system in a multiclass environment, we show that this Markov Modulated model may be used to match simultaneously the two first moments of each individual overflow process. In addition, it takes into account the presence of congestion and non-congestion periods for the system as well as the dependence among the flows of different classes. Our study is illustrated with numerical examples that prove the accuracy of our approach.},
keywords={},
doi={},
ISSN={},
month={February},}

Copy

TY - JOUR
TI - A Markov Modulated Representation of Heterogeneous Overflow Traffic
T2 - IEICE TRANSACTIONS on Communications
SP - 169
EP - 177
AU - Frank BROCHIN
AU - Eric PRADEL
PY - 1993
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E76-B
IS - 2
JA - IEICE TRANSACTIONS on Communications
Y1 - February 1993
AB - In this paper, we introduce the MMPP⁽¹ⁿ⁾ process, a model that may be used in Integrated Services Digital Networks to represent the superposition of several overflow streams belonging to different classes of traffic. Given an overflow system in a multiclass environment, we show that this Markov Modulated model may be used to match simultaneously the two first moments of each individual overflow process. In addition, it takes into account the presence of congestion and non-congestion periods for the system as well as the dependence among the flows of different classes. Our study is illustrated with numerical examples that prove the accuracy of our approach.
ER -