PROCESSOR SHARING G-QUEUES WITH INERT CUSTOMERS AND CATASTROPHES: A MODEL FOR SERVER AGING AND REJUVENATION
We consider open networks of queues with Processor-Sharing discipline and signals. The signals deletes all the customers present in the queues and vanish instantaneously. The customers may be usual customers or inert customers. Inert customers do not receive service but the servers still try to shar...
Gespeichert in:
| Veröffentlicht in: | Probability in the engineering and informational sciences 2017-10, Vol.31 (4), p.420-435 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 435 |
|---|---|
| container_issue | 4 |
| container_start_page | 420 |
| container_title | Probability in the engineering and informational sciences |
| container_volume | 31 |
| creator | Fourneau, J.-M. Ait El Majhoub, Y. |
| description | We consider open networks of queues with Processor-Sharing discipline and signals. The signals deletes all the customers present in the queues and vanish instantaneously. The customers may be usual customers or inert customers. Inert customers do not receive service but the servers still try to share the service capacity between all the customers (inert or usual). Thus a part of the service capacity is wasted. We prove that such a model has a product-form steady-state distribution when the signal arrival rates are positive. |
| doi_str_mv | 10.1017/S0269964817000092 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_hal_p</sourceid><recordid>TN_cdi_hal_primary_oai_HAL_hal_01832157v1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><cupid>10_1017_S0269964817000092</cupid><sourcerecordid>1942197153</sourcerecordid><originalsourceid>FETCH-LOGICAL-c351t-cf11e4c986c5e46d62b1f22d598f623adc7b795648097a432c8c03c28ff973aa3</originalsourceid><addsrcrecordid>eNp1kE1LxDAQhoMouH78AG8BTx6qnaRtEm-hxm1lt12TVo8lm211_dq1VcF_b8uKCOJcAjPP-zAZhI7APwUf2JnxSSREFHBgfl-CbKERBJHwuAhhG42GsTfMd9Fe1z30COMBH6HHmc5jZUyusUmkTrMxHnvXpSqVwbdpkeA0U7rAcWmKfKq0wTK7wLEspCl0PkuUOccST_MLNcGXg0PpG6WxHA-iAdXqqrxRmSzSPDtAO4196urD73cflZeqiBNvko_TWE48R0N481wDUAdO8MiFdRAtIjKHhpBFKHgTEWoXjs2ZCPu_-ILZgBLHnU8d4U0jGLWW7qOTjffePlXrdvls289qZZdVIifV0POBUwIh-4CePd6w63b1-l53b9XD6r196derQAQEBIOQ9hRsKNeuuq6tmx8t-NVw_-rP_fsM_c7Y53m7XNzVv9T_pr4AHQZ8SA</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1942197153</pqid></control><display><type>article</type><title>PROCESSOR SHARING G-QUEUES WITH INERT CUSTOMERS AND CATASTROPHES: A MODEL FOR SERVER AGING AND REJUVENATION</title><source>Cambridge University Press Journals Complete</source><creator>Fourneau, J.-M. ; Ait El Majhoub, Y.</creator><creatorcontrib>Fourneau, J.-M. ; Ait El Majhoub, Y.</creatorcontrib><description>We consider open networks of queues with Processor-Sharing discipline and signals. The signals deletes all the customers present in the queues and vanish instantaneously. The customers may be usual customers or inert customers. Inert customers do not receive service but the servers still try to share the service capacity between all the customers (inert or usual). Thus a part of the service capacity is wasted. We prove that such a model has a product-form steady-state distribution when the signal arrival rates are positive.</description><identifier>ISSN: 0269-9648</identifier><identifier>EISSN: 1469-8951</identifier><identifier>DOI: 10.1017/S0269964817000092</identifier><language>eng</language><publisher>New York, USA: Cambridge University Press</publisher><subject>Computer Science ; Customer services ; Customers ; Mathematics ; Microprocessors ; Queues</subject><ispartof>Probability in the engineering and informational sciences, 2017-10, Vol.31 (4), p.420-435</ispartof><rights>Copyright © Cambridge University Press 2017</rights><rights>Distributed under a Creative Commons Attribution 4.0 International License</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c351t-cf11e4c986c5e46d62b1f22d598f623adc7b795648097a432c8c03c28ff973aa3</citedby><cites>FETCH-LOGICAL-c351t-cf11e4c986c5e46d62b1f22d598f623adc7b795648097a432c8c03c28ff973aa3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.cambridge.org/core/product/identifier/S0269964817000092/type/journal_article$$EHTML$$P50$$Gcambridge$$H</linktohtml><link.rule.ids>164,230,314,780,784,885,27924,27925,55628</link.rule.ids><backlink>$$Uhttps://hal.uvsq.fr/hal-01832157$$DView record in HAL$$Hfree_for_read</backlink></links><search><creatorcontrib>Fourneau, J.-M.</creatorcontrib><creatorcontrib>Ait El Majhoub, Y.</creatorcontrib><title>PROCESSOR SHARING G-QUEUES WITH INERT CUSTOMERS AND CATASTROPHES: A MODEL FOR SERVER AGING AND REJUVENATION</title><title>Probability in the engineering and informational sciences</title><addtitle>Prob. Eng. Inf. Sci</addtitle><description>We consider open networks of queues with Processor-Sharing discipline and signals. The signals deletes all the customers present in the queues and vanish instantaneously. The customers may be usual customers or inert customers. Inert customers do not receive service but the servers still try to share the service capacity between all the customers (inert or usual). Thus a part of the service capacity is wasted. We prove that such a model has a product-form steady-state distribution when the signal arrival rates are positive.</description><subject>Computer Science</subject><subject>Customer services</subject><subject>Customers</subject><subject>Mathematics</subject><subject>Microprocessors</subject><subject>Queues</subject><issn>0269-9648</issn><issn>1469-8951</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2017</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><recordid>eNp1kE1LxDAQhoMouH78AG8BTx6qnaRtEm-hxm1lt12TVo8lm211_dq1VcF_b8uKCOJcAjPP-zAZhI7APwUf2JnxSSREFHBgfl-CbKERBJHwuAhhG42GsTfMd9Fe1z30COMBH6HHmc5jZUyusUmkTrMxHnvXpSqVwbdpkeA0U7rAcWmKfKq0wTK7wLEspCl0PkuUOccST_MLNcGXg0PpG6WxHA-iAdXqqrxRmSzSPDtAO4196urD73cflZeqiBNvko_TWE48R0N481wDUAdO8MiFdRAtIjKHhpBFKHgTEWoXjs2ZCPu_-ILZgBLHnU8d4U0jGLWW7qOTjffePlXrdvls289qZZdVIifV0POBUwIh-4CePd6w63b1-l53b9XD6r196derQAQEBIOQ9hRsKNeuuq6tmx8t-NVw_-rP_fsM_c7Y53m7XNzVv9T_pr4AHQZ8SA</recordid><startdate>201710</startdate><enddate>201710</enddate><creator>Fourneau, J.-M.</creator><creator>Ait El Majhoub, Y.</creator><general>Cambridge University Press</general><general>Cambridge University Press (CUP)</general><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7SC</scope><scope>7TB</scope><scope>7XB</scope><scope>88I</scope><scope>8AL</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FR3</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>KR7</scope><scope>L6V</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M0N</scope><scope>M2P</scope><scope>M7S</scope><scope>P5Z</scope><scope>P62</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope><scope>Q9U</scope><scope>1XC</scope></search><sort><creationdate>201710</creationdate><title>PROCESSOR SHARING G-QUEUES WITH INERT CUSTOMERS AND CATASTROPHES: A MODEL FOR SERVER AGING AND REJUVENATION</title><author>Fourneau, J.-M. ; Ait El Majhoub, Y.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c351t-cf11e4c986c5e46d62b1f22d598f623adc7b795648097a432c8c03c28ff973aa3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2017</creationdate><topic>Computer Science</topic><topic>Customer services</topic><topic>Customers</topic><topic>Mathematics</topic><topic>Microprocessors</topic><topic>Queues</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Fourneau, J.-M.</creatorcontrib><creatorcontrib>Ait El Majhoub, Y.</creatorcontrib><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>Computer and Information Systems Abstracts</collection><collection>Mechanical & Transportation Engineering Abstracts</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>Science Database (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>Engineering Research Database</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer Science Database</collection><collection>Civil Engineering Abstracts</collection><collection>ProQuest Engineering Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>Computing Database</collection><collection>Science Database</collection><collection>Engineering Database</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection><collection>ProQuest Central Basic</collection><collection>Hyper Article en Ligne (HAL)</collection><jtitle>Probability in the engineering and informational sciences</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Fourneau, J.-M.</au><au>Ait El Majhoub, Y.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>PROCESSOR SHARING G-QUEUES WITH INERT CUSTOMERS AND CATASTROPHES: A MODEL FOR SERVER AGING AND REJUVENATION</atitle><jtitle>Probability in the engineering and informational sciences</jtitle><addtitle>Prob. Eng. Inf. Sci</addtitle><date>2017-10</date><risdate>2017</risdate><volume>31</volume><issue>4</issue><spage>420</spage><epage>435</epage><pages>420-435</pages><issn>0269-9648</issn><eissn>1469-8951</eissn><abstract>We consider open networks of queues with Processor-Sharing discipline and signals. The signals deletes all the customers present in the queues and vanish instantaneously. The customers may be usual customers or inert customers. Inert customers do not receive service but the servers still try to share the service capacity between all the customers (inert or usual). Thus a part of the service capacity is wasted. We prove that such a model has a product-form steady-state distribution when the signal arrival rates are positive.</abstract><cop>New York, USA</cop><pub>Cambridge University Press</pub><doi>10.1017/S0269964817000092</doi><tpages>16</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0269-9648 |
| ispartof | Probability in the engineering and informational sciences, 2017-10, Vol.31 (4), p.420-435 |
| issn | 0269-9648 1469-8951 |
| language | eng |
| recordid | cdi_hal_primary_oai_HAL_hal_01832157v1 |
| source | Cambridge University Press Journals Complete |
| subjects | Computer Science Customer services Customers Mathematics Microprocessors Queues |
| title | PROCESSOR SHARING G-QUEUES WITH INERT CUSTOMERS AND CATASTROPHES: A MODEL FOR SERVER AGING AND REJUVENATION |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-20T20%3A35%3A26IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_hal_p&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=PROCESSOR%20SHARING%20G-QUEUES%20WITH%20INERT%20CUSTOMERS%20AND%20CATASTROPHES:%20A%20MODEL%20FOR%20SERVER%20AGING%20AND%20REJUVENATION&rft.jtitle=Probability%20in%20the%20engineering%20and%20informational%20sciences&rft.au=Fourneau,%20J.-M.&rft.date=2017-10&rft.volume=31&rft.issue=4&rft.spage=420&rft.epage=435&rft.pages=420-435&rft.issn=0269-9648&rft.eissn=1469-8951&rft_id=info:doi/10.1017/S0269964817000092&rft_dat=%3Cproquest_hal_p%3E1942197153%3C/proquest_hal_p%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1942197153&rft_id=info:pmid/&rft_cupid=10_1017_S0269964817000092&rfr_iscdi=true |