cid 097476cb32a3a7424e43382d04dab7fbc2027678c0b61d96dc7347af7a61f026 · original · open access · via wikipedia
Title: Backpressure routing Authors: Venue: Wikipedia Year: unknown Canonical: wiki:backpressure-routing URL: https://en.wikipedia.org/wiki/Backpressure_routing Collector: wikipedia OA: true ABSTRACT In queueing theory, a discipline within the mathematical theory of probability, the backpressure routing algorithm is a method for directing traffic around a queueing network that achieves maximum network throughput, which is established using concepts of Lyapunov drift. Backpressure routing considers the situation where each job can visit multiple service nodes in the network. It is an extension of max-weight scheduling where each job visits only a single service node.