Admission control in shared memory switches

Patrick Eugster, Alex Kesselman, Kirill Kogan, Sergey Nikolenko, Alexander Sirotkin

Research output: Contribution to journalArticlepeer-review

1 Scopus citations


Cloud applications bring new challenges to the design of network elements, in particular the burstiness of traffic workloads. A shared memory switch is a good candidate architecture to exploit buffer capacity; in this work, we analyze the performance of this architecture. Our goal is to explore the impact of additional traffic characteristics such as varying processing requirements and packet values on objective functions. The outcome of this work is a better understanding of the relevant parameters for buffer management to achieve better performance in dynamic environments of data centers. We consider a model that captures more of the properties of the target architecture than previous work and consider several scheduling and buffer management algorithms that are specifically designed to optimize its performance. In particular, we provide analytic guarantees for the throughput performance of our algorithms that are independent from specific distributions of packet arrivals. We furthermore report on a comprehensive simulation study which validates our analytic results.

Original languageEnglish
Pages (from-to)533-543
Number of pages11
JournalJournal of Scheduling
Issue number5
StatePublished - 1 Oct 2018
Externally publishedYes


  • Admission control
  • Buffer management
  • Packet scheduling


Dive into the research topics of 'Admission control in shared memory switches'. Together they form a unique fingerprint.

Cite this