Emerging optical and virtualization technologies enable the design of mo...
Packet scheduling is a fundamental networking task that recently receive...
With the increasing scale of communication networks, the likelihood of
f...
Mass live content, such as world cups, the Superbowl or the Olympics, at...
Byzantine reliable broadcast is a primitive that allows a set of process...
In the online bisection problem one has to maintain a partition of n
ele...
The performance of many large-scale and data-intensive distributed syste...
Consensus is one of the most fundamental problems in distributed computi...
Datacenter networks are becoming increasingly flexible with the incorpor...
Broadcast and consensus are most fundamental tasks in distributed comput...
We introduce a novel method for the rigorous quantitative evaluation of
...
The precise estimation of resource usage is a complex and challenging is...
Emerging reconfigurable datacenters allow to dynamically adjust the netw...
We consider the fundamental problem of designing a self-adjusting tree, ...
Dynamic programming (DP) is one of the fundamental paradigms in algorith...
Representing relevant information of a traffic scene and understanding i...
We study the broadcast problem on dynamic networks with n processes. The...
Data dissemination is a fundamental task in distributed computing. This ...
The performance of distributed and data-centric applications often criti...
Emerging software-defined networking technologies enable more adaptive
c...
Payment channel networks (PCNs) are a promising technology to improve th...
This paper studies the problem of how to dynamically optimize the topolo...
Google's BBR is the most prominent result of the recently revived quest ...
This paper revisits the problem of designing online algorithms for
self-...
Payment channel networks (PCNs) are one of the most prominent solutions ...
We consider a natural problem dealing with weighted packet selection acr...
We revisit the design of self-adjusting single-source tree networks. The...
Modern communication networks feature fully decentralized flow rerouting...
Throughput and latency critical applications could often benefit of
perf...
The performance of large-scale computing systems often critically depend...
Consensus is a most fundamental task in distributed computing. This pape...
We propose Kevin, a novel demand-aware reconfigurable rack-to-rack datac...
Payment channel networks (PCNs) such as the Lightning Network offer an
a...
Reconfigurable optical topologies promise to improve the performance in
...
Increasingly stringent throughput and latency requirements in datacenter...
Today's communication networks have stringent availability requirements ...
Payment channels effectively move the transaction load off-chain thereby...
Programmable data plane technology enables the systematic reconfiguratio...
This paper is motivated by the vision of more efficient packet classific...
In various contexts of networking research, end-host path selection has
...
We show that any algorithm that solves the sinkless orientation problem ...
To ensure high availability, datacenter networks must rely on local fast...
While operating communication networks adaptively may improve utilizatio...
The performance of distributed and data-centric applications often criti...
This paper proposes a new approximation algorithm for the offline Virtua...
This paper considers a natural generalization of the online list access
...
Payment channel networks are a promising approach to improve the scalabi...
Path-aware networks (PANs) are emerging as an intriguing new paradigm wi...
Graphical games are a useful framework for modeling the interactions of
...
Online algorithms make decisions based on past inputs. In general, the
d...