A general multi-resource network with users requiring service from a number of shared resources simultaneously is considered. It is demonstrated that the Shortest Remaining Processing Time (SRPT) service protocol minimizes, in a suitable sense, the system resource idleness with respect to customers with residual service times not greater than any threshold value on every network route. Our arguments are pathwise, with no assumptions on the model stochastic primitives and the network topology.
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.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.