Skip to main content
SpringerLink
Log in

Asymptotic analysis of queues in multiple-access computer networks

  • Systems Analysis
  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

The paper considers local-area computer networks with a protocol that supports carrier-sense multiple access with instantaneous conflict detection and is a generalization of slotted ALOHA. An approach based on recurrent processes is applied to analyze the asymptotic behavior of the number of waiting calls under conditions of low retrial rate.

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

Literature Cited

  1. L. Kleinrock, Computer Systems with Queues [Russian translation], Mir, Moscow (1979).

    Google Scholar 

  2. L. Kleinrock and F. A. Tobagi, "Packet switching in radio channels, Part I, Carrier sense multiple access and their throughput-delay characteristics," IEEE Trans. Comput.,23, No. 12, 1400–1417 (1975).

    Google Scholar 

  3. R. M. Metcalf and D. R. Boggs, "Ethernet distributed packet switching for local computer networks," Comm. ACM,19, No. 7, 395–404 (1976).

    Google Scholar 

  4. V. V. Anisimov and A. O. Aliev, "Limit theorems for recurrent semi-Markov processes," Teor. Veroyatn. Mat. Stat., No. 41, 9–15 (1989).

    Google Scholar 

  5. V. V. Anisimov and A. O. Aliev, Diffusion Approximation of Recurrent Semi-Markov Algorithms and Its Application in Queueing Systems [in Russian], Preprint, Inst. Kiber., Akad. Nauk UkrSSR, Kiev (1989).

    Google Scholar 

  6. A. A. Nazarov, "Analysis of the mathematical model of a carrier-sense multiple access protocol with instantaneous conflict detection," Abstracts of papers at Republican Sci.-Tech. Seminar on Mathematical Models of Analysis of Communication Networks and Computer Networks [in Russian], Vitebsk (1990), pp. 90–92.

  7. V. V. Anisimov and Kh. L. Atadzhanov, "Diffusion approximation of queueing systems with retrials," Abstracts of papers at Republican Sci.-Tech. Seminar on Mathematical Models of Analysis of Communication Networks and Computer Networks [in Russian], Vitebsk (1990), p. 13.

Download references

Authors
  1. V. V. Anisimov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kh. L. Atadzhanov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 4, pp. 54–61, July–August, 1991.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Anisimov, V.V., Atadzhanov, K.L. Asymptotic analysis of queues in multiple-access computer networks. Cybern Syst Anal 27, 520–526 (1991). https://doi.org/10.1007/BF01130361

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation