Skip to main content
SpringerLink
Log in

Bounds for Deterministic Periodic Routing sequences

  • Conference paper
  • First Online:
Integer Programming and Combinatorial Optimization (IPCO 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2081))

Abstract

We consider the problem of routing arriving jobs to parallel queues according to a deterministic periodic routing sequence. We introduce a combinatorial notion called the unbalance for such routing sequences. This unbalance is used to obtain an upper bound for the average waiting time of the routed jobs. The best upper bound for given (optimized) routing fractions is obtained when the unbalance is minimized. The problem of minimizing the unbalance is investigated and we show how to construct sequences with small unbalance.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Altman, E., Gaujal, B., Hordijk, A.: Admission control in stochastic event graphs. IEEE Trans. Automat. Control 45 (2000) 854–867

    Article  MATH  MathSciNet  Google Scholar 

  2. Altman, E., Gaujal, B., Hordijk, A.: Balanced sequences and optimal routing, J. Assoc. Comput. Mach. 47 (2000) 752–775

    MathSciNet  Google Scholar 

  3. Altman, E., Gaujal, B., Hordijk, A.: Multimodularity, convexity and optimization properties. Math. Oper. Res. 25 (2000) 324–347

    Article  MATH  MathSciNet  Google Scholar 

  4. Arnoux, P., Mauduit, C., Shiokawa, I., Tamura, J.: Complexity of sequences defined by billiards in the cube. Bull. Soc. Math. France 122 (1994) 1–12

    MATH  MathSciNet  Google Scholar 

  5. Arian, Y., L evy, Y.: Algorithms for generalized round Robin routing. Oper. Res. Lett. 12 (1992) 313–319

    Article  MATH  MathSciNet  Google Scholar 

  6. Gaujal, B., Hyon, E.: Optimal routing policy in two deterministic queues. Technical Report INRIA RR-3997 (2000). To appear in Calculateurs Paralléles

    Google Scholar 

  7. Gross, D., Harris, C. M.: Fundamentals of queueing theory. Wiley Series in Probability and Mathematical Statistics (1974)

    Google Scholar 

  8. Hajek, B.: The Proof of a Folk Theorem on Queueing Delay with Applications to Routing in Networks. J. ACM 30 (1983) 834–851

    Article  MATH  MathSciNet  Google Scholar 

  9. Hajek, B.: Extremal splittings of point processes. Math. Oper. Res. 10 (1985) 543–556

    MATH  MathSciNet  Google Scholar 

  10. Hordijk, A., van der Laan, D. A.: Periodic routing to parallel queues with bounds on the average waiting time. Report MI no. 2000-44 Leiden University (2000). Submitted to Journal of Scheduling

    Google Scholar 

  11. van der Laan, D. A.: Routing jobs to servers with deterministic service times. Report MI no. 2000-20 Leiden University (2000). Submitted to Math. Oper. Res.

    Google Scholar 

  12. Liu, Z., Righter, R.: Optimal load balancing on distributed homogeneous unreliable processors. Oper. Res. 46 (1998) 563–573

    Article  MATH  Google Scholar 

  13. Morse, M., Hedlund, G. A.: Symbolic dynamics II. Amer. J. Math. 60 (1940) 1–42

    Article  MathSciNet  Google Scholar 

  14. Shirakawa, H., Mori, M., Kijima, M.: Evaluation of Regular Splitting Queues. Comm. Statist. Stochastic Models 5 (1989) 219–234

    Article  MATH  MathSciNet  Google Scholar 

  15. Tijdeman, R.: Fraenkel’s conjecture for six sequences. Discrete Math. 222 (2000) 223–234

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematical Institute, Leiden University, P.O. Box 9512, 2300, RA, Leiden, The Netherlands

    A. Hordijk & D. A. van der Laan

Authors
  1. A. Hordijk
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. D. A. van der Laan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Instituut voor Informatica en Informatiekunde, Universiteit Utrecht, Padualaan 14, 3584, CH Utrecht, The Netherlands

    Karen Aardal

  2. CWI, Kruislaan 413, 1098, SJ Amsterdam, The Netherlands

    Bert Gerards

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hordijk, A., van der Laan, D.A. (2001). Bounds for Deterministic Periodic Routing sequences. In: Aardal, K., Gerards, B. (eds) Integer Programming and Combinatorial Optimization. IPCO 2001. Lecture Notes in Computer Science, vol 2081. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45535-3_19

Download citation

  • DOI: https://doi.org/10.1007/3-540-45535-3_19

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42225-9

  • Online ISBN: 978-3-540-45535-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation