A control theoretic analysis of arbitration and matching schemes for packet switches
Document Type
Conference Proceeding
Publication Date
12-1-2006
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.
Identifier
50649090267 (Scopus)
ISBN
[1424400023, 9781424400027]
Publication Title
2006 IEEE Sarnoff Symposium
External Full Text Location
https://doi.org/10.1109/SARNOF.2006.4534804
Recommended Citation
Guo, Zhen and Rojas-Cessa, Roberto, "A control theoretic analysis of arbitration and matching schemes for packet switches" (2006). Faculty Publications. 18622.
https://digitalcommons.njit.edu/fac_pubs/18622
