Search Results for author:
Found 9 papers, 5 papers with code
Credence: Augmenting Datacenter Switch Buffer Sharing with ML Predictions
This suggests that augmenting drop-tail algorithms with predictions about the future arrivals has the potential to significantly improve performance.
Heterogeneous Graph-based Trajectory Prediction using Local Map Context and Social Interactions
Precisely predicting the future trajectories of surrounding traffic participants is a crucial but challenging problem in autonomous driving, due to complex interactions between traffic agents, map context and traffic rules.
Temporal Locality in Online Algorithms
Online algorithms make decisions based on past inputs.
Data Structures and Algorithms Distributed, Parallel, and Cluster Computing
Learning Visual Models using a Knowledge Graph as a Trainer
However, due to the sole dependence on the image data distribution of the training domain, these models tend to fail when applied to a target domain that differs from their source domain.
Towards Runtime Verification of Programmable Switches
Once the bug in a P4 program is localized, the faulty code can be patched due to the programmable nature of P4.
(FPT-)Approximation Algorithms for the Virtual Network Embedding Problem
Accordingly, to capture the structure of request graphs, we introduce the graph-theoretic notion of extraction orders and extraction width and show that our algorithms have exponential runtime in the request graphs' maximal width.
Networking and Internet Architecture Data Structures and Algorithms C.2.2; G.1.6; G.2.2
Virtual Network Embedding Approximations: Leveraging Randomized Rounding
Proving performance guarantees of our rounding scheme, we obtain the first approximation algorithm for the VNEP in the resource augmentation model.
Networking and Internet Architecture Data Structures and Algorithms C.2.2; G.1.6; F.2.2
Renaissance: A Self-Stabilizing Distributed SDN Control Plane using In-band Communications
By introducing programmability, automated verification, and innovative debugging tools, Software-Defined Networks (SDNs) are poised to meet the increasingly stringent dependability requirements of today's communication networks.
Networking and Internet Architecture Distributed, Parallel, and Cluster Computing Data Structures and Algorithms
Service Chain and Virtual Network Embeddings: Approximations using Randomized Rounding
The SDN and NFV paradigms enable novel network services which can be realized and embedded in a flexible and rapid manner.
Networking and Internet Architecture C.2.2; G.1.6; F.2.2
