Everything about Jackson network
Mathematical discipline
In queueing theory, a discipline within the mathematical theory of probability, a Jackson network is a class of queueing networks 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 reprinted in the journal Management Science's "Ten Most Influential Papers of Management Science's First Fifty Years". Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Jackson networkA 5-minute orientation
- Skim a recent paper: A Jackson-type estimate in terms of the \(\tau\)-modulus for neural network operators in \(L^{p}\)-spacesInfluential work since 2022
- Pick up a classic book: Cyberbullying at University in International ContextsThe most-reprinted book on the subject
- Read the landmark paper: Efficient simulation of a tandem Jackson networkCited 39 times
- Go sideways: Birth–death processA closely related topic
- Go sideways: M/M/c queueA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Efficient simulation of a tandem Jackson network
The non-ergodic Jackson network
Decentralized control of service rates in a closed Jackson network
Large deviations of a modified Jackson network: Stability and rough asymptotics
An operator-analytic approach to the Jackson network
Cost sharing of cooperating queues in a Jackson network
Supply chain networks: Closed Jackson network models and properties
A TWO-NODE JACKSON NETWORK WITH INFINITE SUPPLY OF WORK
🆕 Influential since 2022
A Jackson-type estimate in terms of the \(\tau\)-modulus for neural network operators in \(L^{p}\)-spaces
Stochastic optimization of level-dependent perishable inventory system by Jackson network
Sistem Antrian Pelanggan Menggunakan Metode Jackson Network Queue
Cluster-Based PBFT Blockchain Consensus Modelling with Jackson Open Queuing Network
The (Non)Notable Network: Tracing Black Women’s Poetry Networks in and Around Jackson, Mississippi
📚 Books worth reading
Cyberbullying at University in International ContextsWanda Cassidy, Chantal Faucher · 2018
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Birth–death process The birth–death process (or birth-and-death process) is a special case of continuous-time Markov process where the state transitions are of only two types:…
- M/M/c queue In queueing theory, a discipline within the mathematical theory of probability, the M/M/c queue (or Erlang–C model) is a multi-server queueing model. In…
- Kernel embedding of distributions In machine learning, the kernel embedding of distributions (also called the kernel mean or mean map) comprises a class of nonparametric methods in which…
- Noncentral chi distribution In probability theory and statistics, the noncentral chi distribution is a noncentral generalization of the chi distribution. It is also known as the generalize…
- Karush–Kuhn–Tucker conditions In mathematical optimization, the Karush–Kuhn–Tucker (KKT) conditions, also known as the Kuhn–Tucker conditions, are first derivative tests (sometimes…
- M/M/∞ queue In queueing theory, a discipline within the mathematical theory of probability, the M/M/∞ queue is a multi-server queueing model where every arrival experiences…
- Bayesian linear regression Bayesian linear regression is a type of conditional modeling in which the mean of one variable is described by a linear combination of other variables…
- M/D/1 queue 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…