Editing Queueing theory (section)

=== Routing algorithms ===
{{See also|Stochastic scheduling}}
In discrete-time networks where there is a constraint on which service nodes can be active at any time, the max-weight scheduling algorithm chooses a service policy to give optimal throughput in the case that each job visits only a single-person service node.<ref name="Manuel" /> In the more general case where jobs can visit more than one node, [[backpressure routing]] gives optimal throughput. A [[network scheduler]] must choose a [[queueing algorithm]], which affects the characteristics of the larger network.<ref>{{Cite journal |last=Newell |first=G. F. |date=1982 |title=Applications of Queueing Theory |url=https://doi.org/10.1007/978-94-009-5970-5 |journal=SpringerLink |language=en |doi=10.1007/978-94-009-5970-5|isbn=978-94-009-5972-9 }}</ref>