Balanced sequences and optimal routing

Journal of the ACM

Volumn 47, Issue 4, 2000, Pages 752-775

  Altman, Eitan ^a   Gaujal, Bruno ^b,d   Hordijk, Arie ^c  

^a INRIA   (France)

^b LORIA   (France)

^c LEIDEN UNIVERSITY   (Netherlands)

^d Leiden University ^*  (France)

Author keywords

Balanced sequences; Multimodularity; Optimal control; Stochastic event graphs

Indexed keywords

COMBINATORIAL CIRCUITS; CONTROL SYSTEMS; GRAPH THEORY; OPTIMIZATION; RANDOM PROCESSES; ROUTERS;

BALANCED SEQUENCES; OPTIMAL CONTROL; STOHASTIC EVENT GRAPHS;

QUEUEING NETWORKS;

EID: 0042758405     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/347476.347482     Document Type: Article

References (34)

1. ALTMAN, E., GAUJAL, B., AND HORDIJK, A. 1997a. Admission control in stochastic event graphs. Tech. Rep. 3179. RUL-TW-97-06. INRIA, Sophia Antopolis Cedex, France, and Leiden University, Leiden, The Netherlands.
2. ALTMAN, E., GAUJAL, B., AND HORDIJK, A. 1997b. Multimodularity, convexity and optimization properties. Tech. Rep. 3181. RUL-TW-97-07. INRIA, Sophia Antopolis Cedex, France, and Leiden University, Leiden, The Netherlands.
3. ALTMAN, E., AND STIDHAM, S. 1995. Optimality of monotonie policies for two-action Markovian decision processes with applications to control of queues with delayed information. Queuing Syst.: Theory Appl. 27,267-291.
4. ARNOUX, P., MAUDUIT, C., SHIOKAWA, I., AND TAMURA, J. 1994. Complexity of sequences defined by billiards in the cube. BSMF (Bull. Soc. Math. France) 122, 1-12.
5. BACCELLI, F., Foss, S., AND GAUJAL, B. 1996. Free choice nets, an algebraic approach. IEEE Trans. Autom. Cont. 41,12, 1751-1778.
6. BACCELLI, F., GOHEN, G., OLSDER, G. J., AND QUADRAT, J.-P. 1992. Synchronization and Linearity. Wiley, New York.
7. BAR-NOY, A., BHATIA, R., NAOR, J., AND SCHIEBER, B. 1998. Minimizing service and operation costs of periodic scheduling. In Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). ACM, New York.
8. BARYSHNIKOV, Y. 1995. Complexity of trajectories in rectangular billiards. Commun. Math. Phy. 175, 43-56.
9. BERSTEL, J., AND SééBOLD, P. 1994. Morphismes de Sturm. Bull. Belg. Math. Soc. 1, 175-189.
10. BOEL, R. K., AND VAN SCHUPPEN, J. H. 1989. Distributed routing for load balancing. Proc. IEEE, 210-221.
11. CHANG, C. S., CHAD, X., AND PINEDO, M. 1990. A note on queues with Bernoulli routing. In Proceedings of the 29th Conference on Decision and Control.
12. COMBE, M. B., AND BOXMA, O. 1994. Optimization of static traffic allocation policies. Theoret. Comput. Sei. 125, 17-43.
13. FRAENKEL, A. 1973. Complementary and exactly covering sequences. J. Combinat. Theory 14, 8-20.
14. GAUJAL, B. 1997. Optimal allocation sequences of two processes sharing a resource. J. Disc. Event Dyn. Syst. 7, 327-354.
15. GRAHAM, R. 1973. Covering the positive integers by disjoint sets of the form {[nα + β]:n = 1, 2, ⋯}. J. Combin. Theory 15, 354-358.
16. HAJEK, B. 1985. Extremal splittings of point processes. Math. Oper. Res. 10, 4, 543-556.
17. HARIHARAN, R., HULHARNI, V. G., AND STIDHAM, S. 1990. A survey of research relevant to virtual circuit routing in telecommunication networks. Tech. Rep. WC/OR/TR 90-13. Univ. N. Carolina at Chapel Hill, Chapel Hill, N.C.
18. HORDIJK, A., AND KOOLE, G. 1992. On the assignment of customers to parallel queues. Probab. Eng. Inf. Sei. 6, 495-511.
19. HORDIJK, A., KOOLE, G., AND LoEVE, A. 1994. Analysis of a customer assignment model with no state information. Probab. Eng. Inf. Sei. 8, 419-429.
20. HUBERT, P. 1996. Propriétés combinatoires des suites définies par le billard dans les triangles pavants. Theoret. Comput. Sei. 164, 1-2, 165-183.
21. KOOLE, G. 1996. On thé pathwise optimal Bernoulli routing policy for homogeneous parallel servers. Math. Oper. Res. 21, 469-476.
22. Liu, Z., AND RICHTER, R. 1998. Optimal load balancing on distrinuted homogeneous unreliable processors. Journal of Operations Research 46, 563-573.
23. LOEVE, J. A. 1995. Markov desicion chains with partial information. Ph.D. dissertation. Chap. 8: Regularity of words and periodic policies. Leiden Univ., Leiden, The Netherlands.
24. LOTHAIRE, M. 1991. Mots, chapter Tracé de droites, fractions continues et morphismes itérés (J. Berstel). Hermes.
25. MORIKAWA, R. 1985-1993. Disjoint sequences generated by the bracket function i-vi. Tech. Reps. 26(1985), 28(1988), 30(1989), 32(1992), 34(1993). Bulletin of the Faculty of Liberal Arts, Nagasaki Univ., Nagasaki, Japan.
26. MORIKAWA, R. 1982-1995. On eventually covering families generated by the bracket function i-v. Tech. Reps. 23(1982), 24(1983), 25(1984), 26(1985), 25(1985), 36(1995). Bulletin of the Faculty of Liberal Arts, Nagasaki Univ., Nagasaki, Japan.
27. MORSE, M., AND HEDLUND, G. A. 1940. Symbolic dynamics H-Sturmian trajectories. Amer. J. Math. 62, 287-306.
28. NEWMAN, M. 1971. Roots of unity and covering sets. Math. Ann. 191, 279-282.
29. SINAI, Y. G. 1976. Introduction to Ergodic Theory. Princeton University Press, Princeton, N.J. TIJDEMAN, R. 1995. On disjoint pairs of sturmian bisequences. Tech. Rep. W96-02. Leiden University, The Netherlands.
30. TIJDEMAN, R. 1996. On complementary triples of Sturmian sequences. Indag. Math. 419-424.
31. TIJDEMAN, R. 1998a. Fraenkel's conjecture for six sequences. Tech. Rep. W98-24. Leiden University, The Netherlands.
32. TIJDEMAN, R. 1998b. Intertwined periodic sequences, Sturmian sequences and Beatty sequence. Indag. Math. (N.S.) 9, 113-122.
33. VUILLON, L. 1998. Combinatoire des motifs d'une suite sturmienne bidimensionnelle. Tlteoret. Comput. Sei. 209, 261-285.
34. WILF, H. S. 1994. Generatingfunctionology. 2nd ed. Academic Press, Orlando, Fla.