3 papers
cs.DC2019
Asynchronous Filling by Myopic Luminous Robots
Attila Hideg, Tamas Lukovszki
We consider the problem of filling an unknown area represented by an arbitrary connected graph of vertices by mobile luminous robots. In this problem, the robots enter the grap…
cs.NI2017
Approximate and Incremental Network Function Placement
Tamas Lukovszki, Matthias Rost, Stefan Schmid
The virtualization and softwarization of modern computer networks introduces interesting new opportunities for a more flexible placement of network functions and middleboxes (firew…
cs.NI2015
Online Admission Control and Embedding of Service Chains
Tamas Lukovszki, Stefan Schmid
The virtualization and softwarization of modern computer networks enables the definition and fast deployment of novel network services called service chains: sequences of virtualiz…