| 研究実績の概要 |
We introduced a new framework for running message passing algorithms on programmable switches to enable fast reactions
to network events in large networks, specifically P4 switches. We use our framework to improve over the state of the art for two fundamental networking problems: multicast and clock synchronization.
We also a introduced the μ-CONGEST model where on top of the bandwidth restriction, the memory of nodes is also limited to μ words, in
line with real-world systems. We provide fast algorithms and lower bounds in this new model, specifically for subgraph detection and streaming algorithm. Finally, we present new results for the well studied mini-batch k-means algorithm. This algorithm can be used in the field of networking for vector quantization and clustering of network traffic.
|
