Stability degree of switches with finite buffers and non-negligible round-trip time

Abstract

We answer the question on how much memory a packet switch/router needs; more specifically, we propose a systematic method that is simple, rigorous and general for determining the absolute lower bound of packet buffering required by practical switching systems. Accordingly, we introduce a deterministic traffic scenario that stresses the global stability… (More)
DOI: 10.1016/S0141-9331(03)00025-5

Topics

4 Figures and Tables

Slides referencing similar topics