Zobrazeno 1 - 10
of 67
pro vyhledávání: '"Retvari, Gabor"'
Publikováno v:
USENIX ATC 2019
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 need for strong isolation between the tenants, also inside the net
Externí odkaz:
http://arxiv.org/abs/2403.01862
Programmable packet scheduling allows the deployment of scheduling algorithms into existing switches without need for hardware redesign. Scheduling algorithms are programmed by tagging packets with ranks, indicating their desired priority. Programmab
Externí odkaz:
http://arxiv.org/abs/2308.00797
Publikováno v:
The Programmable Data Plane: Abstractions, Architectures, Algorithms, and Applications. ACM Comput. Surv. 54, 4, Article 82 (July 2021)
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 generation of network services and applications. This survey presents rec
Externí odkaz:
http://arxiv.org/abs/2110.00631
Autor:
Pacut, Maciej, Vanerio, Juan, Addanki, Vamsi, Pourdamghani, Arash, Retvari, Gabor, Schmid, Stefan
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-adjusting linear list data structure, where unlike in the classic data stru
Externí odkaz:
http://arxiv.org/abs/2109.15090
State-of-the-art approaches to design, develop and optimize software packet-processing programs are based on static compilation: the compiler's input is a description of the forwarding plane semantics and the output is a binary that can accommodate a
Externí odkaz:
http://arxiv.org/abs/2106.08833
Autor:
Pacut, Maciej, Vanerio, Juan, Addanki, Vamsi, Pourdamghani, Arash, Retvari, Gabor, Schmid, Stefan
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") among the nodes in the list. For example, this generalization is motiv
Externí odkaz:
http://arxiv.org/abs/2104.08949
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Csoma, Attila, Kőrösi, Attila, Rétvári, Gábor, Heszberger, Zalán, Bíró, József, Slíz, Mariann, Avena-Koenigsberger, Andrea, Griffa, Alessandra, Hagmann, Patric, Gulyás, András
Publikováno v:
Scientific Reports 7, Article number: 7243 2017
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 others have more explicit assumptions about how routing (alternativel
Externí odkaz:
http://arxiv.org/abs/1702.05912
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 typically involves configuring static link weights and splitting traffic b
Externí odkaz:
http://arxiv.org/abs/1610.02728
Publikováno v:
Nature Communications 6, Article number: 7651, 03 July 2015
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. One function common to many networks is targeted transport or navigat
Externí odkaz:
http://arxiv.org/abs/1412.7229