Universal stability results for low rate adversaries in packet switched networks

In this work, we consider a generalized version of the adversarial model and study the universal stability (stability in any network) of scheduling policies under low load rates. We show that any work-conserving policy is universally stable at any load rate r<(1/d), where d is the largest number of links crossed by any packet. We also show that system-wide time priority policies are universally stable at any load rate r<(1/(d-1)).