Computing Publications

Publications Home » Worst-case Analysis of Router Net...

Worst-case Analysis of Router Networks with Rival Queueing Models

Nalan Gulpinar, Peter G. Harrison, Berc Rustem

Conference or Workshop Paper
21st International Symposium on Computer and Information Sciences (ISCIS 2006), Istanbul, Turkey
November, 2006
Lecture Notes in Computer Science
Volume 4263
pp.897–907
Springer-Verlag
DOI 10.1007/11902140_93
Abstract

A robust, worst-case design framework is developed for a tandem router network based on rival queueing models. Worst-case design is concerned with determining the best design or strategy in the most hostile operating environment, i.e. simultaneously with worst-case model parameters. In the router network, end-to-end performance is computed as the mean transmission delay subject to an upper limit on the rate of losses and finite capacity queueing and recovery buffers. The worst-case optimal ratio of arrival-buffer size to recovery-buffer size is determined, which is a critical quantity that affects both loss rate and transmission time. The impact of the retransmission probability is also investigated.

Keywords
AESOP
BibTEX file for the publication
 

pubs.doc.ic.ac.uk: built & maintained by Ashok Argent-Katwala.