UnivTrevesV1, PascalFrancis, Corpus, bibRecord, 000D42

A retrial BMAP/PH/N system

Identifieur interne : 000D42 ( PascalFrancis/Corpus ); précédent : 000D41; suivant : 000D43

A retrial BMAP/PH/N system

Auteurs : Lothar Breuer ; Alexander Dudin ; Valentina Klimenok

Source :

Queueing systems [ 0257-0130 ] ; 2002.

RBID : Pascal:02-0349388

Descripteurs français

Pascal (Inist)
- Loi conditionnelle, Approximation asymptotique, Matrice Toeplitz, Temps discret, Chaîne Markov, Temps continu, Distribution temporelle, Temps service, Processus arrivée, Processus Markov.

English descriptors

KwdEn :
- Arrival process, Asymptotic approximation, Conditional distribution, Continuous time, Discrete time, Markov chain, Markov process, Service time, Time distribution, Toeplitz matrix.

Abstract

A multi-server retrial queueing model with Batch Markovian Arrival Process and phase-type service time distribution is analyzed. The continuous-time multi-dimensional Markov chain describing the behavior of the system is investigated by means of reducing it to the corresponding discrete-time multi-dimensional Markov chain. The latter belongs to the class of multi-dimensional quasi-Toeplitz Markov chains in the case of a constant retrial rate and to the class of multi-dimensional asymptotically quasi-Toeplitz Markov chains in the case of an infinitely increasing retrial rate. It allows to obtain the existence conditions for the stationary distribution and to elaborate the algorithms for calculating the stationary state probabilities.

Notice en format standard (ISO 2709)

Pour connaître la documentation sur le format Inist Standard.

A01	`01`	`1`		`@0 0257-0130`
A03		`1`		`@0 Queueing syst.`
A05				`@2 40`
A06				`@2 4`
A08	`01`	`1`	`ENG`	`@1 A retrial BMAP/PH/N system`
A11	`01`	`1`		`@1 BREUER (Lothar)`
A11	`02`	`1`		`@1 DUDIN (Alexander)`
A11	`03`	`1`		`@1 KLIMENOK (Valentina)`
A14	`01`			`@1 University of Trier, Department IV - Computer Science @2 54286 Trier @3 DEU @Z 1 aut.`
A14	`02`			`@1 Department of Applied Mathematics and Computer Science, Belarus State University, 4 F Skorina Ave @2 220050, Minsk @3 BLR @Z 2 aut. @Z 3 aut.`
A20				`@1 433-457`
A21				`@1 2002`
A23	`01`			`@0 ENG`
A43	`01`			`@1 INIST @2 21918 @5 354000101313900050`
A44				`@0 0000 @1 © 2002 INIST-CNRS. All rights reserved.`
A45				`@0 40 ref.`
A47	`01`	`1`		`@0 02-0349388`
A60				`@1 P`
A61				`@0 A`
A64	`01`	`1`		`@0 Queueing systems`
A66	`01`			`@0 NLD`
C01	`01`		`ENG`	@0 A multi-server retrial queueing model with Batch Markovian Arrival Process and phase-type service time distribution is analyzed. The continuous-time multi-dimensional Markov chain describing the behavior of the system is investigated by means of reducing it to the corresponding discrete-time multi-dimensional Markov chain. The latter belongs to the class of multi-dimensional quasi-Toeplitz Markov chains in the case of a constant retrial rate and to the class of multi-dimensional asymptotically quasi-Toeplitz Markov chains in the case of an infinitely increasing retrial rate. It allows to obtain the existence conditions for the stationary distribution and to elaborate the algorithms for calculating the stationary state probabilities.
C02	`01`	`X`		`@0 001D01A05`
C03	`01`	`X`	`FRE`	`@0 Loi conditionnelle @5 01`
C03	`01`	`X`	`ENG`	`@0 Conditional distribution @5 01`
C03	`01`	`X`	`SPA`	`@0 Ley condicional @5 01`
C03	`02`	`X`	`FRE`	`@0 Approximation asymptotique @5 02`
C03	`02`	`X`	`ENG`	`@0 Asymptotic approximation @5 02`
C03	`02`	`X`	`SPA`	`@0 Aproximación asintótica @5 02`
C03	`03`	`X`	`FRE`	`@0 Matrice Toeplitz @5 03`
C03	`03`	`X`	`ENG`	`@0 Toeplitz matrix @5 03`
C03	`03`	`X`	`SPA`	`@0 Matriz Toeplitz @5 03`
C03	`04`	`X`	`FRE`	`@0 Temps discret @5 04`
C03	`04`	`X`	`ENG`	`@0 Discrete time @5 04`
C03	`04`	`X`	`SPA`	`@0 Tiempo discreto @5 04`
C03	`05`	`X`	`FRE`	`@0 Chaîne Markov @5 05`
C03	`05`	`X`	`ENG`	`@0 Markov chain @5 05`
C03	`05`	`X`	`SPA`	`@0 Cadena Markov @5 05`
C03	`06`	`X`	`FRE`	`@0 Temps continu @5 06`
C03	`06`	`X`	`ENG`	`@0 Continuous time @5 06`
C03	`06`	`X`	`SPA`	`@0 Tiempo continuo @5 06`
C03	`07`	`X`	`FRE`	`@0 Distribution temporelle @5 07`
C03	`07`	`X`	`ENG`	`@0 Time distribution @5 07`
C03	`07`	`X`	`SPA`	`@0 Distribución temporal @5 07`
C03	`08`	`X`	`FRE`	`@0 Temps service @5 08`
C03	`08`	`X`	`ENG`	`@0 Service time @5 08`
C03	`08`	`X`	`SPA`	`@0 Tiempo servicio @5 08`
C03	`09`	`X`	`FRE`	`@0 Processus arrivée @5 09`
C03	`09`	`X`	`ENG`	`@0 Arrival process @5 09`
C03	`09`	`X`	`SPA`	`@0 Proceso llegada @5 09`
C03	`10`	`X`	`FRE`	`@0 Processus Markov @5 10`
C03	`10`	`X`	`ENG`	`@0 Markov process @5 10`
C03	`10`	`X`	`SPA`	`@0 Proceso Markov @5 10`
N21				`@1 189`
N82				`@1 PSI`

Format Inist (serveur)

NO :	PASCAL 02-0349388 INIST
ET :	A retrial BMAP/PH/N system
AU :	BREUER (Lothar); DUDIN (Alexander); KLIMENOK (Valentina)
AF :	University of Trier, Department IV - Computer Science/54286 Trier/Allemagne (1 aut.); Department of Applied Mathematics and Computer Science, Belarus State University, 4 F Skorina Ave/220050, Minsk/Bélarus (2 aut., 3 aut.)
DT :	Publication en série; Niveau analytique
SO :	Queueing systems; ISSN 0257-0130; Pays-Bas; Da. 2002; Vol. 40; No. 4; Pp. 433-457; Bibl. 40 ref.
LA :	Anglais
EA :	A multi-server retrial queueing model with Batch Markovian Arrival Process and phase-type service time distribution is analyzed. The continuous-time multi-dimensional Markov chain describing the behavior of the system is investigated by means of reducing it to the corresponding discrete-time multi-dimensional Markov chain. The latter belongs to the class of multi-dimensional quasi-Toeplitz Markov chains in the case of a constant retrial rate and to the class of multi-dimensional asymptotically quasi-Toeplitz Markov chains in the case of an infinitely increasing retrial rate. It allows to obtain the existence conditions for the stationary distribution and to elaborate the algorithms for calculating the stationary state probabilities.
CC :	001D01A05
FD :	Loi conditionnelle; Approximation asymptotique; Matrice Toeplitz; Temps discret; Chaîne Markov; Temps continu; Distribution temporelle; Temps service; Processus arrivée; Processus Markov
ED :	Conditional distribution; Asymptotic approximation; Toeplitz matrix; Discrete time; Markov chain; Continuous time; Time distribution; Service time; Arrival process; Markov process
SD :	Ley condicional; Aproximación asintótica; Matriz Toeplitz; Tiempo discreto; Cadena Markov; Tiempo continuo; Distribución temporal; Tiempo servicio; Proceso llegada; Proceso Markov
LO :	INIST-21918.354000101313900050
ID :	02-0349388

Links to Exploration step

Pascal:02-0349388

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">A retrial BMAP/PH/N system</title>
<author><name sortKey="Breuer, Lothar" sort="Breuer, Lothar" uniqKey="Breuer L" first="Lothar" last="Breuer">Lothar Breuer</name>
<affiliation><inist:fA14 i1="01"><s1>University of Trier, Department IV - Computer Science</s1>
<s2>54286 Trier</s2>
<s3>DEU</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Dudin, Alexander" sort="Dudin, Alexander" uniqKey="Dudin A" first="Alexander" last="Dudin">Alexander Dudin</name>
<affiliation><inist:fA14 i1="02"><s1>Department of Applied Mathematics and Computer Science, Belarus State University, 4 F Skorina Ave</s1>
<s2>220050, Minsk</s2>
<s3>BLR</s3>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Klimenok, Valentina" sort="Klimenok, Valentina" uniqKey="Klimenok V" first="Valentina" last="Klimenok">Valentina Klimenok</name>
<affiliation><inist:fA14 i1="02"><s1>Department of Applied Mathematics and Computer Science, Belarus State University, 4 F Skorina Ave</s1>
<s2>220050, Minsk</s2>
<s3>BLR</s3>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">02-0349388</idno>
<date when="2002">2002</date>
<idno type="stanalyst">PASCAL 02-0349388 INIST</idno>
<idno type="RBID">Pascal:02-0349388</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000D42</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">A retrial BMAP/PH/N system</title>
<author><name sortKey="Breuer, Lothar" sort="Breuer, Lothar" uniqKey="Breuer L" first="Lothar" last="Breuer">Lothar Breuer</name>
<affiliation><inist:fA14 i1="01"><s1>University of Trier, Department IV - Computer Science</s1>
<s2>54286 Trier</s2>
<s3>DEU</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Dudin, Alexander" sort="Dudin, Alexander" uniqKey="Dudin A" first="Alexander" last="Dudin">Alexander Dudin</name>
<affiliation><inist:fA14 i1="02"><s1>Department of Applied Mathematics and Computer Science, Belarus State University, 4 F Skorina Ave</s1>
<s2>220050, Minsk</s2>
<s3>BLR</s3>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Klimenok, Valentina" sort="Klimenok, Valentina" uniqKey="Klimenok V" first="Valentina" last="Klimenok">Valentina Klimenok</name>
<affiliation><inist:fA14 i1="02"><s1>Department of Applied Mathematics and Computer Science, Belarus State University, 4 F Skorina Ave</s1>
<s2>220050, Minsk</s2>
<s3>BLR</s3>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</analytic>
<series><title level="j" type="main">Queueing systems</title>
<title level="j" type="abbreviated">Queueing syst.</title>
<idno type="ISSN">0257-0130</idno>
<imprint><date when="2002">2002</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><title level="j" type="main">Queueing systems</title>
<title level="j" type="abbreviated">Queueing syst.</title>
<idno type="ISSN">0257-0130</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Arrival process</term>
<term>Asymptotic approximation</term>
<term>Conditional distribution</term>
<term>Continuous time</term>
<term>Discrete time</term>
<term>Markov chain</term>
<term>Markov process</term>
<term>Service time</term>
<term>Time distribution</term>
<term>Toeplitz matrix</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Loi conditionnelle</term>
<term>Approximation asymptotique</term>
<term>Matrice Toeplitz</term>
<term>Temps discret</term>
<term>Chaîne Markov</term>
<term>Temps continu</term>
<term>Distribution temporelle</term>
<term>Temps service</term>
<term>Processus arrivée</term>
<term>Processus Markov</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">A multi-server retrial queueing model with Batch Markovian Arrival Process and phase-type service time distribution is analyzed. The continuous-time multi-dimensional Markov chain describing the behavior of the system is investigated by means of reducing it to the corresponding discrete-time multi-dimensional Markov chain. The latter belongs to the class of multi-dimensional quasi-Toeplitz Markov chains in the case of a constant retrial rate and to the class of multi-dimensional asymptotically quasi-Toeplitz Markov chains in the case of an infinitely increasing retrial rate. It allows to obtain the existence conditions for the stationary distribution and to elaborate the algorithms for calculating the stationary state probabilities.</div>
</front>
</TEI>
<inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0257-0130</s0>
</fA01>
<fA03 i2="1"><s0>Queueing syst.</s0>
</fA03>
<fA05><s2>40</s2>
</fA05>
<fA06><s2>4</s2>
</fA06>
<fA08 i1="01" i2="1" l="ENG"><s1>A retrial BMAP/PH/N system</s1>
</fA08>
<fA11 i1="01" i2="1"><s1>BREUER (Lothar)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>DUDIN (Alexander)</s1>
</fA11>
<fA11 i1="03" i2="1"><s1>KLIMENOK (Valentina)</s1>
</fA11>
<fA14 i1="01"><s1>University of Trier, Department IV - Computer Science</s1>
<s2>54286 Trier</s2>
<s3>DEU</s3>
<sZ>1 aut.</sZ>
</fA14>
<fA14 i1="02"><s1>Department of Applied Mathematics and Computer Science, Belarus State University, 4 F Skorina Ave</s1>
<s2>220050, Minsk</s2>
<s3>BLR</s3>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</fA14>
<fA20><s1>433-457</s1>
</fA20>
<fA21><s1>2002</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA43 i1="01"><s1>INIST</s1>
<s2>21918</s2>
<s5>354000101313900050</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 2002 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>40 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>02-0349388</s0>
</fA47>
<fA60><s1>P</s1>
</fA60>
<fA61><s0>A</s0>
</fA61>
<fA64 i1="01" i2="1"><s0>Queueing systems</s0>
</fA64>
<fA66 i1="01"><s0>NLD</s0>
</fA66>
<fC01 i1="01" l="ENG"><s0>A multi-server retrial queueing model with Batch Markovian Arrival Process and phase-type service time distribution is analyzed. The continuous-time multi-dimensional Markov chain describing the behavior of the system is investigated by means of reducing it to the corresponding discrete-time multi-dimensional Markov chain. The latter belongs to the class of multi-dimensional quasi-Toeplitz Markov chains in the case of a constant retrial rate and to the class of multi-dimensional asymptotically quasi-Toeplitz Markov chains in the case of an infinitely increasing retrial rate. It allows to obtain the existence conditions for the stationary distribution and to elaborate the algorithms for calculating the stationary state probabilities.</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001D01A05</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Loi conditionnelle</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>Conditional distribution</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Ley condicional</s0>
<s5>01</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE"><s0>Approximation asymptotique</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>Asymptotic approximation</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Aproximación asintótica</s0>
<s5>02</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE"><s0>Matrice Toeplitz</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>Toeplitz matrix</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Matriz Toeplitz</s0>
<s5>03</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE"><s0>Temps discret</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG"><s0>Discrete time</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="SPA"><s0>Tiempo discreto</s0>
<s5>04</s5>
</fC03>
<fC03 i1="05" i2="X" l="FRE"><s0>Chaîne Markov</s0>
<s5>05</s5>
</fC03>
<fC03 i1="05" i2="X" l="ENG"><s0>Markov chain</s0>
<s5>05</s5>
</fC03>
<fC03 i1="05" i2="X" l="SPA"><s0>Cadena Markov</s0>
<s5>05</s5>
</fC03>
<fC03 i1="06" i2="X" l="FRE"><s0>Temps continu</s0>
<s5>06</s5>
</fC03>
<fC03 i1="06" i2="X" l="ENG"><s0>Continuous time</s0>
<s5>06</s5>
</fC03>
<fC03 i1="06" i2="X" l="SPA"><s0>Tiempo continuo</s0>
<s5>06</s5>
</fC03>
<fC03 i1="07" i2="X" l="FRE"><s0>Distribution temporelle</s0>
<s5>07</s5>
</fC03>
<fC03 i1="07" i2="X" l="ENG"><s0>Time distribution</s0>
<s5>07</s5>
</fC03>
<fC03 i1="07" i2="X" l="SPA"><s0>Distribución temporal</s0>
<s5>07</s5>
</fC03>
<fC03 i1="08" i2="X" l="FRE"><s0>Temps service</s0>
<s5>08</s5>
</fC03>
<fC03 i1="08" i2="X" l="ENG"><s0>Service time</s0>
<s5>08</s5>
</fC03>
<fC03 i1="08" i2="X" l="SPA"><s0>Tiempo servicio</s0>
<s5>08</s5>
</fC03>
<fC03 i1="09" i2="X" l="FRE"><s0>Processus arrivée</s0>
<s5>09</s5>
</fC03>
<fC03 i1="09" i2="X" l="ENG"><s0>Arrival process</s0>
<s5>09</s5>
</fC03>
<fC03 i1="09" i2="X" l="SPA"><s0>Proceso llegada</s0>
<s5>09</s5>
</fC03>
<fC03 i1="10" i2="X" l="FRE"><s0>Processus Markov</s0>
<s5>10</s5>
</fC03>
<fC03 i1="10" i2="X" l="ENG"><s0>Markov process</s0>
<s5>10</s5>
</fC03>
<fC03 i1="10" i2="X" l="SPA"><s0>Proceso Markov</s0>
<s5>10</s5>
</fC03>
<fN21><s1>189</s1>
</fN21>
<fN82><s1>PSI</s1>
</fN82>
</pA>
</standard>
<server><NO>PASCAL 02-0349388 INIST</NO>
<ET>A retrial BMAP/PH/N system</ET>
<AU>BREUER (Lothar); DUDIN (Alexander); KLIMENOK (Valentina)</AU>
<AF>University of Trier, Department IV - Computer Science/54286 Trier/Allemagne (1 aut.); Department of Applied Mathematics and Computer Science, Belarus State University, 4 F Skorina Ave/220050, Minsk/Bélarus (2 aut., 3 aut.)</AF>
<DT>Publication en série; Niveau analytique</DT>
<SO>Queueing systems; ISSN 0257-0130; Pays-Bas; Da. 2002; Vol. 40; No. 4; Pp. 433-457; Bibl. 40 ref.</SO>
<LA>Anglais</LA>
<EA>A multi-server retrial queueing model with Batch Markovian Arrival Process and phase-type service time distribution is analyzed. The continuous-time multi-dimensional Markov chain describing the behavior of the system is investigated by means of reducing it to the corresponding discrete-time multi-dimensional Markov chain. The latter belongs to the class of multi-dimensional quasi-Toeplitz Markov chains in the case of a constant retrial rate and to the class of multi-dimensional asymptotically quasi-Toeplitz Markov chains in the case of an infinitely increasing retrial rate. It allows to obtain the existence conditions for the stationary distribution and to elaborate the algorithms for calculating the stationary state probabilities.</EA>
<CC>001D01A05</CC>
<FD>Loi conditionnelle; Approximation asymptotique; Matrice Toeplitz; Temps discret; Chaîne Markov; Temps continu; Distribution temporelle; Temps service; Processus arrivée; Processus Markov</FD>
<ED>Conditional distribution; Asymptotic approximation; Toeplitz matrix; Discrete time; Markov chain; Continuous time; Time distribution; Service time; Arrival process; Markov process</ED>
<SD>Ley condicional; Aproximación asintótica; Matriz Toeplitz; Tiempo discreto; Cadena Markov; Tiempo continuo; Distribución temporal; Tiempo servicio; Proceso llegada; Proceso Markov</SD>
<LO>INIST-21918.354000101313900050</LO>
<ID>02-0349388</ID>
</server>
</inist>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/PascalFrancis/Corpus

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000D42 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000D42 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Rhénanie
   |area=    UnivTrevesV1
   |flux=    PascalFrancis
   |étape=   Corpus
   |type=    RBID
   |clé=     Pascal:02-0349388
   |texte=   A retrial BMAP/PH/N system
}}

This area was generated with Dilib version V0.6.31.
Data generation: Sat Jul 22 16:29:01 2017. Site generation: Wed Feb 28 14:55:37 2024

	Serveur d'exploration sur l'Université de Trèves
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.

Serveur d'exploration sur l'Université de Trèves

A retrial BMAP/PH/N system

A retrial BMAP/PH/N system

Source :

Descripteurs français

English descriptors

Abstract

Notice en format standard (ISO 2709)

Format Inist (serveur)

Links to Exploration step

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri