Admission Control in Shared Memory Switches

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

ver descrição completa

Detalhes bibliográficos
Autores: Eugster, Patrick, Kesselman, Alex, Kogan, Kirill, Nikolenko, Sergey, Sirotkin, Alexander V.
Formato: artículo
Fecha de publicación:2018
País:España
Recursos:IMDEA Networks Institute
Repositorio:IMDEA Networks Institute Digital Repository
Idioma:inglés
OAI Identifier:oai:dspace.networks.imdea.org:20.500.12761/526
Acesso em linha:http://hdl.handle.net/20.500.12761/526
Access Level:acceso abierto
Palavra-chave:Shared-memory switch
Admission control
Buffer management
Packet scheduling
Descrição
Resumo: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.