Abstract
Consider to construct an infinite sequence from a finite set of letters such that each letter is distributed with “good balance,” that is, as uniformly as possible, and with a fixed rate. Such sequences have been applied to many scheduling and routing problems in the area of queueing/discrete-event systems. In this paper, we apply a new notion called m-balanced sequences to some network scheduling problems. This notion is recently developed by the authors and gives a measure of “balancedness” for sequences with any rates. The application results validate how effective the m-balanced sequences are in the area of discrete event systems.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.