Very weak, P-weak majorization and their application

In a number of queuing systems with blocking and/or multiple classes of arriving customers, the classical majorization orderings become too strong to apply. In order to establish queue length inequalities that give rise to stochastic orderings on critical performance metrics for these systems, two new forms of majorization are introduced and studied. These are very weak majorization and p-weak majorization