Seguir
Wenkai Dai
Título
Citado por
Citado por
Año
Load-optimization in reconfigurable networks: Algorithms and complexity of flow routing
W Dai, KT Foerster, D Fuchssteiner, S Schmid
ACM SIGMETRICS Performance Evaluation Review 48 (3), 39-44, 2021
92021
Improved scalability of demand-aware datacenter topologies with minimal route lengths and congestion
M Pacut, W Dai, A Labbe, KT Foerster, S Schmid
ACM SIGMETRICS Performance Evaluation Review 49 (3), 35-36, 2022
62022
Robust network flow against attackers with knowledge of routing method
V Suppakitpaisarn, W Dai, JF Baffier
2015 IEEE 16th International Conference on High Performance Switching and …, 2015
62015
Brief announcement: Minimizing congestion in hybrid demand-aware network topologies
W Dai, M Dinitz, KT Foerster, S Schmid
42022
Reoptimization of minimum latency problem
W Dai
International Computing and Combinatorics Conference, 162-174, 2017
32017
Load-optimization in Reconfigurable Data-center Networks: Algorithms and Complexity of Flow Routing
W Dai, KT Foerster, D Fuchssteiner, S Schmid
ACM Transactions on Modeling and Performance Evaluation of Computing Systems …, 2023
22023
A Tight Characterization of Fast Failover Routing: Resiliency to Two Link Failures is Possible
W Dai, KT Foerster, S Schmid
Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and …, 2023
12023
Reoptimization of minimum latency problem revisited: don’t panic when asked to revisit the route after local modifications
W Dai, Y Yang
Journal of Combinatorial Optimization 37, 601-619, 2019
12019
Approximation Algorithms for Minimizing Congestion in Demand-Aware Networks
W Dai, M Dinitz, KT Foerster, L Luo, S Schmid
arXiv preprint arXiv:2401.04638, 2024
2024
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–9