Jackson's theorem (queueing theory): Difference between revisions

Revision as of 14:39, 30 December 2009

Revision as of 03:54, 3 August 2010

Line 1:

{{Otheruses4|James Jackson's theorem in queueing theory|Dunham Jackson's inequality in analysis|Jackson's inequality}}

In [[queueing theory]], a discipline within the mathematical [[probability theory|theory of probability]] '''Jackson's theorem''' is a theorem by [[James R. Jackson]].<ref>''Jobshop-like Queueing Systems'' [[James R. Jackson]] in Management Science, Vol. 10, No. 1 (Oct., 1963), pp. 131-142</ref> It was the first significant development in the theory of [[queueing theory|networks of queues]], and generalising and applying the ideas of the theorem to search for similar [[product form solution]]s in other networks has been the subject of much research,<ref>''Networks of Queues'' [[F. P. Kelly]] in Advances in Applied Probability, Vol. 8, No. 2 (Jun., 1976), pp. 416-432</ref> including ideas used in the development of the Internet.<ref>''Comments on "Jobshop-Like Queueing Systems": The Background'' [[James R. Jackson]] in Management Science, Vol. 50, No. 12, Ten Most Influential Titles of Management Sciences First Fifty Years (Dec., 2004), p. 1803</ref> The paper was printed in the journal [[Management Science]]’s ‘Ten Most Influential Titles of Management Sciences First Fifty Years.’<ref>''Jobshop-like Queueing Systems'' [[James R. Jackson]] in Management Science, Vol. 50, No. 12, Ten Most Influential Titles of Management Sciences First Fifty Years</ref>