Applications of m-Balanced Sequences to Some Network Scheduling Problems

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.