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.

Transient and stationary distributions for the GI/G/k queue with Lebesgue-dominated inter-arrival time distribution

Identifieur interne : 000296 ( PascalFrancis/Curation ); précédent : 000295; suivant : 000297

Transient and stationary distributions for the GI/G/k queue with Lebesgue-dominated inter-arrival time distribution

Auteurs : Lothar Breuer [Allemagne]

Source :

RBID : Pascal:03-0516800

Descripteurs français

English descriptors

Abstract

In this paper, the multi-server queue with general service time distribution and Lebesgue-dominated iid inter-arival times is analyzed. This is done by introducing auxiliary variables for the remaining service times and then examining the embedded Markov chain at arrival instants. The concept of piecewise-deterministic Markov processes is applied to model the inter-arrival behaviour. It turns out that the transition probability kernel of the embedded Markov chain at arrival instants has the form of a lower Hessenberg matrix and hence admits an operator-geometric stationary distribution. Thus it is shown that matrix-analytical methods can be extended to provide a modeling tool even for the general multi-server queue.
pA  
A01 01  1    @0 0257-0130
A03   1    @0 Queueing syst.
A05       @2 45
A06       @2 1
A08 01  1  ENG  @1 Transient and stationary distributions for the GI/G/k queue with Lebesgue-dominated inter-arrival time distribution
A11 01  1    @1 BREUER (Lothar)
A14 01      @1 FB IV - Informatik, Universität Trier @2 54286 Trier @3 DEU @Z 1 aut.
A20       @1 47-57
A21       @1 2003
A23 01      @0 ENG
A43 01      @1 INIST @2 21918 @5 354000114783110030
A44       @0 0000 @1 © 2003 INIST-CNRS. All rights reserved.
A45       @0 10 ref.
A47 01  1    @0 03-0516800
A60       @1 P
A61       @0 A
A64 01  1    @0 Queueing systems
A66 01      @0 NLD
C01 01    ENG  @0 In this paper, the multi-server queue with general service time distribution and Lebesgue-dominated iid inter-arival times is analyzed. This is done by introducing auxiliary variables for the remaining service times and then examining the embedded Markov chain at arrival instants. The concept of piecewise-deterministic Markov processes is applied to model the inter-arrival behaviour. It turns out that the transition probability kernel of the embedded Markov chain at arrival instants has the form of a lower Hessenberg matrix and hence admits an operator-geometric stationary distribution. Thus it is shown that matrix-analytical methods can be extended to provide a modeling tool even for the general multi-server queue.
C02 01  X    @0 001D01A05
C03 01  X  FRE  @0 Méthode analytique @5 01
C03 01  X  ENG  @0 Analytical method @5 01
C03 01  X  SPA  @0 Método analítico @5 01
C03 02  X  FRE  @0 File attente @5 02
C03 02  X  ENG  @0 Queue @5 02
C03 02  X  SPA  @0 Fila espera @5 02
C03 03  X  FRE  @0 Méthode matricielle @5 03
C03 03  X  ENG  @0 Matrix method @5 03
C03 03  X  SPA  @0 Método matriz @5 03
C03 04  X  FRE  @0 Probabilité transition @5 04
C03 04  X  ENG  @0 Transition probability @5 04
C03 04  X  SPA  @0 Probabilidad transición @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 service @5 06
C03 06  X  ENG  @0 Service time @5 06
C03 06  X  SPA  @0 Tiempo servicio @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 arrivée @5 08
C03 08  X  ENG  @0 Arrival time @5 08
C03 08  X  SPA  @0 Tiempo llegada @5 08
C03 09  X  FRE  @0 Condition stationnaire @5 09
C03 09  X  ENG  @0 Stationary condition @5 09
C03 09  X  SPA  @0 Condición estacionaria @5 09
C03 10  X  FRE  @0 Temps discret @5 10
C03 10  X  ENG  @0 Discrete time @5 10
C03 10  X  SPA  @0 Tiempo discreto @5 10
C03 11  X  FRE  @0 File n serveurs @5 11
C03 11  X  ENG  @0 Multiserver queue @5 11
C03 11  X  SPA  @0 Fila n servidores @5 11
C03 12  X  FRE  @0 File attente M G 1 @4 CD @5 96
C03 12  X  ENG  @0 M G 1 queue @4 CD @5 96
C03 13  X  FRE  @0 Matrice Hessenberg @4 CD @5 97
C03 13  X  ENG  @0 Hessenberg matrix @4 CD @5 97
N21       @1 342
N82       @1 PSI

Links toward previous steps (curation, corpus...)


Links to Exploration step

Pascal:03-0516800

Le document en format XML

<record>
<TEI>
<teiHeader>
<fileDesc>
<titleStmt>
<title xml:lang="en" level="a">Transient and stationary distributions for the GI/G/k queue with Lebesgue-dominated inter-arrival time distribution</title>
<author>
<name sortKey="Breuer, Lothar" sort="Breuer, Lothar" uniqKey="Breuer L" first="Lothar" last="Breuer">Lothar Breuer</name>
<affiliation wicri:level="1">
<inist:fA14 i1="01">
<s1>FB IV - Informatik, Universität Trier</s1>
<s2>54286 Trier</s2>
<s3>DEU</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
<country>Allemagne</country>
</affiliation>
</author>
</titleStmt>
<publicationStmt>
<idno type="wicri:source">INIST</idno>
<idno type="inist">03-0516800</idno>
<date when="2003">2003</date>
<idno type="stanalyst">PASCAL 03-0516800 INIST</idno>
<idno type="RBID">Pascal:03-0516800</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000C19</idno>
<idno type="wicri:Area/PascalFrancis/Curation">000296</idno>
</publicationStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title xml:lang="en" level="a">Transient and stationary distributions for the GI/G/k queue with Lebesgue-dominated inter-arrival time distribution</title>
<author>
<name sortKey="Breuer, Lothar" sort="Breuer, Lothar" uniqKey="Breuer L" first="Lothar" last="Breuer">Lothar Breuer</name>
<affiliation wicri:level="1">
<inist:fA14 i1="01">
<s1>FB IV - Informatik, Universität Trier</s1>
<s2>54286 Trier</s2>
<s3>DEU</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
<country>Allemagne</country>
</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="2003">2003</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>Analytical method</term>
<term>Arrival time</term>
<term>Discrete time</term>
<term>Hessenberg matrix</term>
<term>M G 1 queue</term>
<term>Markov chain</term>
<term>Matrix method</term>
<term>Multiserver queue</term>
<term>Queue</term>
<term>Service time</term>
<term>Stationary condition</term>
<term>Time distribution</term>
<term>Transition probability</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr">
<term>Méthode analytique</term>
<term>File attente</term>
<term>Méthode matricielle</term>
<term>Probabilité transition</term>
<term>Chaîne Markov</term>
<term>Temps service</term>
<term>Distribution temporelle</term>
<term>Temps arrivée</term>
<term>Condition stationnaire</term>
<term>Temps discret</term>
<term>File n serveurs</term>
<term>File attente M G 1</term>
<term>Matrice Hessenberg</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front>
<div type="abstract" xml:lang="en">In this paper, the multi-server queue with general service time distribution and Lebesgue-dominated iid inter-arival times is analyzed. This is done by introducing auxiliary variables for the remaining service times and then examining the embedded Markov chain at arrival instants. The concept of piecewise-deterministic Markov processes is applied to model the inter-arrival behaviour. It turns out that the transition probability kernel of the embedded Markov chain at arrival instants has the form of a lower Hessenberg matrix and hence admits an operator-geometric stationary distribution. Thus it is shown that matrix-analytical methods can be extended to provide a modeling tool even for the general multi-server queue.</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>45</s2>
</fA05>
<fA06>
<s2>1</s2>
</fA06>
<fA08 i1="01" i2="1" l="ENG">
<s1>Transient and stationary distributions for the GI/G/k queue with Lebesgue-dominated inter-arrival time distribution</s1>
</fA08>
<fA11 i1="01" i2="1">
<s1>BREUER (Lothar)</s1>
</fA11>
<fA14 i1="01">
<s1>FB IV - Informatik, Universität Trier</s1>
<s2>54286 Trier</s2>
<s3>DEU</s3>
<sZ>1 aut.</sZ>
</fA14>
<fA20>
<s1>47-57</s1>
</fA20>
<fA21>
<s1>2003</s1>
</fA21>
<fA23 i1="01">
<s0>ENG</s0>
</fA23>
<fA43 i1="01">
<s1>INIST</s1>
<s2>21918</s2>
<s5>354000114783110030</s5>
</fA43>
<fA44>
<s0>0000</s0>
<s1>© 2003 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45>
<s0>10 ref.</s0>
</fA45>
<fA47 i1="01" i2="1">
<s0>03-0516800</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>In this paper, the multi-server queue with general service time distribution and Lebesgue-dominated iid inter-arival times is analyzed. This is done by introducing auxiliary variables for the remaining service times and then examining the embedded Markov chain at arrival instants. The concept of piecewise-deterministic Markov processes is applied to model the inter-arrival behaviour. It turns out that the transition probability kernel of the embedded Markov chain at arrival instants has the form of a lower Hessenberg matrix and hence admits an operator-geometric stationary distribution. Thus it is shown that matrix-analytical methods can be extended to provide a modeling tool even for the general multi-server queue.</s0>
</fC01>
<fC02 i1="01" i2="X">
<s0>001D01A05</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE">
<s0>Méthode analytique</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG">
<s0>Analytical method</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA">
<s0>Método analítico</s0>
<s5>01</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE">
<s0>File attente</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG">
<s0>Queue</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA">
<s0>Fila espera</s0>
<s5>02</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE">
<s0>Méthode matricielle</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG">
<s0>Matrix method</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA">
<s0>Método matriz</s0>
<s5>03</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE">
<s0>Probabilité transition</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG">
<s0>Transition probability</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="SPA">
<s0>Probabilidad transición</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 service</s0>
<s5>06</s5>
</fC03>
<fC03 i1="06" i2="X" l="ENG">
<s0>Service time</s0>
<s5>06</s5>
</fC03>
<fC03 i1="06" i2="X" l="SPA">
<s0>Tiempo servicio</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 arrivée</s0>
<s5>08</s5>
</fC03>
<fC03 i1="08" i2="X" l="ENG">
<s0>Arrival time</s0>
<s5>08</s5>
</fC03>
<fC03 i1="08" i2="X" l="SPA">
<s0>Tiempo llegada</s0>
<s5>08</s5>
</fC03>
<fC03 i1="09" i2="X" l="FRE">
<s0>Condition stationnaire</s0>
<s5>09</s5>
</fC03>
<fC03 i1="09" i2="X" l="ENG">
<s0>Stationary condition</s0>
<s5>09</s5>
</fC03>
<fC03 i1="09" i2="X" l="SPA">
<s0>Condición estacionaria</s0>
<s5>09</s5>
</fC03>
<fC03 i1="10" i2="X" l="FRE">
<s0>Temps discret</s0>
<s5>10</s5>
</fC03>
<fC03 i1="10" i2="X" l="ENG">
<s0>Discrete time</s0>
<s5>10</s5>
</fC03>
<fC03 i1="10" i2="X" l="SPA">
<s0>Tiempo discreto</s0>
<s5>10</s5>
</fC03>
<fC03 i1="11" i2="X" l="FRE">
<s0>File n serveurs</s0>
<s5>11</s5>
</fC03>
<fC03 i1="11" i2="X" l="ENG">
<s0>Multiserver queue</s0>
<s5>11</s5>
</fC03>
<fC03 i1="11" i2="X" l="SPA">
<s0>Fila n servidores</s0>
<s5>11</s5>
</fC03>
<fC03 i1="12" i2="X" l="FRE">
<s0>File attente M G 1</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03>
<fC03 i1="12" i2="X" l="ENG">
<s0>M G 1 queue</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03>
<fC03 i1="13" i2="X" l="FRE">
<s0>Matrice Hessenberg</s0>
<s4>CD</s4>
<s5>97</s5>
</fC03>
<fC03 i1="13" i2="X" l="ENG">
<s0>Hessenberg matrix</s0>
<s4>CD</s4>
<s5>97</s5>
</fC03>
<fN21>
<s1>342</s1>
</fN21>
<fN82>
<s1>PSI</s1>
</fN82>
</pA>
</standard>
</inist>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/PascalFrancis/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000296 | SxmlIndent | more

Ou

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Curation/biblio.hfd -nk 000296 | 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=   Curation
   |type=    RBID
   |clé=     Pascal:03-0516800
   |texte=   Transient and stationary distributions for the GI/G/k queue with Lebesgue-dominated inter-arrival time distribution
}}

Wicri

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