A control theoretic analysis of arbitration and matching schemes for packet switches

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Stability of a switch or router is one of the features of most interest. A stable input buffered switch means that occupancies in any of the input queues converges to a value different from infinity for admissible ingress traffic. Techniques to study stability in a switch are limited and sometimes unsuitable for elaborated schemes. Lyapunov functions have been used to analyze stability in maximum weight matching (MWM) schemes and may be hard to apply in other schemes. Here, we propose an alternative technique and it may be applied to a wide range of selection schemes, and furthermore, to different switch architectures. As an application of this technique, this paper discusses the impact of the granularity of the service time in the stability of an input-queued switch.

Original languageEnglish (US)
Title of host publication2006 IEEE Sarnoff Symposium
DOIs
StatePublished - Dec 1 2006
Event2006 IEEE Sarnoff Symposium - Princeton, NJ, United States
Duration: Mar 27 2006Mar 28 2006

Publication series

Name2006 IEEE Sarnoff Symposium

Other

Other2006 IEEE Sarnoff Symposium
CountryUnited States
CityPrinceton, NJ
Period3/27/063/28/06

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Electrical and Electronic Engineering
  • Communication

Keywords

  • Dwell time
  • Fluid model
  • Input-buffered
  • Packet switches
  • Stability

Fingerprint Dive into the research topics of 'A control theoretic analysis of arbitration and matching schemes for packet switches'. Together they form a unique fingerprint.

Cite this