Skip to main content
SpringerLink
Log in

A full sensing window Random-Access algorithm for messages with strict delay constraints

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

We consider the Channel Multiple-Access problem for messages with strict delay constraints. The constraints are represented by an upper bound on the transmission delays. For this problem, and for binary collision-noncollision feedback per slot, we present a simple full sensing window Random-Access algorithm. We analyze the algorithm and we compute the fraction of maintained traffic and the expected delay for the successfully transmitted packet, for various input Poisson intensities and various values of the bound on the transmission delays.

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. J. Kurose, M. Schwartz, and Y. Yemini, Multiple-Access Protocols and Time Constrained Communication,ACM Computing Surveys, Vol. 16, No. 1, March 1984, pp. 43–70.

    Article  MathSciNet  Google Scholar 

  2. T. Gonsalves, Packet-Voice Communication on an Ethernet Local Computer Network: An Experimental Study,Proceedings of the SIGCOM Communications Architectures and Protocols Symposium, Austin, TX, March 8–9, 1983, pp. 178–185.

  3. G. Nutt and D. Bayer, Performance of CSMA/CD Networks Under Combined Voice and Data Loads,IEEE Transactions on Communications, Vol. 30, January 1982, pp. 6–11.

    Article  Google Scholar 

  4. J. Kurose, M. Schwartz, and Y. Yemini, Controlling Time Window Protocols for Time Constrained Communication in a Multiple Access Environment,Proceedings of the 8th International Data Communications Symposium, North Falmouth, MA, October 1983, pp. 75–84.

  5. L. Georgiadis, L. Merakos, and P. Papantoni-Kazakos, A Unified Method for Delay Analysis of Random Multiple Access Algorithms,IEEE Journal on Selected Areas in Communications, Vol. 5, No. 6, July 1987, pp. 1051–1062.

    Article  Google Scholar 

  6. M. Paterakis, L. Georgiadis, and P. Papantoni-Kazakos, On the Relation Between the Finite and the Infinite Population Models for a Class of RAA's,IEEE Transactions on Communications, Vol. 35, No. 11, November 1987, pp. 1239–1240.

    Article  Google Scholar 

  7. E. Seneta,Non-Negative Matrices, Wiley, New York, 1973.

    MATH  Google Scholar 

  8. J. L. Massey, Collision Resolution Algorithms and Random Access Communications, inMulti-user Communications (G. Longo, ed.), CISM Courses and Lectures Series, Springer-Verlag, New York, 1981, pp. 73–137.

    Google Scholar 

  9. P. A. Humblet, On the Throughput of Channel Access Algorithms with Limited Sensing,IEEE Transactions on Communications, Vol. 34, No. 4, April 1986, pp. 345–347.

    Article  MathSciNet  Google Scholar 

  10. L. Georgiadis and P. Papantoni-Kazakos, A 0.487 Throughput Limited Sensing Algorithm,IEEE Transactions on Information Theory, Vol. 33, No. 2, March 1987, pp. 233–237.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical Engineering, University of Virginia, Thornton Hall, 22901, Charlottesville, VA, USA

    M. Paterakis & P. Papantoni-Kazakos

  2. IBM Thomas J. Watson Research Center, P.O. Box 704, 10598, Yorktown Heights, NY, USA

    L. Georgiadis

Authors
  1. M. Paterakis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. L. Georgiadis
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. P. Papantoni-Kazakos
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Communicated by Israel Cidon and Inder S. Gopal.

This work was supported by the U.S. Office of Naval Research, under Contract ONR-N14-86-K-0742.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Paterakis, M., Georgiadis, L. & Papantoni-Kazakos, P. A full sensing window Random-Access algorithm for messages with strict delay constraints. Algorithmica 4, 313–328 (1989). https://doi.org/10.1007/BF01553894

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Key words

Search

Navigation