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

DOI10.1007/BF00265770zbMath0349.68026OpenAlexW2584565910MaRDI QIDQ1235012

Guy Pujolle, Jacques Labetoulle

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

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

Related Items (2)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Path delays in communication networks
• The behaviour of a single queue in a general queueing network
• A Proof for the Queuing Formula: L = λW
• On Approximate Computer System Models
• 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
• Reduction Methods for Tandem Queuing Systems
• A Sequence of Service Stations with Arbitrary Input and Regular Service Times

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