Supervision of queues of requests in computer systems

A method is discussed for organizing queues in computer systems based on partiturning requests into priority groups. Requests are compared with respect to several indexes. For a case of continuous indexes, probabilistic characteristics of the number of Pareto set elements are determined enabling evaluation of applicability of the proposed servicing discipline.