 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.In the more general case where jobs can visit more than one node, backpressure routing gives optimal throughput.A network scheduler must choose a queuing algorithm, which affects the characteristics of the larger network.