About: M/En/1/m queuing system subject to catastrophes     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
rdfs:seeAlso
Description
  • The paper is focused on a finite single-server queuing system with a server subject to so-called catastrophes. The catastrophes represent a special type of failures that cause emptying the system (all the customers found in the system are flushed out of the system). When the server is up, the customers arrive according to a Poisson input process with the parameter λ > 0. When the server is under repair (down), all the arriving customers refuse to enter the system because they are not willing to wait. The customer’s service time is assumed to be Erlang distributed with the shape parameter n and the scale parameter nμ. That means the service process of each customer consists of n exponentially distributed phases and the customer is served after finishing the last phase of the service process. Times between catastrophes are exponentially distributed with the parameter η; times to repair are also exponentially distributed, but with the parameter ζ. In the paper we present a mathematical model of the studied queuing system that enables to numerically calculate steady-state probabilities. We discuss some performance measures of the system and some possible modifications of the studied queuing system. Some numerical results are presented in the paper.
  • The paper is focused on a finite single-server queuing system with a server subject to so-called catastrophes. The catastrophes represent a special type of failures that cause emptying the system (all the customers found in the system are flushed out of the system). When the server is up, the customers arrive according to a Poisson input process with the parameter λ > 0. When the server is under repair (down), all the arriving customers refuse to enter the system because they are not willing to wait. The customer’s service time is assumed to be Erlang distributed with the shape parameter n and the scale parameter nμ. That means the service process of each customer consists of n exponentially distributed phases and the customer is served after finishing the last phase of the service process. Times between catastrophes are exponentially distributed with the parameter η; times to repair are also exponentially distributed, but with the parameter ζ. In the paper we present a mathematical model of the studied queuing system that enables to numerically calculate steady-state probabilities. We discuss some performance measures of the system and some possible modifications of the studied queuing system. Some numerical results are presented in the paper. (en)
Title
  • M/En/1/m queuing system subject to catastrophes
  • M/En/1/m queuing system subject to catastrophes (en)
skos:prefLabel
  • M/En/1/m queuing system subject to catastrophes
  • M/En/1/m queuing system subject to catastrophes (en)
skos:notation
  • RIV/61989100:27230/14:86091642!RIV15-MSM-27230___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • S
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 28323
http://linked.open...ai/riv/idVysledku
  • RIV/61989100:27230/14:86091642
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • Matlab; catastrophes; queuing; M/En/1/m (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [3DD1406CAB1C]
http://linked.open...v/mistoKonaniAkce
  • Olomouc
http://linked.open...i/riv/mistoVydani
  • Olomouc
http://linked.open...i/riv/nazevZdroje
  • Mathematical Methods in Economics, MME 2014 : 32nd international conference : September 10-12, 2014, Olomouc, Czech Republic : conference proceedings
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Dorda, Michal
  • Teichmann, Dušan
http://linked.open...vavai/riv/typAkce
http://linked.open.../riv/zahajeniAkce
number of pages
http://purl.org/ne...btex#hasPublisher
  • Univerzita Palackého v Olomouci
https://schema.org/isbn
  • 978-80-244-4209-9
http://localhost/t...ganizacniJednotka
  • 27230
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software