Login / Signup
Optimal approximations for traffic distribution in bounded switch memories.
Yaniv Sadeh
Ori Rottenstreich
Haim Kaplan
Published in:
CoNEXT (2020)
Keyphrases
</>
closed form
content addressable
real time
data sets
high speed
network traffic
dynamic programming
traffic flow
optimal solution
upper bound
random variables
asymptotically optimal