Author:
Avin Chen,Mondal Kaushik,Schmid Stefan
Publisher
Springer International Publishing
Reference21 articles.
1. Avin, C., Ghobadi, M., Griner, C., Schmid, S.: On the complexity of traffic traces and implications. In: Proceedings of the International Conference on Measurement and Modeling of Computer Systems, ACM SIGMETRICS, pp. 47–48 (2020)
2. Avin, C., Mondal, K., Schmid, S.: Demand-aware network designs of bounded degree. Distrib. Comput., 311–325 (2019). https://doi.org/10.1007/s00446-019-00351-5
3. Avin, C., Mondal, K., Schmid, S.: Demand-aware network design with minimal congestion and route lengths. In: Proceedings of the 38th IEEE International Conference on Computer Communications, IEEE INFOCOM, pp. 1351–1359 (2019)
4. Avin, C., Mondal, K., Schmid, S.: Push-down trees: optimal self-adjusting complete trees. In: Technical Report arXiv 1807.04613 (2020)
5. Avin, C., Schmid, S.: Toward demand-aware networking: a theory for self-adjusting networks. ACM SIGCOMM Comput. Commun. Rev. 48(5), 31–40 (2019)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Deterministic Self-Adjusting Tree Networks Using Rotor Walks;2022 IEEE 42nd International Conference on Distributed Computing Systems (ICDCS);2022-07
2. Lazy Self-Adjusting Bounded-Degree Networks for the Matching Model;IEEE INFOCOM 2022 - IEEE Conference on Computer Communications;2022-05-02