default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVamsi Addanki
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2026
[j2]Zhaochen Zhang
, Kexin Liu, Peirui Cao, Chang Liu, Yizhi Wang, Vamsi Addanki, Stefan Schmid, Qingyue Wang, Wei Chen, Xiaoliang Wang, Jiaqi Zheng, Wenhao Sun, Tao Wu, Ke Meng, Fei Chen, Weiguang Wang, Bingyang Liu, Wanchun Dou, Guihai Chen, Chen Tian, Hao Yin, Fu Xiao:
Analysis of Pyrrha: Congestion-Root-Based Flow Control Is Most Cost-Effective to Eliminate Head-of-Line Blocking. IEEE Trans. Netw. 34: 1958-1973 (2026)- [c17]Vamsi Addanki, Julien Dallot, Leon Kellerhals, Maciej Pacut, Stefan Schmid:
The Harmonic Policy for Online Buffer Sharing is (2 + ln n)-Competitive: A Simple Proof. SOSA 2026: 472-475 - [i16]Mahir Rahman, Samuel Joseph, Nihar Kodkani, Behnaz Arzani, Vamsi Addanki:
Harvest: Adaptive Photonic Switching Schedules for Collective Communication in Scale-up Domains. CoRR abs/2602.09188 (2026) - [i15]Anchengcheng Zhou, Vamsi Addanki, Maria Apostolaki:
To Reconfigure or Not to Reconfigure: Optimizing All-to-All Collectives in Circuit-Switched Photonic Interconnects. CoRR abs/2602.10468 (2026) - [i14]Anton Juerss, Vamsi Addanki, Stefan Schmid:
Trivance: Latency-Optimal AllReduce by Shortcutting Multiport Networks. CoRR abs/2602.17254 (2026) - 2025
- [b1]Vamsi Addanki:
Adaptive protocols and reconfigurable optical interconnects for datacenter networks. Technical University of Berlin, Germany, 2025 - [c16]Vamsi Addanki:
When Light Bends to the Collective Will: A Theory and Vision for Adaptive Photonic Scale-up Domains. HotNets 2025: 326-334 - [c15]Kexin Liu, Zhaochen Zhang, Chang Liu, Yizhi Wang, Vamsi Addanki, Stefan Schmid, Qingyue Wang, Wei Chen, Xiaoliang Wang, Jiaqi Zheng, Wenhao Sun, Tao Wu, Ke Meng, Fei Chen, Weiguang Wang, Bingyang Liu, Wanchun Dou, Guihai Chen, Chen Tian:
Pyrrha: Congestion-Root-Based Flow Control to Eliminate Head-of-Line Blocking in Datacenter. NSDI 2025: 379-405 - [i13]Vamsi Addanki, Chen Avin, Goran Dario Knabe, Giannis Patronas, Dimitris Syrivelis, Nikos Terzenidis, Paraskevas Bakopoulos, Ilias Marinos, Stefan Schmid:
Vermilion: A Traffic-Aware Reconfigurable Optical Interconnect with Formal Throughput Guarantees. CoRR abs/2504.09892 (2025) - [i12]Sarah-Michelle Hammer, Stefan Schmid, Rachee Singh, Vamsi Addanki:
Short-circuiting Rings for Low-Latency AllReduce. CoRR abs/2510.03491 (2025) - [i11]Vamsi Addanki:
When Light Bends to the Collective Will: A Theory and Vision for Adaptive Photonic Scale-up Domains. CoRR abs/2510.08072 (2025) - [i10]Vamsi Addanki, Julien Dallot, Leon Kellerhals, Maciej Pacut, Stefan Schmid:
The Harmonic Policy for Online Buffer Sharing is (2 + ln n)-Competitive: A Simple Proof. CoRR abs/2511.06514 (2025) - 2024
- [c14]Krishna Agrawal, Vamsi Addanki, Habib Mostafaei:
Dequeue Rate-Agnostic Switch Buffer Sharing through Packet Queueing Delay. StudentWorkshop@CoNEXT 2024: 1-2 - [c13]Sarah-Michelle Hammer, Vamsi Addanki, Max Franke, Stefan Schmid:
Starlink Performance through the Edge Router Lens. LEO-NET 2024: 67-72 - [c12]Vamsi Addanki, Maciej Pacut, Stefan Schmid:
Credence: Augmenting Datacenter Switch Buffer Sharing with ML Predictions. NSDI 2024: 613-634 - [c11]Vamsi Addanki, Wei Bai, Stefan Schmid, Maria Apostolaki:
Reverie: Low Pass Filter-Based Switch Buffer Sharing for Datacenters with RDMA and TCP Traffic. NSDI 2024: 651-668 - [i9]Vamsi Addanki, Maciej Pacut, Stefan Schmid:
Credence: Augmenting Datacenter Switch Buffer Sharing with ML Predictions. CoRR abs/2401.02801 (2024) - [i8]Vamsi Addanki, Chen Avin, Stefan Schmid:
Understanding the Throughput Bounds of Reconfigurable Datacenter Networks. CoRR abs/2405.20869 (2024) - [i7]Vamsi Addanki, Prateesh Goyal, Ilias Marinos:
Challenging the Need for Packet Spraying in Large-Scale Distributed Training. CoRR abs/2407.00550 (2024) - 2023
- [j1]Vamsi Addanki, Chen Avin, Stefan Schmid:
Mars: Near-Optimal Throughput with Shallow Buffers in Reconfigurable Datacenter Networks. Proc. ACM Meas. Anal. Comput. Syst. 7(1): 2:1-2:43 (2023) - [c10]Vamsi Addanki, Maciej Pacut, Arash Pourdamghani, Gábor Rétvári, Stefan Schmid, Juan Vanerio:
Self-Adjusting Partially Ordered Lists. INFOCOM 2023: 1-10 - [c9]Jörn-Thorben Hinz, Vamsi Addanki, Csaba Györgyi, Theo Jepsen, Stefan Schmid:
TCP's Third Eye: Leveraging eBPF for Telemetry-Powered Congestion Control. eBPF@SIGCOMM 2023: 1-7 - [c8]Vamsi Addanki, Chen Avin, Stefan Schmid:
Mars: Near-Optimal Throughput with Shallow Buffers in Reconfigurable Datacenter Networks. SIGMETRICS (Abstracts) 2023: 3-4 - 2022
- [c7]Vamsi Addanki, Oliver Michel, Stefan Schmid:
PowerTCP: Pushing the Performance Limits of Datacenter Networks. NSDI 2022: 51-70 - [c6]Vamsi Addanki, Maria Apostolaki, Manya Ghobadi, Stefan Schmid, Laurent Vanbever:
ABM: active buffer management in datacenters. SIGCOMM 2022: 36-52 - [i6]Vamsi Addanki, Chen Avin, Stefan Schmid:
Mars: Near-Optimal Throughput with Shallow Buffers in Reconfigurable Datacenter Networks. CoRR abs/2204.02525 (2022) - 2021
- [i5]Maciej Pacut, Juan Vanerio, Vamsi Addanki, Arash Pourdamghani, Gábor Rétvári, Stefan Schmid:
Online List Access with Precedence Constraints. CoRR abs/2104.08949 (2021) - [i4]Maria Apostolaki, Vamsi Addanki, Manya Ghobadi, Laurent Vanbever:
FB: A Flexible Buffer Management Scheme for Data Center Switches. CoRR abs/2105.10553 (2021) - [i3]Maciej Pacut, Juan Vanerio, Vamsi Addanki, Arash Pourdamghani, Gábor Rétvári, Stefan Schmid:
Self-Adjusting Packet Classification. CoRR abs/2109.15090 (2021) - [i2]Vamsi Addanki, Oliver Michel, Stefan Schmid:
PowerTCP: Pushing the Performance Limits of Datacenter Networks. CoRR abs/2112.14309 (2021) - 2020
- [c5]Vamsi Addanki, Luigi Iannone:
Moving a step forward in the quest for Deterministic Networks (DetNet). Networking 2020: 458-466 - [c4]Kevin Vermeulen, Burim Ljuma, Vamsi Addanki, Matthieu Gouel, Olivier Fourmaux, Timur Friedman, Reza Rejaie:
Alias Resolution Based on ICMP Rate Limiting. PAM 2020: 231-248 - [i1]Kevin Vermeulen, Burim Ljuma, Vamsi Addanki, Matthieu Gouel, Olivier Fourmaux, Timur Friedman, Reza Rejaie:
Alias Resolution Based on ICMP Rate Limiting. CoRR abs/2002.00252 (2020)
2010 – 2019
- 2018
- [c3]Vamsi Addanki, Leonardo Linguaglossa, James Roberts, Dario Rossi:
Controlling Software Router Resource Sharing by Fair Packet Dropping. Networking 2018: 388-396 - [c2]Vamsi Addanki, Leonardo Linguaglossa, Jim Roberts, Dario Rossi:
Demo: Controlling Software Router Resource Sharing by Fair Packet Dropping. Networking 2018: A9-A10 - [c1]Vamsi Addanki, Leonardo Linguaglossa, James Roberts, Dario Rossi:
Fair dropping for multi-resource fairness in software routers Extended Abstract. SIGCOMM Posters and Demos 2018: 132-134
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2026-03-31 00:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
