Skip to main content
SpringerLink
Log in

A stack protocol of CTM type with quartet feedback

  • Published:
Applied Mathematics and Mechanics Aims and scope Submit manuscript

Abstract

In this paper, we analysed a stack protocol of the CTM (Capetanakis-Tsybakov-Mikhaikov) type with quartet feedback. We obtained the explicit expression of the expectation of CRI (Collision Resolution Interval) duration for the delayed access case. By means of numerical calculation we gave respectively the maximal capacities of channel of 0.4140 and 0.41445 packets/ slot for both the delayed case and immediate cases.

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. Abramson, N., The ALOHA system—another alternative for computer communications,Proc. AFIPS Conf. Fall Joint Comp. Conf.,37 (1970), 281–285.

    Google Scholar 

  2. Capetanakis, J.I., Tree Algorithms for Packet Broadcast Channels,IEEE Trans. Inf. Th.,IT-25, 5 (1979), 505–515.

    Article  MathSciNet  MATH  Google Scholar 

  3. Tsybakov, B.S. and V.A. Mikhailov, Free Synchronous Packet Access in a Broadcast Channel with Feedback,Proc. of Inf. Trans.,14, Oct.–Dec. (1978), 32–59.

    MathSciNet  MATH  Google Scholar 

  4. Mehravari, N. and T. Berger, Poisson multiple-access contention with binary feedback,IEEE Trans. Inf. Th.,IT-30, 5 (1985), 745–751.

    Article  MathSciNet  Google Scholar 

  5. Hofri, M., Stack Algorithms for Collision—Detecting Channels and Their Analysis: A limited survey,Proceedings of the International Seminar, Paris, France edited by F. Baccelli and G. Fayolle, Springer-Verlag, January (1983).

  6. Fayolle, G. and M. Hofri, On the capacity of a collision resolution channel under stack-based collision resolution algorithms, Technion, Haifa, Israel, Rep. 237, Oct. (1983).

  7. Fayolle, G., P. Flajolet, M. Hofri, and P. Jacquet, Analysis of a stack algorithm for random multiple-access communication,IEEE Trans. Inf. Th.,IT-31, 2, March (1985), 244–254.

    Article  MathSciNet  MATH  Google Scholar 

  8. Mathys, P. and P. Elajolet, Q-ary collision resolution algorithms in random-access system with free or blocked channel access,IEEE Trans. Inf. Th.,IT-31, 2, March (1985), 217–243.

    Article  MATH  Google Scholar 

  9. Fayolle, G., P. Flajolet, and M. Hofri, On a functional equation arising in the analysis of a protocol for a multi-access broadcast channel,Internal Rep. 131, INRIA, France, Apr. (1982).

    Google Scholar 

  10. Massey, J.L. and P. Mathys, The collision channel without feedback,IEEE Trans. Inf. Th.,IT-31, 2, March (1985), 192–204.

    Article  MathSciNet  MATH  Google Scholar 

  11. Tsybakov, B.S., Resolution of conflict with known multiplicity,Problem Peredach. Inform.,16, 2. Apr.–June (1980), 69–82. (in Russian)

    MathSciNet  Google Scholar 

  12. Georgiadis, L. and P. Papantoni-Kazakos, A collision resolution protocol for random access channel with energy detectors,IEEE Trans. Com.,Com-30, 11 (1982), 2413–2420.

    Article  MATH  Google Scholar 

  13. Tsybakov, B.S., Survey of USSS contributions to random multiple-access communications,IEEE Trans. Inf. Th.,IT-31, 2, March (1985).

Download references

Author information

Authors and Affiliations

  1. Lanzhou University, Lanzhou

    Chen Yong-yi & You Chuan-hua

Authors
  1. Chen Yong-yi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. You Chuan-hua
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Communicated by Yeh Kai-yuan

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yong-yi, C., Chuan-hua, Y. A stack protocol of CTM type with quartet feedback. Appl Math Mech 9, 881–890 (1988). https://doi.org/10.1007/BF02465732

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation