Recensione dell'articolo:(Bramson, Maury; D'Auria, Bernardo; Walton, Neil - " Proportional switching in first-in, first-out networks. " - Oper. Res. 65 (2017), no. 2, 496–513)

In this paper, the authors consider a family of discrete-time multi-hop switched queueing networks where each packet moves along a fixed route. Queues in the network model are multiclass, so two different packet classes can correspond to different routes for packets passing through a queue. Packets within a queue are served according to a first-in-first-out (FIFO) queueing discipline, and once served, a packet goes to the next queue on its route. Packets in the network are all of unit size. In this context, the authors define a switching policy that they call ProportionalScheduler. This policy serves packets in the network queues according to a vector of expected rates that solves a specific proportional fair optimization problem. The authors show that the ProportionalScheduler switching policy is maximally stable.