InforLorV4, PascalFrancis, Corpus, bibRecord, 000987

Open-loop routeing to M parallel servers with no buffers

Identifieur interne : 000987 ( PascalFrancis/Corpus ); précédent : 000986; suivant : 000988

Open-loop routeing to M parallel servers with no buffers

Auteurs : Eitan Altman ; Sandjai Bhulai ; Bruno Gaujal ; Arie Hordijk

Source :

Journal of applied probability [ 0021-9002 ] ; 2000.

RBID : Pascal:01-0078809

Descripteurs français

Pascal (Inist)
- Système commande, Système stochastique, Commande stochastique, Commande optimale, Programmation mathématique, Décision Markov, Processus semi markovien, Boucle ouverte, Acheminement, Processus arrivée, Internet, Recherche information, Processus Poisson.

English descriptors

KwdEn :
- Arrival process, Control system, Information retrieval, Internet, Markov decision, Mathematical programming, Open loop, Optimal control, Poisson process, Routing, Semimarkovian process, Stochastic control, Stochastic system.

Abstract

In this paper we study the assignment of packets to M parallel heterogeneous servers with no buffers. The controller does not have knowledge on the state of the servers and bases all decisions on the number of time slots ago that packets have been sent to the different servers. The objective of the controller is to minimize the expected average cost. We consider a general stationary arrival process, with no independence assumptions. We show that the problem can be transformed into a Markov Decision Process (MDP). We further show under quite general conditions on cost functions that only a finite number of states have to be considered in this MDP, which then implies the optimality of periodic policies. For the case of two servers we obtain a more detailed structure of the cost and optimal policies. In particular we show that the average cost function is multimodular, and we obtain expressions for the cost for MMPP and MAP processes. Finally we present an application to optimal robot scheduling for Web search engines.

Notice en format standard (ISO 2709)

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

A01	`01`	`1`		`@0 0021-9002`
A02	`01`			`@0 JPRBAM`
A03		`1`		`@0 J. appl. probab.`
A05				`@2 37`
A06				`@2 3`
A08	`01`	`1`	`ENG`	`@1 Open-loop routeing to M parallel servers with no buffers`
A11	`01`	`1`		`@1 ALTMAN (Eitan)`
A11	`02`	`1`		`@1 BHULAI (Sandjai)`
A11	`03`	`1`		`@1 GAUJAL (Bruno)`
A11	`04`	`1`		`@1 HORDIJK (Arie)`
A14	`01`			`@1 INRIA @3 INC @Z 1 aut.`
A14	`02`			`@1 Vrije Universiteit Amsterdam @3 NLD @Z 2 aut.`
A14	`03`			`@1 LORIA @3 INC @Z 3 aut.`
A14	`04`			`@1 Leiden University @3 NLD @Z 4 aut.`
A20				`@1 668-684`
A21				`@1 2000`
A23	`01`			`@0 ENG`
A43	`01`			`@1 INIST @2 12216 @5 354000093753960060`
A44				`@0 0000 @1 © 2001 INIST-CNRS. All rights reserved.`
A45				`@0 15 ref.`
A47	`01`	`1`		`@0 01-0078809`
A60				`@1 P`
A61				`@0 A`
A64	`01`	`1`		`@0 Journal of applied probability`
A66	`01`			`@0 GBR`
C01	`01`		`ENG`	@0 In this paper we study the assignment of packets to M parallel heterogeneous servers with no buffers. The controller does not have knowledge on the state of the servers and bases all decisions on the number of time slots ago that packets have been sent to the different servers. The objective of the controller is to minimize the expected average cost. We consider a general stationary arrival process, with no independence assumptions. We show that the problem can be transformed into a Markov Decision Process (MDP). We further show under quite general conditions on cost functions that only a finite number of states have to be considered in this MDP, which then implies the optimality of periodic policies. For the case of two servers we obtain a more detailed structure of the cost and optimal policies. In particular we show that the average cost function is multimodular, and we obtain expressions for the cost for MMPP and MAP processes. Finally we present an application to optimal robot scheduling for Web search engines.
C02	`01`	`X`		`@0 001D02D08`
C02	`02`	`X`		`@0 001D01A03`
C03	`01`	`X`	`FRE`	`@0 Système commande @5 01`
C03	`01`	`X`	`ENG`	`@0 Control system @5 01`
C03	`01`	`X`	`SPA`	`@0 Sistema control @5 01`
C03	`02`	`X`	`FRE`	`@0 Système stochastique @5 02`
C03	`02`	`X`	`ENG`	`@0 Stochastic system @5 02`
C03	`02`	`X`	`SPA`	`@0 Sistema estocástico @5 02`
C03	`03`	`X`	`FRE`	`@0 Commande stochastique @5 03`
C03	`03`	`X`	`ENG`	`@0 Stochastic control @5 03`
C03	`03`	`X`	`SPA`	`@0 Control estocástico @5 03`
C03	`04`	`X`	`FRE`	`@0 Commande optimale @5 04`
C03	`04`	`X`	`ENG`	`@0 Optimal control @5 04`
C03	`04`	`X`	`SPA`	`@0 Control óptimo @5 04`
C03	`05`	`X`	`FRE`	`@0 Programmation mathématique @5 05`
C03	`05`	`X`	`ENG`	`@0 Mathematical programming @5 05`
C03	`05`	`X`	`SPA`	`@0 Programación matemática @5 05`
C03	`06`	`X`	`FRE`	`@0 Décision Markov @5 06`
C03	`06`	`X`	`ENG`	`@0 Markov decision @5 06`
C03	`06`	`X`	`SPA`	`@0 Decisión Markov @5 06`
C03	`07`	`X`	`FRE`	`@0 Processus semi markovien @5 07`
C03	`07`	`X`	`ENG`	`@0 Semimarkovian process @5 07`
C03	`07`	`X`	`SPA`	`@0 Proceso semi markoviano @5 07`
C03	`08`	`X`	`FRE`	`@0 Boucle ouverte @5 08`
C03	`08`	`X`	`ENG`	`@0 Open loop @5 08`
C03	`08`	`X`	`SPA`	`@0 Bucle abierto @5 08`
C03	`09`	`X`	`FRE`	`@0 Acheminement @5 09`
C03	`09`	`X`	`ENG`	`@0 Routing @5 09`
C03	`09`	`X`	`SPA`	`@0 Encaminamiento @5 09`
C03	`10`	`X`	`FRE`	`@0 Processus arrivée @5 10`
C03	`10`	`X`	`ENG`	`@0 Arrival process @5 10`
C03	`10`	`X`	`SPA`	`@0 Proceso llegada @5 10`
C03	`11`	`X`	`FRE`	`@0 Internet @5 11`
C03	`11`	`X`	`ENG`	`@0 Internet @5 11`
C03	`11`	`X`	`SPA`	`@0 Internet @5 11`
C03	`12`	`X`	`FRE`	`@0 Recherche information @5 12`
C03	`12`	`X`	`ENG`	`@0 Information retrieval @5 12`
C03	`12`	`X`	`SPA`	`@0 Recuperación información @5 12`
C03	`13`	`X`	`FRE`	`@0 Processus Poisson @5 13`
C03	`13`	`X`	`ENG`	`@0 Poisson process @5 13`
C03	`13`	`X`	`SPA`	`@0 Proceso Poisson @5 13`
N21				`@1 050`

Format Inist (serveur)

NO :	PASCAL 01-0078809 INIST
ET :	Open-loop routeing to M parallel servers with no buffers
AU :	ALTMAN (Eitan); BHULAI (Sandjai); GAUJAL (Bruno); HORDIJK (Arie)
AF :	INRIA/Inconnu (1 aut.); Vrije Universiteit Amsterdam/Pays-Bas (2 aut.); LORIA/Inconnu (3 aut.); Leiden University/Pays-Bas (4 aut.)
DT :	Publication en série; Niveau analytique
SO :	Journal of applied probability; ISSN 0021-9002; Coden JPRBAM; Royaume-Uni; Da. 2000; Vol. 37; No. 3; Pp. 668-684; Bibl. 15 ref.
LA :	Anglais
EA :	In this paper we study the assignment of packets to M parallel heterogeneous servers with no buffers. The controller does not have knowledge on the state of the servers and bases all decisions on the number of time slots ago that packets have been sent to the different servers. The objective of the controller is to minimize the expected average cost. We consider a general stationary arrival process, with no independence assumptions. We show that the problem can be transformed into a Markov Decision Process (MDP). We further show under quite general conditions on cost functions that only a finite number of states have to be considered in this MDP, which then implies the optimality of periodic policies. For the case of two servers we obtain a more detailed structure of the cost and optimal policies. In particular we show that the average cost function is multimodular, and we obtain expressions for the cost for MMPP and MAP processes. Finally we present an application to optimal robot scheduling for Web search engines.
CC :	001D02D08; 001D01A03
FD :	Système commande; Système stochastique; Commande stochastique; Commande optimale; Programmation mathématique; Décision Markov; Processus semi markovien; Boucle ouverte; Acheminement; Processus arrivée; Internet; Recherche information; Processus Poisson
ED :	Control system; Stochastic system; Stochastic control; Optimal control; Mathematical programming; Markov decision; Semimarkovian process; Open loop; Routing; Arrival process; Internet; Information retrieval; Poisson process
SD :	Sistema control; Sistema estocástico; Control estocástico; Control óptimo; Programación matemática; Decisión Markov; Proceso semi markoviano; Bucle abierto; Encaminamiento; Proceso llegada; Internet; Recuperación información; Proceso Poisson
LO :	INIST-12216.354000093753960060
ID :	01-0078809

Links to Exploration step

Pascal:01-0078809

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Open-loop routeing to M parallel servers with no buffers</title>
<author><name sortKey="Altman, Eitan" sort="Altman, Eitan" uniqKey="Altman E" first="Eitan" last="Altman">Eitan Altman</name>
<affiliation><inist:fA14 i1="01"><s1>INRIA</s1>
<s3>INC</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Bhulai, Sandjai" sort="Bhulai, Sandjai" uniqKey="Bhulai S" first="Sandjai" last="Bhulai">Sandjai Bhulai</name>
<affiliation><inist:fA14 i1="02"><s1>Vrije Universiteit Amsterdam</s1>
<s3>NLD</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Gaujal, Bruno" sort="Gaujal, Bruno" uniqKey="Gaujal B" first="Bruno" last="Gaujal">Bruno Gaujal</name>
<affiliation><inist:fA14 i1="03"><s1>LORIA</s1>
<s3>INC</s3>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Hordijk, Arie" sort="Hordijk, Arie" uniqKey="Hordijk A" first="Arie" last="Hordijk">Arie Hordijk</name>
<affiliation><inist:fA14 i1="04"><s1>Leiden University</s1>
<s3>NLD</s3>
<sZ>4 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">01-0078809</idno>
<date when="2000">2000</date>
<idno type="stanalyst">PASCAL 01-0078809 INIST</idno>
<idno type="RBID">Pascal:01-0078809</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000987</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Open-loop routeing to M parallel servers with no buffers</title>
<author><name sortKey="Altman, Eitan" sort="Altman, Eitan" uniqKey="Altman E" first="Eitan" last="Altman">Eitan Altman</name>
<affiliation><inist:fA14 i1="01"><s1>INRIA</s1>
<s3>INC</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Bhulai, Sandjai" sort="Bhulai, Sandjai" uniqKey="Bhulai S" first="Sandjai" last="Bhulai">Sandjai Bhulai</name>
<affiliation><inist:fA14 i1="02"><s1>Vrije Universiteit Amsterdam</s1>
<s3>NLD</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Gaujal, Bruno" sort="Gaujal, Bruno" uniqKey="Gaujal B" first="Bruno" last="Gaujal">Bruno Gaujal</name>
<affiliation><inist:fA14 i1="03"><s1>LORIA</s1>
<s3>INC</s3>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Hordijk, Arie" sort="Hordijk, Arie" uniqKey="Hordijk A" first="Arie" last="Hordijk">Arie Hordijk</name>
<affiliation><inist:fA14 i1="04"><s1>Leiden University</s1>
<s3>NLD</s3>
<sZ>4 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</analytic>
<series><title level="j" type="main">Journal of applied probability</title>
<title level="j" type="abbreviated">J. appl. probab.</title>
<idno type="ISSN">0021-9002</idno>
<imprint><date when="2000">2000</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><title level="j" type="main">Journal of applied probability</title>
<title level="j" type="abbreviated">J. appl. probab.</title>
<idno type="ISSN">0021-9002</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Arrival process</term>
<term>Control system</term>
<term>Information retrieval</term>
<term>Internet</term>
<term>Markov decision</term>
<term>Mathematical programming</term>
<term>Open loop</term>
<term>Optimal control</term>
<term>Poisson process</term>
<term>Routing</term>
<term>Semimarkovian process</term>
<term>Stochastic control</term>
<term>Stochastic system</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Système commande</term>
<term>Système stochastique</term>
<term>Commande stochastique</term>
<term>Commande optimale</term>
<term>Programmation mathématique</term>
<term>Décision Markov</term>
<term>Processus semi markovien</term>
<term>Boucle ouverte</term>
<term>Acheminement</term>
<term>Processus arrivée</term>
<term>Internet</term>
<term>Recherche information</term>
<term>Processus Poisson</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">In this paper we study the assignment of packets to M parallel heterogeneous servers with no buffers. The controller does not have knowledge on the state of the servers and bases all decisions on the number of time slots ago that packets have been sent to the different servers. The objective of the controller is to minimize the expected average cost. We consider a general stationary arrival process, with no independence assumptions. We show that the problem can be transformed into a Markov Decision Process (MDP). We further show under quite general conditions on cost functions that only a finite number of states have to be considered in this MDP, which then implies the optimality of periodic policies. For the case of two servers we obtain a more detailed structure of the cost and optimal policies. In particular we show that the average cost function is multimodular, and we obtain expressions for the cost for MMPP and MAP processes. Finally we present an application to optimal robot scheduling for Web search engines.</div>
</front>
</TEI>
<inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0021-9002</s0>
</fA01>
<fA02 i1="01"><s0>JPRBAM</s0>
</fA02>
<fA03 i2="1"><s0>J. appl. probab.</s0>
</fA03>
<fA05><s2>37</s2>
</fA05>
<fA06><s2>3</s2>
</fA06>
<fA08 i1="01" i2="1" l="ENG"><s1>Open-loop routeing to M parallel servers with no buffers</s1>
</fA08>
<fA11 i1="01" i2="1"><s1>ALTMAN (Eitan)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>BHULAI (Sandjai)</s1>
</fA11>
<fA11 i1="03" i2="1"><s1>GAUJAL (Bruno)</s1>
</fA11>
<fA11 i1="04" i2="1"><s1>HORDIJK (Arie)</s1>
</fA11>
<fA14 i1="01"><s1>INRIA</s1>
<s3>INC</s3>
<sZ>1 aut.</sZ>
</fA14>
<fA14 i1="02"><s1>Vrije Universiteit Amsterdam</s1>
<s3>NLD</s3>
<sZ>2 aut.</sZ>
</fA14>
<fA14 i1="03"><s1>LORIA</s1>
<s3>INC</s3>
<sZ>3 aut.</sZ>
</fA14>
<fA14 i1="04"><s1>Leiden University</s1>
<s3>NLD</s3>
<sZ>4 aut.</sZ>
</fA14>
<fA20><s1>668-684</s1>
</fA20>
<fA21><s1>2000</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA43 i1="01"><s1>INIST</s1>
<s2>12216</s2>
<s5>354000093753960060</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 2001 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>15 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>01-0078809</s0>
</fA47>
<fA60><s1>P</s1>
</fA60>
<fA61><s0>A</s0>
</fA61>
<fA64 i1="01" i2="1"><s0>Journal of applied probability</s0>
</fA64>
<fA66 i1="01"><s0>GBR</s0>
</fA66>
<fC01 i1="01" l="ENG"><s0>In this paper we study the assignment of packets to M parallel heterogeneous servers with no buffers. The controller does not have knowledge on the state of the servers and bases all decisions on the number of time slots ago that packets have been sent to the different servers. The objective of the controller is to minimize the expected average cost. We consider a general stationary arrival process, with no independence assumptions. We show that the problem can be transformed into a Markov Decision Process (MDP). We further show under quite general conditions on cost functions that only a finite number of states have to be considered in this MDP, which then implies the optimality of periodic policies. For the case of two servers we obtain a more detailed structure of the cost and optimal policies. In particular we show that the average cost function is multimodular, and we obtain expressions for the cost for MMPP and MAP processes. Finally we present an application to optimal robot scheduling for Web search engines.</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001D02D08</s0>
</fC02>
<fC02 i1="02" i2="X"><s0>001D01A03</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Système commande</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>Control system</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Sistema control</s0>
<s5>01</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE"><s0>Système stochastique</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>Stochastic system</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Sistema estocástico</s0>
<s5>02</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE"><s0>Commande stochastique</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>Stochastic control</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Control estocástico</s0>
<s5>03</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE"><s0>Commande optimale</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG"><s0>Optimal control</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="SPA"><s0>Control óptimo</s0>
<s5>04</s5>
</fC03>
<fC03 i1="05" i2="X" l="FRE"><s0>Programmation mathématique</s0>
<s5>05</s5>
</fC03>
<fC03 i1="05" i2="X" l="ENG"><s0>Mathematical programming</s0>
<s5>05</s5>
</fC03>
<fC03 i1="05" i2="X" l="SPA"><s0>Programación matemática</s0>
<s5>05</s5>
</fC03>
<fC03 i1="06" i2="X" l="FRE"><s0>Décision Markov</s0>
<s5>06</s5>
</fC03>
<fC03 i1="06" i2="X" l="ENG"><s0>Markov decision</s0>
<s5>06</s5>
</fC03>
<fC03 i1="06" i2="X" l="SPA"><s0>Decisión Markov</s0>
<s5>06</s5>
</fC03>
<fC03 i1="07" i2="X" l="FRE"><s0>Processus semi markovien</s0>
<s5>07</s5>
</fC03>
<fC03 i1="07" i2="X" l="ENG"><s0>Semimarkovian process</s0>
<s5>07</s5>
</fC03>
<fC03 i1="07" i2="X" l="SPA"><s0>Proceso semi markoviano</s0>
<s5>07</s5>
</fC03>
<fC03 i1="08" i2="X" l="FRE"><s0>Boucle ouverte</s0>
<s5>08</s5>
</fC03>
<fC03 i1="08" i2="X" l="ENG"><s0>Open loop</s0>
<s5>08</s5>
</fC03>
<fC03 i1="08" i2="X" l="SPA"><s0>Bucle abierto</s0>
<s5>08</s5>
</fC03>
<fC03 i1="09" i2="X" l="FRE"><s0>Acheminement</s0>
<s5>09</s5>
</fC03>
<fC03 i1="09" i2="X" l="ENG"><s0>Routing</s0>
<s5>09</s5>
</fC03>
<fC03 i1="09" i2="X" l="SPA"><s0>Encaminamiento</s0>
<s5>09</s5>
</fC03>
<fC03 i1="10" i2="X" l="FRE"><s0>Processus arrivée</s0>
<s5>10</s5>
</fC03>
<fC03 i1="10" i2="X" l="ENG"><s0>Arrival process</s0>
<s5>10</s5>
</fC03>
<fC03 i1="10" i2="X" l="SPA"><s0>Proceso llegada</s0>
<s5>10</s5>
</fC03>
<fC03 i1="11" i2="X" l="FRE"><s0>Internet</s0>
<s5>11</s5>
</fC03>
<fC03 i1="11" i2="X" l="ENG"><s0>Internet</s0>
<s5>11</s5>
</fC03>
<fC03 i1="11" i2="X" l="SPA"><s0>Internet</s0>
<s5>11</s5>
</fC03>
<fC03 i1="12" i2="X" l="FRE"><s0>Recherche information</s0>
<s5>12</s5>
</fC03>
<fC03 i1="12" i2="X" l="ENG"><s0>Information retrieval</s0>
<s5>12</s5>
</fC03>
<fC03 i1="12" i2="X" l="SPA"><s0>Recuperación información</s0>
<s5>12</s5>
</fC03>
<fC03 i1="13" i2="X" l="FRE"><s0>Processus Poisson</s0>
<s5>13</s5>
</fC03>
<fC03 i1="13" i2="X" l="ENG"><s0>Poisson process</s0>
<s5>13</s5>
</fC03>
<fC03 i1="13" i2="X" l="SPA"><s0>Proceso Poisson</s0>
<s5>13</s5>
</fC03>
<fN21><s1>050</s1>
</fN21>
</pA>
</standard>
<server><NO>PASCAL 01-0078809 INIST</NO>
<ET>Open-loop routeing to M parallel servers with no buffers</ET>
<AU>ALTMAN (Eitan); BHULAI (Sandjai); GAUJAL (Bruno); HORDIJK (Arie)</AU>
<AF>INRIA/Inconnu (1 aut.); Vrije Universiteit Amsterdam/Pays-Bas (2 aut.); LORIA/Inconnu (3 aut.); Leiden University/Pays-Bas (4 aut.)</AF>
<DT>Publication en série; Niveau analytique</DT>
<SO>Journal of applied probability; ISSN 0021-9002; Coden JPRBAM; Royaume-Uni; Da. 2000; Vol. 37; No. 3; Pp. 668-684; Bibl. 15 ref.</SO>
<LA>Anglais</LA>
<EA>In this paper we study the assignment of packets to M parallel heterogeneous servers with no buffers. The controller does not have knowledge on the state of the servers and bases all decisions on the number of time slots ago that packets have been sent to the different servers. The objective of the controller is to minimize the expected average cost. We consider a general stationary arrival process, with no independence assumptions. We show that the problem can be transformed into a Markov Decision Process (MDP). We further show under quite general conditions on cost functions that only a finite number of states have to be considered in this MDP, which then implies the optimality of periodic policies. For the case of two servers we obtain a more detailed structure of the cost and optimal policies. In particular we show that the average cost function is multimodular, and we obtain expressions for the cost for MMPP and MAP processes. Finally we present an application to optimal robot scheduling for Web search engines.</EA>
<CC>001D02D08; 001D01A03</CC>
<FD>Système commande; Système stochastique; Commande stochastique; Commande optimale; Programmation mathématique; Décision Markov; Processus semi markovien; Boucle ouverte; Acheminement; Processus arrivée; Internet; Recherche information; Processus Poisson</FD>
<ED>Control system; Stochastic system; Stochastic control; Optimal control; Mathematical programming; Markov decision; Semimarkovian process; Open loop; Routing; Arrival process; Internet; Information retrieval; Poisson process</ED>
<SD>Sistema control; Sistema estocástico; Control estocástico; Control óptimo; Programación matemática; Decisión Markov; Proceso semi markoviano; Bucle abierto; Encaminamiento; Proceso llegada; Internet; Recuperación información; Proceso Poisson</SD>
<LO>INIST-12216.354000093753960060</LO>
<ID>01-0078809</ID>
</server>
</inist>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/PascalFrancis/Corpus

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

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

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

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    PascalFrancis
   |étape=   Corpus
   |type=    RBID
   |clé=     Pascal:01-0078809
   |texte=   Open-loop routeing to M parallel servers with no buffers
}}

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022

	Serveur d'exploration sur la recherche en informatique en Lorraine
	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 la recherche en informatique en Lorraine

Open-loop routeing to M parallel servers with no buffers

Open-loop routeing to M parallel servers with no buffers

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