Optimal approximations for traffic distribution in bounded switch memories - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Yaniv Sadeh, Ori Rottenstreich, Haim Kaplan. Optimal approximations for traffic distribution in bounded switch memories. In Dongsu Han, Anja Feldmann, editors, CoNEXT '20: The 16th International Conference on emerging Networking EXperiments and Technologies, Barcelona, Spain, December, 2020. pages 309-322, ACM, 2020. [doi]

The following publications are possibly variants of this publication:

Optimal Representations of a Traffic Distribution in Switch MemoriesYaniv Sadeh, Ori Rottenstreich, Arye Barkan, Yossi Kanizo, Haim Kaplan. infocom 2019: 2035-2043 [doi]

Optimal Representations of a Traffic Distribution in Switch MemoriesYaniv Sadeh, Ori Rottenstreich, Arye Barkan, Yossi Kanizo, Haim Kaplan. ton, 28(2):930-943, 2020. [doi]

runs on WebDSL