A study of queueing networks with deterministic service and application to computer networks

DOI10.1007/BF00265770MaRDI QIDQ1235012zbMATH OpenOpenAlexFDO

Authors Jacques Labetoulle, Guy Pujolle

Publication date 1976

Published in Acta Informatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf00265770

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Formal languages and automata (68Q45) Deterministic scheduling theory in operations research (90B35)

Cites work

• A Proof for the Queuing Formula: L = λW
• A Sequence of Service Stations with Arbitrary Input and Regular Service Times
• Accuracy of the Diffusion Approximation for Some Queuing Systems
• Application of the Diffusion Approximation to Queueing Networks I: Equilibrium Queue Distributions
• Approximate Models for Processor Utilization in Multiprogrammed Computer Systems
• scientific article; zbMATH DE number 3431955 (Why is no real title available?)
• scientific article; zbMATH DE number 3212585 (Why is no real title available?)
• scientific article; zbMATH DE number 3292535 (Why is no real title available?)
• On Approximate Computer System Models
• Path delays in communication networks
• Reduction Methods for Tandem Queuing Systems
• The behaviour of a single queue in a general queueing network

Cited in

(2)

• Load adaptive dynamic scheduling of tasks with hard deadlines useful for industrial applications
• Multi-objective routing within large scale facilities using open finite queueing networks

This page was built for publication: A study of queueing networks with deterministic service and application to computer networks

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