Abstract
AbstractWe 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.
Publisher
Springer Science and Business Media LLC
Subject
Management Science and Operations Research,General Mathematics,Software
Reference27 articles.
1. Aalto S, Ayesta U (2009) SRPT applied to bandwidth sharing networks. Ann Oper Res 170:3–19
2. Atar R, Biswas A, Kaspi H, Ramanan K (2018) A Skorokhod map on measure-valued paths with applications to priority queues. Ann Appl Probab 28:418–481
3. Bender M, Chakrabarti S, Muthukrishnan S (1998) Flow and stretch metrics for scheduling continuous job streams. In: Proceedings of the 9th annual ACM-SIAM symposium on discrete algorithms
4. Bertsekas D, Gallager R (1992) Data networks, 2nd edn. Prentice-Hall, New York
5. Bonald T, Proutière A (2003) Insensitive bandwidth sharing in data networks. Queueing Syst Theory Appl 44:69–100