A polynomial algorithm for periodic scheduling
Conférence : Communications orales sans actes dans un congrès international ou national
We are interested in problems related to periodic scheduling, driven by applications using
networks in which terminals send identical flows periodically. The management of such flows
must not only minimize latency, but also jitter, and we have shown that classical methods
of sizing networks by statistical multiplexing are not suitable for this situation.