Êtes-vous un étudiant de l'EPFL à la recherche d'un projet de semestre?
Travaillez avec nous sur des projets en science des données et en visualisation, et déployez votre projet sous forme d'application sur Graph Search.
Some of the known results for delivering deterministic bounds on end-to-end queuing delay in networks with constant packet sizes and constant link rates rely on the concept of Route Interference. Namely, it is required to know the number of flows joining on any output link in the whole network. In this paper we extend the existing results for the more generic cases of connection-oriented networks consisting of links with different capacities, carrying different traffic classes and packets of different sizes.
Pascal Frossard, Laura Toni, Sergio Mena, Stefano D'Aronco
Frédéric Courbin, Martin Raoul Robert Millon, Eric Gérard Guy Paic, Cameron Alexander Campbell Lemon, Sun Hee Kim, Hung-Hsu Chan, Vivien François Bonvin, Karina Alexandra Rojas Olate, Adriano Agnello