About: M/M/c queue

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: M/M/c queue Goto Sponge NotDistinct Permalink

An Entity of Type : yago:StochasticProcess113561896, within Data Space : dbpedia.org associated with source document(s)
QRcode icon

http://dbpedia.org/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FM%2FM%2Fc_queue

In queueing theory, a discipline within , the queue (or Erlang–T model) is a multi-server queueing model. In Kendall's notation it describes a system where arrivals form a single queue and are governed by a , there are servers, and job service times are exponentially distributed. It is a generalization of which considers only a single server. The model with infinitely many servers is the M/M/∞ queue.

Attributes	Values
rdf:type	person yago:WikicatStochasticProcesses yago:Abstraction100002137 yago:Cognition100023271 yago:Concept105835747 yago:Content105809192 yago:Hypothesis105888929 yago:Idea105833840 yago:Model105890249 yago:PsychologicalFeature100023100 yago:StochasticProcess113561896
rdfs:label	Coda M/M/c (it) M/M/c queue (en) M/M/c (pl)
rdfs:comment	In queueing theory, a discipline within , the queue (or Erlang–T model) is a multi-server queueing model. In Kendall's notation it describes a system where arrivals form a single queue and are governed by a , there are servers, and job service times are exponentially distributed. It is a generalization of which considers only a single server. The model with infinitely many servers is the M/M/∞ queue. (en) In teoria delle code, una coda M/M/c rappresenta la lunghezza di una coda in un sistema composto da c server, in cui gli arrivi sono determinati da un processo di Poisson e i tempi servizio hanno distribuzione esponenziale di parametro μ. Il nome è dovuto alla Notazione di Kendall. La coda M/M/1 è un suo caso particolare. (it) M/M/c – system kolejkowy, w którym rozkład czasu pomiędzy kolejnymi zgłoszeniami do systemu oraz rozkład czasu obsługi pojedynczego zgłoszenia są rozkładami wykładniczymi, istnieje stanowisk obsługi i nie ma kolejki do systemu (każde zgłoszenie przybyłe w momencie, gdy wszystkie stanowiska obsługi są zajęte, jest odrzucane) (pl)
foaf:depiction
dcterms:subject	Single queueing nodes
Wikipage page ID	23152853 (xsd:integer)
Wikipage revision ID	1121439141 (xsd:integer)
Link from a Wikipage to another Wikipage	M/G/k queue Transition rate matrix State space Laplace–Stieltjes transform Erlang distribution Exponential distribution Birth–death process Single queueing nodes Probability mass function Volterra integral equation Spectral expansion solution Halfin–Whitt Erlang's C formula Queueing model Poisson process Continuous time Markov chain
sameAs	M/M/c queue M/M/c queue M/M/c queue M/M/c queue M/M/c queue M/M/c queue M/M/c queue
dbp:wikiPageUsesTemplate	dbt:Block_indent dbt:Reflist dbt:Rp dbt:Short_description dbt:Use_American_English dbt:Var dbt:Stochastic_processes dbt:Queueing_theory
thumbnail	wiki-commons:Special:FilePath/Mmc-statespace.svg?width=300
has abstract	In queueing theory, a discipline within , the queue (or Erlang–T model) is a multi-server queueing model. In Kendall's notation it describes a system where arrivals form a single queue and are governed by a , there are servers, and job service times are exponentially distributed. It is a generalization of which considers only a single server. The model with infinitely many servers is the M/M/∞ queue. (en) In teoria delle code, una coda M/M/c rappresenta la lunghezza di una coda in un sistema composto da c server, in cui gli arrivi sono determinati da un processo di Poisson e i tempi servizio hanno distribuzione esponenziale di parametro μ. Il nome è dovuto alla Notazione di Kendall. La coda M/M/1 è un suo caso particolare. (it) M/M/c – system kolejkowy, w którym rozkład czasu pomiędzy kolejnymi zgłoszeniami do systemu oraz rozkład czasu obsługi pojedynczego zgłoszenia są rozkładami wykładniczymi, istnieje stanowisk obsługi i nie ma kolejki do systemu (każde zgłoszenie przybyłe w momencie, gdy wszystkie stanowiska obsługi są zajęte, jest odrzucane) (pl)
gold:hypernym	Model
prov:wasDerivedFrom	wikipedia-en:M/M/c_queue?oldid=1121439141&ns=0
page length (characters) of wiki page	14893 (xsd:nonNegativeInteger)
foaf:isPrimaryTopicOf	wikipedia-en:M/M/c_queue
is Link from a Wikipage to another Wikipage of	M/G/1 queue M/G/k queue M/M/1 queue M/M/∞ queue Call centre G/G/1 queue Erlang (unit) Kendall's notation Birth–death process Burke's theorem MMC List of statistics articles Spectral expansion solution Halfin-Whitt Halfin-Whitt regime Halfin–Whitt Halfin–Whitt regime Erlang-C model Erlang–C model M/M/c M/M/c model M/M/m M/M/m queue M/M/n queue M/M/s M/M/s queue
is Wikipage redirect of	Halfin-Whitt Halfin-Whitt regime Halfin–Whitt Halfin–Whitt regime Erlang-C model Erlang–C model M/M/c M/M/c model M/M/m M/M/m queue M/M/n queue M/M/s M/M/s queue

Faceted Search & Find service v1.17_git139 as of Feb 29 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (61 GB total memory, 50 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software