112 citations · 248 across the 10 of their papers we have counts for
10 papers
Towards Traffic Modelling of Multi-Agent Systems: The Role of Coordination Topology
Davide Lamagna, Albert Cabellos, Alberto Rodriguez-Natal +2
Multi-agent LLM systems are an emerging networked workload whose rapid deployment raises questions about the traffic patterns they generate. Compared to conventional applications,…
MTS: Bringing Multi-Tenancy to Virtual Networking
Kashyap Thimmaraju, Saad Hermak, Gábor Rétvári +1
Multi-tenant cloud computing provides great benefits in terms of resource sharing, elastic pricing, and scalability, however, it also changes the security landscape and introduces…
The Programmable Data Plane: Abstractions, Architectures, Algorithms, and Applications
Oliver Michel, Roberto Bifulco, Gabor Retvari +1
Programmable data plane technology enables the systematic reconfiguration of the low-level processing steps applied to network packets and is a key driver in realizing the next gen…
Self-Adjusting Packet Classification
Maciej Pacut, Juan Vanerio, Vamsi Addanki +3
This paper is motivated by the vision of more efficient packet classification mechanisms that self-optimize in a demand-aware manner. At the heart of our approach lies a self-adjus…
Online List Access with Precedence Constraints
Maciej Pacut, Juan Vanerio, Vamsi Addanki +3
This paper considers a natural generalization of the online list access problem in the paid exchange model, where additionally there can be precedence constraints ("dependencies")…
Routes Obey Hierarchy in Complex Networks
Attila Csoma, Attila Kőrösi, Gábor Rétvári +7
Various hypotheses exist about the paths used for communication between the nodes of complex networks. Most studies simply suppose that communication goes via shortest paths, while…
Lying Your Way to Better Traffic Engineering
Marco Chiesa, Gábor Rétvári, Michael Schapira
To optimize the flow of traffic in IP networks, operators do traffic engineering (TE), i.e., tune routing-protocol parameters in response to traffic demands. TE in IP networks typi…
Navigable Networks as Nash Equilibria of Navigation Games
András Gulyás, József Bíró, Attila Kőrösi +2
The common sense suggests that networks are not random mazes of purposeless connections, but that these connections are organised so that networks can perform their functions well.…
Compressing IP Forwarding Tables: Towards Entropy Bounds and Beyond
Gábor Rétvári, János Tapolcai, Attila Kőrösi +2
Lately, there has been an upsurge of interest in compressed data structures, aiming to pack ever larger quantities of information into constrained memory without sacrificing the ef…
Memory size bounds of prefix DAGs
János Tapolcai, Gábor Rétvári, Attila Kőrösi
In this report an entropy bound on the memory size is given for a compression method of leaf-labeled trees. The compression converts the tree into a Directed Acyclic Graph (DAG) by…