Queueing theory

Use the mouse wheel or two fingers (on touchscreens) to zoom in and out of the map.

Export map as:

Research this topic

Explore the main themes, entities and connections around Queueing theory. Start with the topic map, then use the sections below for research and deeper semantic analysis.

Explore this topic

Start with a few of the strongest sections from the source topic. These are research directions, not a list of keywords you must use.

History

M/D/1 queue M/D/k queueing Felix Pollaczek Aleksandr Khinchin Pollaczek–Khinchine formula

22 related topics

Queueing networks

Jackson networks Product-form stationary distribution Mean value analysis Gordon–Newell theorem BCMP network

19 related topics

Single queueing nodes

Black box Birth–death process Average M/M/1 queue Poisson process

12 related topics

Service disciplines

First in, first out Last in, first out Stack Processor sharing Shortest job first

6 related topics

Topics to explore

Browse the full topic structure. Each item opens a new analysis centered on that subject.

Overview

Waiting lines Queue area
Operations research
Agner Krarup Erlang
Teletraffic engineering
Telecommunications
Traffic engineering Traffic engineering (transportation)
Computing
Project management
Industrial engineering
Steady state
Balance equations Balance equation

Description

Management science

Single queueing nodes

History

M/D/1 queue
M/D/k queueing M/D/k queue
Felix Pollaczek
Aleksandr Khinchin
Pollaczek–Khinchine formula
David George Kendall
Kendall's notation
Integral equation
John Kingman
Mean waiting time Mean sojourn time
G/G/1 queue
Kingman's formula
Leonard Kleinrock
Message switching
Packet switching
Massachusetts Institute of Technology
ARPANET
Matrix geometric method
Matrix analytic methods Matrix analytic method
Phase-type distributed Phase-type distribution
Product development
M/G/k queue

Service disciplines

First in, first out FIFO (computing and electronics)
Last in, first out LIFO (computing)
Stack Stack (data structure)
Processor sharing
Shortest job first
Shortest remaining processing time

Queueing networks

Advanced semantic analysis

Deeper signals for content research, entity SEO and topical coverage. The plain-language headings explain what each technical view is useful for.

Map overview Semantic statistics

Nodes78

Edges77

Triples107

Avg. degree1.97

Density0.025641

Components1

How this topic connects Entity context

See the strongest relationship patterns around the current topic before diving into the raw triples.

Queueing theory

Top relations

related to Further reading · 70

Queueing theory → Addison-Wesley, Algorithm Design, An, Analysis, Applications, April, Cambridge, Carl, Chapman, Communication Nets, Computer Applications, Computer System Analysis Using, Computer Systems, Deitel, Delay, Donald, Edition, Edward, Erol, Fundamentals

related to history · 10

Queueing theory → Agner Krarup Erlang, Copenhagen Telephone Exchange, Danish, He, In, In Kendall's, M/D/1, M/D/k, Markov, Poisson

has application · 9

Queueing theory → At, Beyond, By, In, Queueing, The, This, What, Whether

related to Description · 5

Queueing theory → Computing, Queueing, The, These, Through

related to External links · 3

Queueing theory → Queueing Theory CourseMyron Hlynka's, Queueing Theory PageLINE, Teknomo's Queueing

is a · 1

Queueing theory → mathematical study of waiting lines

Important terminology Word statistics

Use these terms to understand the vocabulary surrounding the topic, not as a checklist for keyword stuffing.

Important terminology

queueing queue theory time system service waiting process queues number systems displaystyle networks customers node models isbn customer arrival network

Entity relationships Subject–Predicate–Object triples

Subject	Predicate	Object	Confidence	Src
Queueing theory	is a	mathematical study of waiting lines	0.90	text
performance metrics for the M/G/k queue remain an open problem	instance of	in the sense that products have a certain volume and a certain duration.Problems	0.80	text
throughput	instance of	which allows average metrics	0.80	text
sojourn times	instance of	which allows average metrics	0.80	text
traffic systems	instance of	The study of queues is essential in contexts	0.80	text
computer networks	instance of	The study of queues is essential in contexts	0.80	text
telecommunications	instance of	The study of queues is essential in contexts	0.80	text
and service operations.Queueing theory delves into various foundational concepts	instance of	The study of queues is essential in contexts	0.80	text
with the arrival process	instance of	The study of queues is essential in contexts	0.80	text
service process being central	instance of	The study of queues is essential in contexts	0.80	text
Queueing theory	has application	Queueing	0.60	section
Queueing theory	has application	In	0.60	section

Related concept clusters Concept neighborhoods

These clusters group vocabulary that occurs around closely connected concepts in the source material.

Connections between topic areas Semantic bridges

Bridges can reveal useful research angles that are easy to miss in a flat list of related terms.

Min side: 3

Research this topic

Explore this topic

History

Queueing networks

Single queueing nodes

Service disciplines

Key facts & relationships

Topics to explore

Overview

Description

Single queueing nodes

History

Service disciplines

Queueing networks

Advanced semantic analysis

Map overview Semantic statistics

Queueing theory

How this topic connects Entity context

Queueing theory

Top relations

Important terminology Word statistics

Important terminology

Entity relationships Subject–Predicate–Object triples

Related concept clusters Concept neighborhoods

Connections between topic areas Semantic bridges