24 citations · 60 across the 27 of their papers we have counts for
Showing 2020Show all
3 papers · 1 filter
cs.DS2020
Arithmetic Binary Search Trees: Static Optimality in the Matching Model
Chen Avin
Motivated by recent developments in optical switching and reconfigurable network design, we study dynamic binary search trees (BSTs) in the matching model. In the classical dynamic…
cs.NI2020
Performance Analysis of Demand-Oblivious and Demand-Aware Optical Datacenter Network Designs
Chen Griner, Johannes Zerwas, Andreas Blenk +3
This paper presents a performance analysis of the design space of optical datacenter networks, including both demand-oblivious (static or dynamic) and demand-aware networks. We for…
cs.NI2020★ 6 cited
An Online Matching Model for Self-Adjusting ToR-to-ToR Networks
Chen Avin, Chen Griner, Iosif Salem +1
This is a short note that formally presents the matching model for the theoretical study of self-adjusting networks as initially proposed in [1].