In this paper, we introduce the notion of regular ordering for periodic sequences based on the gaps between the entries. We define the notion of regular preserving functions using Schur convexity. This is used to extend some optimization results in queuing control problems. In particular, we show that the maximal traveling time in a stochastic event graph as well as the transmission times in a channel with redundancy, decrease (in a stochastic sense) when the input sequence becomes more regular. || Dans cet article, nous introduisons la notion d'ordre régulier pour des suites périodiques qui repose sur les écarts entre ses éléments. Nous définissons la notion de function régulièrement monotone en utilisant la Schur convexité. Ceci est ensuite u