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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Altman, E., B. Gaujal and A. Hordijk. (2000). “Balanced Sequences and Optimal Routing,” to appear in J. ACM.
Altman, E., B. Gaujal and A. Hordijk. (1997). “Multimodularity, Convexity and Optimization Properties,” Research Report 3181, IN-R
Altman, E., B. Gaujal and A. Hordijk. (1997). “Regular ordering and applications in control policies,” Proc. of 37th IEEE Conf. on Decision and Control, pp. 66–76.
Altman, E., B. Gaujal, A. Hordijk and G. Koole. (1998). “Optimal admission, routing and service assignment control: The case of single buffer queues,” Proc. of 37th IEEE Conf on Decision and Control, pp. 2119–2
Coven, E.M. and G.A. Hedlund. (1973). “Sequences with Minimal Block Growth,” Math. Sys. Theory, vol. 7, pp. 138–153.
Hajek, B. (1985). “Extremal Splittings of Point Processes,” Math. of Operat. Res., vol. 10, pp. 543–556.
Kesidis, G. (1996). ATM Network Performance. Kluwer Academic Publishers, New York.
Morse, M. and G.A. Hedlund. (1940). “Symbolic dynamics II: Sturmian trajectories,” American J. Math., vol. 62, pp.1–42
Sano, S. and N. Miyoshi. (2000). “m-Balanced Sequences: Theory and Applications to Some Network Scheduling Problems,” in preparati
Shirakawa, H., M. Mori and M. Kijima. (1988). “Further Properties of Extremal Sequences in Queues,” Commun. Statist.—Stoch. Models, vol. 4, pp. 117–132.
Tijdeman, R. (1996). “On complementary triples of Sturmian bise-quences,” Indag. Math., vol. 7, pp. 419–424.
Tijdeman, R. (1998). “Intertwinings of periodic sequences,” Indag. Math., vol. 9, pp. 113–122.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer Science+Business Media New York
About this chapter
Cite this chapter
Sano, S., Miyoshi, N. (2000). Applications of m-Balanced Sequences to Some Network Scheduling Problems. In: Boel, R., Stremersch, G. (eds) Discrete Event Systems. The Springer International Series in Engineering and Computer Science, vol 569. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-4493-7_33
Download citation
DOI: https://doi.org/10.1007/978-1-4615-4493-7_33
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7025-3
Online ISBN: 978-1-4615-4493-7
eBook Packages: Springer Book Archive