1 queue

An Entity of Type: StochasticProcess113561896, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

In queueing theory, a discipline within the mathematical theory of probability, an M/D/1 queue represents the queue length in a system having a single server, where arrivals are determined by a Poisson process and job service times are fixed (deterministic). The model name is written in Kendall's notation. Agner Krarup Erlang first published on this model in 1909, starting the subject of queueing theory. An extension of this model with more than one server is the M/D/c queue.

Property	Value
dbo:abstract	In queueing theory, a discipline within the mathematical theory of probability, an M/D/1 queue represents the queue length in a system having a single server, where arrivals are determined by a Poisson process and job service times are fixed (deterministic). The model name is written in Kendall's notation. Agner Krarup Erlang first published on this model in 1909, starting the subject of queueing theory. An extension of this model with more than one server is the M/D/c queue. (en)
dbo:wikiPageID	37844292 (xsd:integer)
dbo:wikiPageLength	10098 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID	1021768945 (xsd:integer)
dbo:wikiPageWikiLink	dbr:M/D/c_queue dbr:M/G/1_queue dbr:State_space dbr:Agner_Krarup_Erlang dbr:Kendall's_notation dbr:Probability_theory dbr:Queueing_theory dbr:First-come,_first-served dbr:Borel_distribution dbc:Single_queueing_nodes dbr:Network_planning_and_design dbr:Poisson_process dbr:Probability_generating_function
dbp:wikiPageUsesTemplate	dbt:Stochastic_processes dbt:Queueing_theory
dcterms:subject	dbc:Single_queueing_nodes
rdf:type	yago:WikicatStochasticProcesses yago:Abstraction100002137 yago:Cognition100023271 yago:Concept105835747 yago:Content105809192 yago:Hypothesis105888929 yago:Idea105833840 yago:Model105890249 yago:PsychologicalFeature100023100 yago:StochasticProcess113561896
rdfs:comment	In queueing theory, a discipline within the mathematical theory of probability, an M/D/1 queue represents the queue length in a system having a single server, where arrivals are determined by a Poisson process and job service times are fixed (deterministic). The model name is written in Kendall's notation. Agner Krarup Erlang first published on this model in 1909, starting the subject of queueing theory. An extension of this model with more than one server is the M/D/c queue. (en)
rdfs:label	M/D/1 queue (en)
owl:sameAs	freebase:M/D/1 queue wikidata:M/D/1 queue dbpedia-hu:M/D/1 queue https://global.dbpedia.org/id/3cnwM
prov:wasDerivedFrom	wikipedia-en:M/D/1_queue?oldid=1021768945&ns=0
foaf:isPrimaryTopicOf	wikipedia-en:M/D/1_queue
is dbo:wikiPageRedirects of	dbr:M/D/1
is dbo:wikiPageWikiLink of	dbr:M/D/c_queue dbr:Kendall's_notation dbr:Queueing_theory dbr:Borel_distribution dbr:List_of_statistics_articles dbr:M/D/1
is foaf:primaryTopic of	wikipedia-en:M/D/1_queue