Worst-Case analysis of router networks with rival queueing models

  • Authors:
  • Nalan Gülpınar;Pete Harrison;Berç Rustem

  • Affiliations:
  • Warwick Business School, University of Warwick, Coventry, UK;Department of Computing, Imperial College London, London, UK;Department of Computing, Imperial College London, London, UK

  • Venue:
  • ISCIS'06 Proceedings of the 21st international conference on Computer and Information Sciences
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

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.