The M/G/1 processor sharing queue as the almost sure limit of feedback queues
- Author
- RESING, J. A. C; HOOGHIEMSTRA, G; KEANE, M. S
Delft univ. technology, fac. tech. mathematics informatics, Delft AJ 2600, Netherlands - Source
Journal of applied probability. 1990, Vol 27, Num 4, pp 913-918 ; ref : 7 ref
- CODEN
- JPRBAM
- ISSN
- 0021-9002
- Scientific domain
- Computer science; Mathematics
- Publisher
- Applied Probability Trust, Sheffield
- Publication country
- United Kingdom
- Document type
- Article
- Language
- English
- Keyword (fr)
- Boucle réaction Convergence en loi Convergence presque sûre Couplage File attente Processeur Processus régénératif Temps séjour
- Keyword (en)
- Feedback operation Convergence in law Almost sure convergence Coupling Queue Processor Regenerative process Residence time
- Keyword (es)
- Retroalimentación Convergencia en ley Convergencia casi segura Acoplamiento Fila espera Procesador Proceso regenerativo Tiempo estancia
- Classification
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D01 Operational research. Management science / 001D01A Operational research and scientific management / 001D01A05 Queuing theory. Traffic theory
- Discipline
- Operational research. Management
- Origin
- Inist-CNRS
- Database
- PASCAL
- INIST identifier
- 4964869
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Access to the document
Install on your browser
DOI
10.2307/3214834 
https://dx.doi.org/10.2307/3214834
"O:13:\"PanistOpenUrl\":36:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000idc\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:15:\"10.2307\/3214834\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:77:\"The M\/G\/1 processor sharing queue as the almost sure limit of feedback queues\";s:9:\"\u0000*\u0000jtitle\";s:30:\"Journal of applied probability\";s:9:\"\u0000*\u0000stitle\";s:15:\"J. appl. probab\";s:7:\"\u0000*\u0000date\";s:4:\"1990\";s:9:\"\u0000*\u0000volume\";s:2:\"27\";s:8:\"\u0000*\u0000issue\";s:1:\"4\";s:8:\"\u0000*\u0000spage\";s:3:\"913\";s:8:\"\u0000*\u0000epage\";s:3:\"918\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0021-9002\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:6:\"RESING\";s:10:\"\u0000*\u0000aufirst\";s:7:\"J. A. C\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:15:\"HOOGHIEMSTRA, G\";i:1;s:11:\"KEANE, M. S\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"JPRBAM\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:77:\"The M\/G\/1 processor sharing queue as the almost sure limit of feedback queues\";s:8:\"\u0000*\u0000place\";s:9:\"Sheffield\";s:6:\"\u0000*\u0000pub\";s:25:\"Applied Probability Trust\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Panist access
"O:12:\"IstexOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:15:\"10.2307\/3214834\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:77:\"The M\/G\/1 processor sharing queue as the almost sure limit of feedback queues\";s:9:\"\u0000*\u0000jtitle\";s:30:\"Journal of applied probability\";s:9:\"\u0000*\u0000stitle\";s:15:\"J. appl. probab\";s:7:\"\u0000*\u0000date\";s:4:\"1990\";s:9:\"\u0000*\u0000volume\";s:2:\"27\";s:8:\"\u0000*\u0000issue\";s:1:\"4\";s:8:\"\u0000*\u0000spage\";s:3:\"913\";s:8:\"\u0000*\u0000epage\";s:3:\"918\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0021-9002\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:6:\"RESING\";s:10:\"\u0000*\u0000aufirst\";s:7:\"J. A. C\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:15:\"HOOGHIEMSTRA, G\";i:1;s:11:\"KEANE, M. S\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"JPRBAM\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:77:\"The M\/G\/1 processor sharing queue as the almost sure limit of feedback queues\";s:8:\"\u0000*\u0000place\";s:9:\"Sheffield\";s:6:\"\u0000*\u0000pub\";s:25:\"Applied Probability Trust\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Istex access
"O:16:\"UnpaywallOpenUrl\":35:{s:8:\"\u0000*\u0000email\";s:27:\"assistance-portail@inist.fr\";s:6:\"\u0000*\u0000fmt\";N;s:6:\"\u0000*\u0000doi\";s:15:\"10.2307\/3214834\";s:6:\"\u0000*\u0000pii\";N;s:7:\"\u0000*\u0000pmid\";N;s:9:\"\u0000*\u0000atitle\";N;s:9:\"\u0000*\u0000jtitle\";N;s:9:\"\u0000*\u0000stitle\";N;s:7:\"\u0000*\u0000date\";N;s:9:\"\u0000*\u0000volume\";N;s:8:\"\u0000*\u0000issue\";N;s:8:\"\u0000*\u0000spage\";N;s:8:\"\u0000*\u0000epage\";N;s:8:\"\u0000*\u0000pages\";N;s:7:\"\u0000*\u0000issn\";N;s:8:\"\u0000*\u0000eissn\";N;s:9:\"\u0000*\u0000aulast\";N;s:10:\"\u0000*\u0000aufirst\";N;s:9:\"\u0000*\u0000auinit\";N;s:10:\"\u0000*\u0000auinitm\";N;s:5:\"\u0000*\u0000au\";N;s:9:\"\u0000*\u0000aucorp\";N;s:7:\"\u0000*\u0000isbn\";N;s:8:\"\u0000*\u0000coden\";N;s:8:\"\u0000*\u0000genre\";N;s:7:\"\u0000*\u0000part\";N;s:9:\"\u0000*\u0000btitle\";N;s:8:\"\u0000*\u0000title\";N;s:8:\"\u0000*\u0000place\";N;s:6:\"\u0000*\u0000pub\";N;s:10:\"\u0000*\u0000edition\";N;s:9:\"\u0000*\u0000tpages\";N;s:9:\"\u0000*\u0000series\";N;s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";N;}"
Unpaywall access
"O:16:\"EuropePMCOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:15:\"10.2307\/3214834\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:77:\"The M\/G\/1 processor sharing queue as the almost sure limit of feedback queues\";s:9:\"\u0000*\u0000jtitle\";s:30:\"Journal of applied probability\";s:9:\"\u0000*\u0000stitle\";s:15:\"J. appl. probab\";s:7:\"\u0000*\u0000date\";s:4:\"1990\";s:9:\"\u0000*\u0000volume\";s:2:\"27\";s:8:\"\u0000*\u0000issue\";s:1:\"4\";s:8:\"\u0000*\u0000spage\";s:3:\"913\";s:8:\"\u0000*\u0000epage\";s:3:\"918\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0021-9002\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:6:\"RESING\";s:10:\"\u0000*\u0000aufirst\";s:7:\"J. A. C\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:15:\"HOOGHIEMSTRA, G\";i:1;s:11:\"KEANE, M. S\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"JPRBAM\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:77:\"The M\/G\/1 processor sharing queue as the almost sure limit of feedback queues\";s:8:\"\u0000*\u0000place\";s:9:\"Sheffield\";s:6:\"\u0000*\u0000pub\";s:25:\"Applied Probability Trust\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Europe PubMed Central access
"O:11:\"BaseOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:15:\"10.2307\/3214834\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:77:\"The M\/G\/1 processor sharing queue as the almost sure limit of feedback queues\";s:9:\"\u0000*\u0000jtitle\";s:30:\"Journal of applied probability\";s:9:\"\u0000*\u0000stitle\";s:15:\"J. appl. probab\";s:7:\"\u0000*\u0000date\";s:4:\"1990\";s:9:\"\u0000*\u0000volume\";s:2:\"27\";s:8:\"\u0000*\u0000issue\";s:1:\"4\";s:8:\"\u0000*\u0000spage\";s:3:\"913\";s:8:\"\u0000*\u0000epage\";s:3:\"918\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0021-9002\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:6:\"RESING\";s:10:\"\u0000*\u0000aufirst\";s:7:\"J. A. C\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:15:\"HOOGHIEMSTRA, G\";i:1;s:11:\"KEANE, M. S\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"JPRBAM\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:77:\"The M\/G\/1 processor sharing queue as the almost sure limit of feedback queues\";s:8:\"\u0000*\u0000place\";s:9:\"Sheffield\";s:6:\"\u0000*\u0000pub\";s:25:\"Applied Probability Trust\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Base Search access
"O:12:\"ArXivOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:15:\"10.2307\/3214834\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:77:\"The M\/G\/1 processor sharing queue as the almost sure limit of feedback queues\";s:9:\"\u0000*\u0000jtitle\";s:30:\"Journal of applied probability\";s:9:\"\u0000*\u0000stitle\";s:15:\"J. appl. probab\";s:7:\"\u0000*\u0000date\";s:4:\"1990\";s:9:\"\u0000*\u0000volume\";s:2:\"27\";s:8:\"\u0000*\u0000issue\";s:1:\"4\";s:8:\"\u0000*\u0000spage\";s:3:\"913\";s:8:\"\u0000*\u0000epage\";s:3:\"918\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0021-9002\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:6:\"RESING\";s:10:\"\u0000*\u0000aufirst\";s:7:\"J. A. C\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:15:\"HOOGHIEMSTRA, G\";i:1;s:11:\"KEANE, M. S\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"JPRBAM\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:77:\"The M\/G\/1 processor sharing queue as the almost sure limit of feedback queues\";s:8:\"\u0000*\u0000place\";s:9:\"Sheffield\";s:6:\"\u0000*\u0000pub\";s:25:\"Applied Probability Trust\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
arXiv access
