112 citations · 667 across the 96 of their papers we have counts for
10 papers · 1 filter
Wiser: Increasing Throughput in Payment Channel Networks with Transaction Aggregation
Samarth Tiwari, Michelle Yeo, Zeta Avarikioti +3
Payment channel networks (PCNs) are one of the most prominent solutions to the limited transaction throughput of blockchains. Nevertheless, PCNs suffer themselves from a throughput…
Weighted Packet Selection for Rechargeable Links: Complexity and Approximation
Stefan Schmid, Jakub Svoboda, Michelle Yeo
We consider a natural problem dealing with weighted packet selection across a rechargeable link, which e.g., finds applications in cryptocurrency networks. The capacity of a link $…
Deterministic Self-Adjusting Tree Networks Using Rotor Walks
Chen Avin, Marcin Bienkowski, Iosif Salem +3
We revisit the design of self-adjusting single-source tree networks. The problem can be seen as a generalization of the classic list update problem to trees, and finds applications…
On the Price of Locality in Static Fast Rerouting
Klaus-Tycho Foerster, Juho Hirvonen, Yvonne-Anne Pignolet +2
Modern communication networks feature fully decentralized flow rerouting mechanisms which allow them to quickly react to link failures. This paper revisits the fundamental algorith…
P4RROT: Generating P4 Code for the Application Layer
Csaba Györgyi, Sándor Laki, Stefan Schmid
Throughput and latency critical applications could often benefit of performing computations close to the client. To enable this, distributed computing paradigms such as edge comput…
Mars: Near-Optimal Throughput with Shallow Buffers in Reconfigurable Datacenter Networks
Vamsi Addanki, Chen Avin, Stefan Schmid
The performance of large-scale computing systems often critically depends on high-performance communication networks. Dynamically reconfigurable topologies, e.g., based on optical…