Local edge minimality of SRPT networks with shared resources

Abstract

We consider a general network with arbitrary topology and node capacities, in which users require simultaneous service from a number of shared resources. We study pathwise minimality of the shortest remaining processing time protocol with respect to suitable criteria based on the system’s cumulative transmission times of flows with residual service requirements not greater than any threshold value on the network routes. No distributional assumptions are made on the underlying stochastic primitives.