TL;DR
This paper introduces TrafPy, an open-source traffic generator for benchmarking data centre networks, enabling standardized testing and analysis of scheduling algorithms across various network types.
Contribution
The paper presents TrafPy, a versatile framework for generating realistic data centre traffic traces, facilitating benchmarking and analysis of network scheduling algorithms.
Findings
Sensitivity of scheduling algorithms to traffic characteristics analyzed
Different network types respond uniquely to scheduling policies
Insights enable application-informed design and adaptive scheduling
Abstract
Benchmarking is commonly used in research fields, such as computer architecture design and machine learning, as a powerful paradigm for rigorously assessing, comparing, and developing novel technologies. However, the data centre networking community lacks a standard open-access benchmark. This is curtailing the community's understanding of existing systems and hindering the ability with which novel technologies can be developed, compared, and tested. We present TrafPy; an open-access framework for generating both realistic and custom data centre network traffic traces. TrafPy is compatible with any simulation, emulation, or experimentation environment, and can be used for standardised benchmarking and for investigating the properties and limitations of network systems such as schedulers, switches, routers, and resource managers. To demonstrate the efficacy of TrafPy, we use it to…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
