Abstract
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 the stochastic sense) when the input sequence becomes more regular.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
