Queueing Systems, Volume 1: Theory
E699938
Queueing Systems, Volume 1: Theory is a foundational textbook by Leonard Kleinrock that rigorously develops the mathematical theory of queueing processes and their applications in communication and computer systems.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Queueing Systems, Volume 1: Theory canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T7849665 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Queueing Systems, Volume 1: Theory Context triple: [Communication Nets: Stochastic Message Flow and Delay, relatedWork, Queueing Systems, Volume 1: Theory]
-
A.
Khinchin–Pollaczek formula
The Khinchin–Pollaczek formula is a result in probability theory and queueing theory that provides an explicit expression for the stationary waiting-time distribution in certain single-server queues.
-
B.
Modern Probability Theory and Its Applications
"Modern Probability Theory and Its Applications" is a foundational textbook by Emanuel Parzen that systematically develops modern probability theory and demonstrates its use in a wide range of statistical and applied contexts.
-
C.
Lusser's law of series system reliability
Lusser's law of series system reliability is a principle in reliability engineering stating that the overall reliability of a series system equals the product of the reliabilities of its individual components, causing system reliability to decrease as more components are added.
-
D.
Communication Nets: Stochastic Message Flow and Delay
"Communication Nets: Stochastic Message Flow and Delay" is a foundational book in queueing theory and computer networking that rigorously analyzes message traffic and delays in communication networks.
-
E.
Introduction to Stochastic Control Theory
Introduction to Stochastic Control Theory is a foundational textbook that systematically develops the theory and methods for controlling dynamical systems under uncertainty using probabilistic and stochastic-process tools.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Queueing Systems, Volume 1: Theory Target entity description: Queueing Systems, Volume 1: Theory is a foundational textbook by Leonard Kleinrock that rigorously develops the mathematical theory of queueing processes and their applications in communication and computer systems.
-
A.
Khinchin–Pollaczek formula
The Khinchin–Pollaczek formula is a result in probability theory and queueing theory that provides an explicit expression for the stationary waiting-time distribution in certain single-server queues.
-
B.
Modern Probability Theory and Its Applications
"Modern Probability Theory and Its Applications" is a foundational textbook by Emanuel Parzen that systematically develops modern probability theory and demonstrates its use in a wide range of statistical and applied contexts.
-
C.
Lusser's law of series system reliability
Lusser's law of series system reliability is a principle in reliability engineering stating that the overall reliability of a series system equals the product of the reliabilities of its individual components, causing system reliability to decrease as more components are added.
-
D.
Communication Nets: Stochastic Message Flow and Delay
"Communication Nets: Stochastic Message Flow and Delay" is a foundational book in queueing theory and computer networking that rigorously analyzes message traffic and delays in communication networks.
-
E.
Introduction to Stochastic Control Theory
Introduction to Stochastic Control Theory is a foundational textbook that systematically develops the theory and methods for controlling dynamical systems under uncertainty using probabilistic and stochastic-process tools.
- F. None of above. chosen
Statements (48)
| Predicate | Object |
|---|---|
| instanceOf |
book
ⓘ
textbook ⓘ |
| applicationArea |
communication systems
ⓘ
computer systems ⓘ packet-switched networks ⓘ resource allocation in computer systems ⓘ telecommunication networks ⓘ |
| author | Leonard Kleinrock NERFINISHED ⓘ |
| describedAs | foundational textbook in queueing theory ⓘ |
| field |
applied probability
ⓘ
communication networks ⓘ computer systems performance analysis ⓘ operations research ⓘ queueing theory ⓘ |
| focus | rigorous mathematical development of queueing theory ⓘ |
| hasVolume | Queueing Systems, Volume 2: Computer Applications NERFINISHED ⓘ |
| intendedAudience |
engineers working on computer and communication systems
ⓘ
graduate students ⓘ researchers in communication networks ⓘ |
| language | English ⓘ |
| partOfSeries | Queueing Systems NERFINISHED ⓘ |
| topic |
G/M/1 queue
ⓘ
Little's law NERFINISHED ⓘ M/G/1 queue NERFINISHED ⓘ M/M/1 queue NERFINISHED ⓘ M/M/m queue ⓘ Markov chains ⓘ Poisson processes ⓘ birth-death processes ⓘ birth-death processes in communication systems ⓘ birth-death queueing models ⓘ blocking in queues ⓘ conservation laws in queueing ⓘ embedded Markov chains in queues ⓘ loss systems ⓘ multi-server queues ⓘ priority queues ⓘ queue length distributions ⓘ queueing networks ⓘ queueing processes ⓘ renewal theory in queues ⓘ reversibility in queueing systems ⓘ single-server queues ⓘ steady-state analysis ⓘ stochastic processes ⓘ traffic intensity ⓘ transient behavior of queues ⓘ waiting time distributions ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: Queueing Systems, Volume 1: Theory Description of subject: Queueing Systems, Volume 1: Theory is a foundational textbook by Leonard Kleinrock that rigorously develops the mathematical theory of queueing processes and their applications in communication and computer systems.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.
Communication Nets: Stochastic Message Flow and Delay
→
relatedWork
→
Queueing Systems, Volume 1: Theory
ⓘ