James R. Jackson

From Wikipedia, the free encyclopedia

James R. Jackson was an American mathematician, becoming well known for his contribution to queueing theory.

While at University of California, Los Angeles he developed the Jackson's theorem and some of the first models that could predict the performance of networks with several nodes, thus becoming important for the analysis of the then emerging packet switched networks, such as those undertaken by Leonard Kleinrock in 1961.[1] The Jackson network is named after him.

[edit] Publications

  • Networks of waiting lines, in Operations Research journal, 4(4):518-521, 1957
  • Finite Queuing Tables, Mathematical Tables and Other Aids to Computation, 12(64):308-9, 1958
  • Jobshop-like queueing systems, in Management Science (journal), 10(1):131-142, 1963

[edit] References

  1. ^ Leonard Kleinrock, Creating a mathematical theory of computer networks in Operations Research journal, 50(1):125-131, 2002
This article about a mathematician is a stub. You can help Wikipedia by expanding it.