Skip to main content
SpringerLink
Log in

An Interval Global Optimization Algorithm Combining Symbolic Rewriting and Componentwise Newton Method Applied to Control a Class of Queueing Systems

  • Published:
Reliable Computing

Abstract

This paper considers two main topics.

The first one is a new interval global optimization algorithm, using some symbolic transformations of the optimality conditions. The theory of Groebner bases and the idea of componentwise interval Newton method are used.

The second topic is the description of an optimization problem connected with access control to a computer server. This optimization problem is solved by using a new algorithm and, for comparison, by using a classical interval branch-and-bound algorithm.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Adan, I. and Resing, J.: Queueing Theory, 2001, http://www.cs.duke.edu/~fishhai/misc/queue.pdf.

  2. Basiri, A. and Faugere, J. C.: Changing the Ordering of Groebner Bases with LLL: Case of Two Variables, http://www.inria.fr/INRIA/publication/publi-ps-gz/RR/RR-4746.ps.gz.

  3. Benhamou, F. and Granvilliers, L.: Automatic Generation of Numerical Redundancies for Non-Linear Constraint Solving, 1997, http://www.sciences.univ-nantes.fr/info/perso/permanents/benhamou/papers/BenGra_Reliable97.pdf.

  4. Benhamou, F. and Granvilliers, L.: Combining Local Consistency, Symbolic Rewriting and Interval Methods, 1994, http://www.sciences.univ-nantes.fr/info/perso/permanents/benhamou/papers/BenGra_AISMC96.pdf.

  5. BrainyEncyclopedia, http://www.brainyencyclopedia.com/encyclopedia/p/pa/pareto_distribution.html.

  6. Buchberger, B.: Groebner Bases and Systems Theory, 2001, http://www.risc.uni-linz.ac.at/people/buchberg/papers/2001–05-12-A.ps.

  7. Collart, S., Kalkenbrener, M., and Mall, D.: Converting Bases with the Groebner Walk, Journal of Symbolic Computations 24 (1997), pp. 465–469.

    Article  Google Scholar 

  8. Dewan, S. and Mendelson, H.: User Delay Costs and Internal Pricing for a Service Facility, Management Science 36 (12) (1990), pp. 1502–1517.

    Google Scholar 

  9. Downey, A. B.: Why Is Internet Traffic Self-Similar?, 2001, http://allendowney.com/research/filesize/delaware.pdf.

  10. Faugere, J. C., Gianni, P., Lazard, D., and Mora, T.: Efficient Computation of Zero-Dimensional Groebner Bases by Change of Ordering, Journal of Symbolic Computations 16 (1993), pp. 329–344.

    Article  Google Scholar 

  11. Fischer, M. J., Gross, D., Masi, D. M. B., Shortle, J., and Brill, P. H.: Using Quantile Estimates in Simulating Internet Queues with Pareto Service Times, 2001, http://www.informs-cs.org/wsc01papers/062.PDF.

  12. Hansen, E.: Global Optimization Using Interval Analysis, Marcel Dekker, New York, 1992.

    Google Scholar 

  13. Herbort, S. and Ratz, D.: Improving the Efficiency of a Nonlinear-System-Solver Using the Componentwise Newton Method, 1997, http://www.uni-karlsruhe.de/~iam/html/reports/rep9702.ps.gz.

  14. Kearfott, R. B.:AReview of Techniques in the Verified Solution of Constrained Global Optimization Problems, in:Kearfott, R. B. andKreinovich, V. (eds), Applications of IntervalComputations, Kluwer Academic Publishers, Dordrecht, 1996, http://interval.louisiana.edu/preprints.html/.

  15. Kearfott, R. B.: Rigorous Global Search: Continuous Problems, Kluwer Academic Publishers, Dordrecht, 1996.

    Google Scholar 

  16. Kearfott, R. B., Nakao, M. T., Neumaier, A., Rump, S. M., Shary, S. P., and Van Hentenryck, P.: Standardized Notation in Interval Analysis, submitted to Reliable Computing, http://www.mat.univie.ac.at/~neum/software/int/notation.ps.gz.

  17. Kubica, B. J. and Malinowski, K.: The Queuing Models of Mendelson-Review, Analysis and Some Generalizations, in: Proceedings of the SPECTS 2004 Multiconference (International Symposium on Performance Evaluation of Computer and Telecommunications Systems), San Jose, 2004, pp. 478–483.

  18. Paxon, V. and Floyd, S.: Wide Area Traffic: The Failure of Poisson Modeling, IEEE/ACM Transactions on Networking 3 (3) (1995), pp. 226–244, http://www.cs.umd.edu/class/fall1999/cmsc711/papers/failure-poisson.pdf.

  19. PoSSo Home Page, http://posso.dm.unipi.it/.

  20. Ratschek, H. and Rokne, J.: Interval Methods, in: Horst, R. and Pardalos, P. M. (eds), Handbook of Global Optimization, Kluwer Academic Publishers, 1995, pp. 751–828.

  21. Siegrist, K.: Virtual Laboratories in Probability and Statistics, http://www.ds.unifi.it/VL/VLEN/special/special12.html.

  22. Stidham, S., Jr.: Pricing and Capacity Decisions for a Service Facility: Stability and Multiple Local Optima, Management Science 38 (8) (1992), pp. 1121–1139.

    Google Scholar 

  23. Wiechowski, P.: An Object-Oriented Interval Library for Solving Global Optimization Problems and Nonlinear Equations Systems, BEng Thesis under supervision of Andrzej Karbowski, Warsaw, 2003 (in Polish).

  24. XSC Languages (C-XSC, PASCAL-XSC), http://www.xsc.de/.

Download references

Author information

Authors and Affiliations

  1. Warsaw University of Technology, Institute of Control and Computation Engineering, ul. Nowowiejska 15/19, 00-665, Warsaw, Poland

    Bartłomiej Jacek Kubica

  2. Research and Academic Computer Network (NASK), ul. Wawozowa 18, 02-796, Warsaw, Poland

    Krzysztof Malinowski

Authors
  1. Bartłomiej Jacek Kubica
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Krzysztof Malinowski
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Bartłomiej Jacek Kubica.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kubica, B.J., Malinowski, K. An Interval Global Optimization Algorithm Combining Symbolic Rewriting and Componentwise Newton Method Applied to Control a Class of Queueing Systems. Reliable Comput 11, 393–411 (2005). https://doi.org/10.1007/s11155-005-0047-y

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11155-005-0047-y

Keywords

Search

Navigation