Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q2524990> ?p ?o }
Showing triples 1 to 24 of
24
with 100 triples per page.
- Q2524990 subject Q7451816.
- Q2524990 subject Q8806217.
- Q2524990 abstract "In queueing theory, a discipline within the mathematical theory of probability, a Jackson network (sometimes Jacksonian network) is a class of queueing network where the equilibrium distribution is particularly simple to compute as the network has a product-form solution. It was the first significant development in the theory of networks of queues, and generalising and applying the ideas of the theorem to search for similar product-form solutions in other networks has been the subject of much research, including ideas used in the development of the Internet. The networks were first identified by James R. Jackson and his paper was re-printed in the journal Management Science’s ‘Ten Most Influential Titles of Management Sciences First Fifty Years.’Jackson was inspired by the work of Burke and Reich, though Jean Walrand notes "product-form results … [are] a much less immediate result of the output theorem than Jackson himself appeared to believe in his fundamental paper".An earlier product-form solution was found by R. R. P. Jackson for tandem queues (a finite chain of queues where each customer must visit each queue in order) and cyclic networks (a loop of queues where each customer must visit each queue in order).A Jackson network consists of a number of nodes, where each node represents a queue in which the service rate can be both node-dependent and state-dependent. Jobs travel among the nodes following a fixed routing matrix. All jobs at each node belong to a single "class" and jobs follow the same service-time distribution and the same routing mechanism. Consequently, there is no notion of priority in serving the jobs: all jobs at each node are served on a first-come, first-served basis.Jackson networks where a finite population of jobs travel around a closed network also have a product-form solution described by the Gordon–Newell theorem.".
- Q2524990 wikiPageWikiLink Q1145117.
- Q2524990 wikiPageWikiLink Q1356856.
- Q2524990 wikiPageWikiLink Q16864489.
- Q2524990 wikiPageWikiLink Q176645.
- Q2524990 wikiPageWikiLink Q1888574.
- Q2524990 wikiPageWikiLink Q2524990.
- Q2524990 wikiPageWikiLink Q36255.
- Q2524990 wikiPageWikiLink Q4998912.
- Q2524990 wikiPageWikiLink Q5586067.
- Q2524990 wikiPageWikiLink Q5862903.
- Q2524990 wikiPageWikiLink Q6141651.
- Q2524990 wikiPageWikiLink Q7247727.
- Q2524990 wikiPageWikiLink Q729523.
- Q2524990 wikiPageWikiLink Q7307228.
- Q2524990 wikiPageWikiLink Q7451816.
- Q2524990 wikiPageWikiLink Q847526.
- Q2524990 wikiPageWikiLink Q869887.
- Q2524990 wikiPageWikiLink Q8806217.
- Q2524990 wikiPageWikiLink Q910548.
- Q2524990 comment "In queueing theory, a discipline within the mathematical theory of probability, a Jackson network (sometimes Jacksonian network) is a class of queueing network where the equilibrium distribution is particularly simple to compute as the network has a product-form solution.".
- Q2524990 label "Jackson network".