Faster access than browser!
76 relations: Agner Krarup Erlang, Aleksandr Khinchin, Andrey Markov, Backpressure routing, Balance equation, BCMP network, Buzen's algorithm, Cass Business School, Computing, David George Kendall, Diffusion process, Ehrenfest model, Empirical measure, Erlang (unit), Erol Gelenbe, Exponential distribution, Felix Pollaczek, FIFO (computing and electronics), Flow network, G-network, G/G/1 queue, Gordon–Newell theorem, Industrial engineering, Integral equation, Jackson network, John Kingman, Journal of the ACM, Kelly network, Kendall's notation, Kingman's formula, M/D/1 queue, M/D/c queue, M/G/1 queue, M/G/k queue, M/M/1 queue, Management Science (journal), Markov chain, Mathematical Proceedings of the Cambridge Philosophical Society, Matrix analytic method, Matrix geometric method, Mean field theory, Mean sojourn time, Mean value analysis, Network scheduler, Network simulation, Normalizing constant, Operations research, Operations Research (journal), Ornstein–Uhlenbeck process, Orthant, ..., Phase-type distribution, Poisson distribution, Poisson point process, Pollaczek–Khinchine formula, Probability distribution, Processor sharing, Product-form solution, Project production management, Queue area, Queue management system, Queueing Systems, Queuing delay, Queuing Rule of Thumb, Random early detection, Reflected Brownian motion, Renewal theory, Scheduling (computing), Shortest job next, Shortest remaining time, Stack (abstract data type), Stochastic scheduling, Telecommunication, Throughput, Traffic congestion, Traffic engineering (transportation), Traffic generation model. Expand index (26 more) »
Agner Krarup Erlang
Agner Krarup Erlang (1 January 1878 – 3 February 1929) was a Danish mathematician, statistician and engineer, who invented the fields of traffic engineering and queueing theory.
New!!: Queueing theory and Agner Krarup Erlang · See more »
Aleksandr Khinchin
Aleksandr Yakovlevich Khinchin (Алекса́ндр Я́ковлевич Хи́нчин, Alexandre Khintchine; July 19, 1894 – November 18, 1959) was a Soviet mathematician and one of the most significant people in the Soviet school of probability theory.
New!!: Queueing theory and Aleksandr Khinchin · See more »
Andrey Markov
Andrey (Andrei) Andreyevich Markov (Андре́й Андре́евич Ма́рков, in older works also spelled Markoff) (14 June 1856 N.S. – 20 July 1922) was a Russian mathematician.
New!!: Queueing theory and Andrey Markov · See more »
Backpressure routing
In queueing theory, a discipline within the mathematical theory of probability, the backpressure routing algorithm is a method for directing traffic around a queueing network that achieves maximum network throughput, which is established using concepts of Lyapunov drift.
New!!: Queueing theory and Backpressure routing · See more »
Balance equation
In probability theory, a balance equation is an equation that describes the probability flux associated with a Markov chain in and out of states or set of states.
New!!: Queueing theory and Balance equation · See more »
BCMP network
In queueing theory, a discipline within the mathematical theory of probability, a BCMP network is a class of queueing network for which a product-form equilibrium distribution exists.
New!!: Queueing theory and BCMP network · See more »
Buzen's algorithm
In queueing theory, a discipline within the mathematical theory of probability, Buzen's algorithm (or convolution algorithm) is an algorithm for calculating the normalization constant G(N) in the Gordon–Newell theorem.
New!!: Queueing theory and Buzen's algorithm · See more »
Cass Business School
Cass Business School (short for the Sir John Cass Business School) was established in 1966, and is City, University of London's business school, located in the St Luke's area.
New!!: Queueing theory and Cass Business School · See more »
Computing
Computing is any goal-oriented activity requiring, benefiting from, or creating computers.
New!!: Queueing theory and Computing · See more »
David George Kendall
David George Kendall FRS (15 January 1918 – 23 October 2007) was an English statistician and mathematician, known for his work on probability, statistical shape analysis, ley lines and queueing theory.
New!!: Queueing theory and David George Kendall · See more »
Diffusion process
In probability theory and statistics, a diffusion process is a solution to a stochastic differential equation.
New!!: Queueing theory and Diffusion process · See more »
Ehrenfest model
The Ehrenfest model (or dog-flea model) of diffusion was proposed by Tatiana and Paul Ehrenfest to explain the second law of thermodynamics.
New!!: Queueing theory and Ehrenfest model · See more »
Empirical measure
In probability theory, an empirical measure is a random measure arising from a particular realization of a (usually finite) sequence of random variables.
New!!: Queueing theory and Empirical measure · See more »
Erlang (unit)
The erlang (symbol E) is a dimensionless unit that is used in telephony as a measure of offered load or carried load on service-providing elements such as telephone circuits or telephone switching equipment.
New!!: Queueing theory and Erlang (unit) · See more »
Erol Gelenbe
No description.
New!!: Queueing theory and Erol Gelenbe · See more »
Exponential distribution
No description.
New!!: Queueing theory and Exponential distribution · See more »
Felix Pollaczek
Félix Pollaczek (1 December 1892 in Vienna – 29 April 1981 at Boulogne-Billancourt) was an Austrian-French engineer and mathematician, known for numerous contributions to number theory, mathematical analysis, mathematical physics and probability theory.
New!!: Queueing theory and Felix Pollaczek · See more »
FIFO (computing and electronics)
FIFO is an acronym for first in, first out, a method for organizing and manipulating a data buffer, where the oldest (first) entry, or 'head' of the queue, is processed first.
New!!: Queueing theory and FIFO (computing and electronics) · See more »
Flow network
In graph theory, a flow network (also known as a transportation network) is a directed graph where each edge has a capacity and each edge receives a flow.
New!!: Queueing theory and Flow network · See more »
G-network
In queueing theory, a discipline within the mathematical theory of probability, a G-network (generalized queueing network or Gelenbe network) is an open network of G-queues first introduced by Erol Gelenbe as a model for queueing systems with specific control functions, such as traffic re-routing or traffic destruction, as well as a model for neural networks.
New!!: Queueing theory and G-network · See more »
G/G/1 queue
In queueing theory, a discipline within the mathematical theory of probability, the G/G/1 queue represents the queue length in a system with a single server where interarrival times have a general (meaning arbitrary) distribution and service times have a (different) general distribution.
New!!: Queueing theory and G/G/1 queue · See more »
Gordon–Newell theorem
In queueing theory, a discipline within the mathematical theory of probability, the Gordon–Newell theorem is an extension of Jackson's theorem from open queueing networks to closed queueing networks of exponential servers where customers cannot leave the network.
New!!: Queueing theory and Gordon–Newell theorem · See more »
Industrial engineering
Industrial engineering is a branch of engineering which deals with the optimization of complex processes, systems, or organizations.
New!!: Queueing theory and Industrial engineering · See more »
Integral equation
In mathematics, an integral equation is an equation in which an unknown function appears under an integral sign.
New!!: Queueing theory and Integral equation · See more »
Jackson network
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.
New!!: Queueing theory and Jackson network · See more »
John Kingman
Sir John Frank Charles Kingman (born 28 August 1939) is a British mathematician.
New!!: Queueing theory and John Kingman · See more »
Journal of the ACM
The Journal of the ACM is a peer-reviewed scientific journal covering computer science in general, especially theoretical aspects.
New!!: Queueing theory and Journal of the ACM · See more »
Kelly network
In queueing theory, a discipline within the mathematical theory of probability, a Kelly network is a general multiclass queueing network.
New!!: Queueing theory and Kelly network · See more »
Kendall's notation
In queueing theory, a discipline within the mathematical theory of probability, Kendall's notation (or sometimes Kendall notation) is the standard system used to describe and classify a queueing node.
New!!: Queueing theory and Kendall's notation · See more »
Kingman's formula
In queueing theory, a discipline within the mathematical theory of probability, Kingman's formula also known as the VUT equation, is an approximation for the mean waiting time in a G/G/1 queue.
New!!: Queueing theory and Kingman's formula · See more »
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 server, where arrivals are determined by a Poisson process and job service times are fixed (deterministic).
New!!: Queueing theory and M/D/1 queue · See more »
M/D/c queue
In queueing theory, a discipline within the mathematical theory of probability, an M/D/c queue represents the queue length in a system having c servers, where arrivals are determined by a Poisson process and job service times are fixed (deterministic).
New!!: Queueing theory and M/D/c queue · See more »
M/G/1 queue
In queueing theory, a discipline within the mathematical theory of probability, an M/G/1 queue is a queue model where arrivals are Markovian (modulated by a Poisson process), service times have a General distribution and there is a single server.
New!!: Queueing theory and M/G/1 queue · See more »
M/G/k queue
In queueing theory, a discipline within the mathematical theory of probability, an M/G/k queue is a queue model where arrivals are Markovian (modulated by a Poisson process), service times have a General distribution and there are k servers.
New!!: Queueing theory and M/G/k queue · See more »
M/M/1 queue
In queueing theory, a discipline within the mathematical theory of probability, an M/M/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 have an exponential distribution.
New!!: Queueing theory and M/M/1 queue · See more »
Management Science (journal)
Management Science is a peer-reviewed academic journal that covers research on all aspects of management related to strategy, entrepreneurship, innovation, information technology, and organizations as well as all functional areas of business, such as accounting, finance, marketing, and operations.
New!!: Queueing theory and Management Science (journal) · See more »
Markov chain
A Markov chain is "a stochastic model describing a sequence of possible events in which the probability of each event depends only on the state attained in the previous event".
New!!: Queueing theory and Markov chain · See more »
Mathematical Proceedings of the Cambridge Philosophical Society
Mathematical Proceedings of the Cambridge Philosophical Society is a mathematical journal published by Cambridge University Press for the Cambridge Philosophical Society.
New!!: Queueing theory and Mathematical Proceedings of the Cambridge Philosophical Society · See more »
Matrix analytic method
In probability theory, the matrix analytic method is a technique to compute the stationary probability distribution of a Markov chain which has a repeating structure (after some point) and a state space which grows unboundedly in no more than one dimension.
New!!: Queueing theory and Matrix analytic method · See more »
Matrix geometric method
In probability theory, the matrix geometric method is a method for the analysis of quasi-birth–death processes, continuous-time Markov chain whose transition rate matrices with a repetitive block structure.
New!!: Queueing theory and Matrix geometric method · See more »
Mean field theory
In physics and probability theory, mean field theory (MFT also known as self-consistent field theory) studies the behavior of large and complex stochastic models by studying a simpler model.
New!!: Queueing theory and Mean field theory · See more »
Mean sojourn time
The mean sojourn time (or sometimes mean waiting time) for an object in a system is the amount of time an object is expected to spend in a system before leaving the system for good.
New!!: Queueing theory and Mean sojourn time · See more »
Mean value analysis
In queueing theory, a discipline within the mathematical theory of probability, mean value analysis (MVA) is a recursive technique for computing expected queue lengths, waiting time at queueing nodes and throughput in equilibrium for a closed separable system of queues.
New!!: Queueing theory and Mean value analysis · See more »
Network scheduler
A network scheduler, also called packet scheduler, queueing discipline, qdisc or queueing algorithm, is an arbiter on a node in packet switching communication network.
New!!: Queueing theory and Network scheduler · See more »
Network simulation
In computer network research, network simulation is a technique whereby a software program models the behavior of a network by calculating the interaction between the different network entities (routers, switches, nodes, access points, links etc.). Most simulators use discrete event simulation - the modeling of systems in which state variables change at discrete points in time.
New!!: Queueing theory and Network simulation · See more »
Normalizing constant
The concept of a normalizing constant arises in probability theory and a variety of other areas of mathematics.
New!!: Queueing theory and Normalizing constant · See more »
Operations research
Operations research, or operational research in British usage, is a discipline that deals with the application of advanced analytical methods to help make better decisions.
New!!: Queueing theory and Operations research · See more »
Operations Research (journal)
Operations Research is a bimonthly peer-reviewed academic journal covering operations research that is published by INFORMS.
New!!: Queueing theory and Operations Research (journal) · See more »
Ornstein–Uhlenbeck process
In mathematics, the Ornstein–Uhlenbeck process (named after Leonard Ornstein and George Eugene Uhlenbeck), is a stochastic process that, roughly speaking, describes the velocity of a massive Brownian particle under the influence of friction.
New!!: Queueing theory and Ornstein–Uhlenbeck process · See more »
Orthant
In geometry, an orthant or hyperoctant is the analogue in n-dimensional Euclidean space of a quadrant in the plane or an octant in three dimensions.
New!!: Queueing theory and Orthant · See more »
Phase-type distribution
No description.
New!!: Queueing theory and Phase-type distribution · See more »
Poisson distribution
In probability theory and statistics, the Poisson distribution (in English often rendered), named after French mathematician Siméon Denis Poisson, is a discrete probability distribution that expresses the probability of a given number of events occurring in a fixed interval of time or space if these events occur with a known constant rate and independently of the time since the last event.
New!!: Queueing theory and Poisson distribution · See more »
Poisson point process
In probability, statistics and related fields, a Poisson point process or Poisson process (also called a Poisson random measure, Poisson random point field or Poisson point field) is a type of random mathematical object that consists of points randomly located on a mathematical space.
New!!: Queueing theory and Poisson point process · See more »
Pollaczek–Khinchine formula
In queueing theory, a discipline within the mathematical theory of probability, the Pollaczek–Khinchine formula states a relationship between the queue length and service time distribution Laplace transforms for an M/G/1 queue (where jobs arrive according to a Poisson process and have general service time distribution).
New!!: Queueing theory and Pollaczek–Khinchine formula · See more »
Probability distribution
In probability theory and statistics, a probability distribution is a mathematical function that provides the probabilities of occurrence of different possible outcomes in an experiment.
New!!: Queueing theory and Probability distribution · See more »
Processor sharing
Processor sharing or egalitarian processor sharing is a service policy where the customers, clients or jobs are all served simultaneously, each receiving an equal fraction of the service capacity available.
New!!: Queueing theory and Processor sharing · See more »
Product-form solution
In probability theory, a product-form solution is a particularly efficient form of solution for determining some metric of a system with distinct sub-components, where the metric for the collection of components can be written as a product of the metric across the different components.
New!!: Queueing theory and Product-form solution · See more »
Project production management
Project production management (PPM) is the application of operations managementA Guide to the Project Management Body of Knowledge, Fifth Edition, Project Management Institute Sec 1.5.1.1, p13 http://www.pmi.org/pmbok-guide-standards/foundational/pmbok to the delivery of capital projects.
New!!: Queueing theory and Project production management · See more »
Queue area
Queue areas are places in which people queue (first-come, first-served) for goods or services.
New!!: Queueing theory and Queue area · See more »
Queue management system
A queue management system is used to control queues.
New!!: Queueing theory and Queue management system · See more »
Queueing Systems
Queueing Systems is a peer-reviewed scientific journal covering queueing theory.
New!!: Queueing theory and Queueing Systems · See more »
Queuing delay
In telecommunication and computer engineering, the queuing delay or queueing delay is the time a job waits in a queue until it can be executed.
New!!: Queueing theory and Queuing delay · See more »
Queuing Rule of Thumb
The Queuing Rule of Thumb is a simple formula used to compute a rough approximation of the proper number of servers in a queue.
New!!: Queueing theory and Queuing Rule of Thumb · See more »
Random early detection
Random early detection (RED), also known as random early discard or random early drop is a queueing discipline for a network scheduler suited for congestion avoidance.
New!!: Queueing theory and Random early detection · See more »
Reflected Brownian motion
In probability theory, reflected Brownian motion (or regulated Brownian motion, both with the acronym RBM) is a Wiener process in a space with reflecting boundaries.
New!!: Queueing theory and Reflected Brownian motion · See more »
Renewal theory
Renewal theory is the branch of probability theory that generalizes Poisson processes for arbitrary holding times.
New!!: Queueing theory and Renewal theory · See more »
Scheduling (computing)
In computing, scheduling is the method by which work specified by some means is assigned to resources that complete the work.
New!!: Queueing theory and Scheduling (computing) · See more »
Shortest job next
Shortest job next (SJN), also known as shortest job first (SJF) or shortest process next (SPN), is a scheduling policy that selects for execution the waiting process with the smallest execution time.
New!!: Queueing theory and Shortest job next · See more »
Shortest remaining time
Shortest remaining time, also known as shortest remaining time first (SRTF), is a scheduling method that is a preemptive version of shortest job next scheduling.
New!!: Queueing theory and Shortest remaining time · See more »
Stack (abstract data type)
In computer science, a stack is an abstract data type that serves as a collection of elements, with two principal operations.
New!!: Queueing theory and Stack (abstract data type) · See more »
Stochastic scheduling
Stochastic scheduling concerns scheduling problems involving random attributes, such as random processing times, random due dates, random weights, and stochastic machine breakdowns.
New!!: Queueing theory and Stochastic scheduling · See more »
Telecommunication
Telecommunication is the transmission of signs, signals, messages, words, writings, images and sounds or information of any nature by wire, radio, optical or other electromagnetic systems.
New!!: Queueing theory and Telecommunication · See more »
Throughput
In general terms, throughput is the maximum rate of production or the maximum rate at which something can be processed.
New!!: Queueing theory and Throughput · See more »
Traffic congestion
Traffic congestion is a condition on transport networks that occurs as use increases, and is characterized by slower speeds, longer trip times, and increased vehicular queueing.
New!!: Queueing theory and Traffic congestion · See more »
Traffic engineering (transportation)
Traffic engineering is a branch of civil engineering that uses engineering techniques to achieve the safe and efficient movement of people and goods on roadways.
New!!: Queueing theory and Traffic engineering (transportation) · See more »
Traffic generation model
A traffic generation model is a stochastic model of the traffic flows or data sources in a communication network, for example a cellular network or a computer network.
New!!: Queueing theory and Traffic generation model · See more »
Redirects here:
Arrival rate, FCFS, First come first serve, First come first served, First come, first serve, First come, first served, First-come first-serve, First-come first-served, First-come, first-serve, First-come, first-served, First-come-first-served, QUEUEING THEORY, Queue (mathematics), Queue Theory, Queue theory, Queueing Theory, Queueing model, Queueing models, Queueing network, Queueing system, Queuing Theory, Queuing model, Queuing systems, Queuing theory, Stochastic network, Teletraffic Queuing Theory, Teletraffic queuing theory, Theory of queuing, Waiting line theory.
References
[1] https://en.wikipedia.org/wiki/Queueing_theory
