Queues, random graphs and branching processes

DOI10.1155/S1048953388000164MaRDI QIDQ3802369zbMATH OpenOpenAlexFDO

Authors Lajos Takács

Publication date 1988

Published in Journal of Applied Mathematics and Simulation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1155/s1048953388000164

zbMATH Keywords

branching processesrandom graphsingle server queueing system

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Recommendations

• scientific article; zbMATH DE number 4098463
• scientific article; zbMATH DE number 879776
• scientific article; zbMATH DE number 822066
• scientific article; zbMATH DE number 4213188
• Branching process and their application

Cited in

(7)

• Mathematical problems in the theory of processor-sharing queueing systems
• Queueing for an infinite bus line and aging branching process
• Branching processes. II
• Branching Processes, the Max-Plus Algebra and Network Calculus
• scientific article; zbMATH DE number 4098463 (Why is no real title available?)
• scientific article; zbMATH DE number 879776 (Why is no real title available?)
• Big jobs arrive early: from critical queues to random graphs

This page was built for publication: Queues, random graphs and branching processes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3802369)