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

Zhen Guo; Roberto Rojas-Cessa

doi:10.1109/SARNOF.2006.4534804

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

Zhen Guo
, Roberto Rojas-Cessa

Electrical and Computer Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 language	English (US)
Title of host publication	2006 IEEE Sarnoff Symposium
DOIs	https://doi.org/10.1109/SARNOF.2006.4534804
State	Published - 2006
Event	2006 IEEE Sarnoff Symposium - Princeton, NJ, United States Duration: Mar 27 2006 → Mar 28 2006

Publication series

Name	2006 IEEE Sarnoff Symposium

Other

Other	2006 IEEE Sarnoff Symposium
Country/Territory	United States
City	Princeton, NJ
Period	3/27/06 → 3/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

Access to Document

10.1109/SARNOF.2006.4534804

Cite this

@inproceedings{60afe92e47014ead9b6f3e41f4fdcc67,

title = "A control theoretic analysis of arbitration and matching schemes for packet switches",

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.",

keywords = "Dwell time, Fluid model, Input-buffered, Packet switches, Stability",

author = "Zhen Guo and Roberto Rojas-Cessa",

year = "2006",

doi = "10.1109/SARNOF.2006.4534804",

language = "English (US)",

isbn = "1424400023",

series = "2006 IEEE Sarnoff Symposium",

booktitle = "2006 IEEE Sarnoff Symposium",

note = "2006 IEEE Sarnoff Symposium ; Conference date: 27-03-2006 Through 28-03-2006",

}

TY - GEN

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

AU - Guo, Zhen

AU - Rojas-Cessa, Roberto

PY - 2006

Y1 - 2006

N2 - 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.

AB - 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.

KW - Dwell time

KW - Fluid model

KW - Input-buffered

KW - Packet switches

KW - Stability

UR - https://www.scopus.com/pages/publications/50649090267

UR - https://www.scopus.com/pages/publications/50649090267#tab=citedBy

U2 - 10.1109/SARNOF.2006.4534804

DO - 10.1109/SARNOF.2006.4534804

M3 - Conference contribution

AN - SCOPUS:50649090267

SN - 1424400023

SN - 9781424400027

T3 - 2006 IEEE Sarnoff Symposium

BT - 2006 IEEE Sarnoff Symposium

T2 - 2006 IEEE Sarnoff Symposium

Y2 - 27 March 2006 through 28 March 2006

ER -

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

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Keywords

Access to Document

Other files and links

Fingerprint

Cite this