Skip to main content
SpringerLink
Log in

Queueing discipline for inquiries in information systems

  • Published:
Cybernetics Aims and scope

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

Literature Cited

  1. S. H. Storey, “Optimal fixed batch sizes for real-time inquiry systems,” Comput. J.,15, No. 2 (1972).

    Google Scholar 

  2. D. R. Cox and W. L. Smith, Queues, Methuen, London; Wiley, New York (1961).

    Google Scholar 

  3. I. V. Sergienko, “Minimum-search problems for a function of a discrete argument,” in: Algorithmic Languages and Programming Automation [in Russian], Izd. Inst. Kibernetiki Akad. Nauk UkrSSR, Kiev (1964).

    Google Scholar 

Download references

Authors
  1. F. I. Andon
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. G. M. Vartanyan
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 3, pp. 54–60, May–June, 1975.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Andon, F.I., Vartanyan, G.M. Queueing discipline for inquiries in information systems. Cybern Syst Anal 11, 400–406 (1975). https://doi.org/10.1007/BF01069465

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01069465

Keywords

Search

Navigation