A note on models for non-probabilistic analysis of packet switching networks

Abstract

We consider two models commonly used in the literature to model adversarial injection of packets into a packet switching network. We establish the relation between these two types of models, and between them and the set of sequences of packets that allow stability. We also consider the adaptive setting in which packets are injected with only their source and destination but without a prescribed path to follow. © 2002 Elsevier Science B.V. All rights reserved.