A note on models for non-probabilistic analysis of packet switching networks.
type: Item
instance of: scholarly article
title: A note on models for non-probabilistic analysis of packet switching networks.
zbMATH Open document ID: 1042.68020
DOI: 10.1016/S0020-0190(02)00312-5
published in: Information Processing Letters
publication date: 2003-01-21T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 68M10
zbMATH DE Number: 1856482
zbMATH Keywords: Scheduling
zbMATH Keywords: Packet switching network
author: Adi Rosén
MaRDI profile type: Publication
cites work: Adaptive packet routing for bursty adversarial traffic
cites work: Universal-stability results and performance bounds for greedy contention-resolution protocols
cites work: Q4952651
cites work: Adversarial queuing theory
cites work: Stability of adaptive and non-adaptive packet routing policies in adversarial queueing networks
description: scientific article; zbMATH DE number 1856482