Skip to main content
SpringerLink
Log in

Playout in slotted CBR networks: Single and multiple nodes

  • Communication Network Theory
  • Published:
Problems of Information Transmission Aims and scope Submit manuscript

Abstract

We consider playout of a constant bit-rate (CBR) traffic after one or several multiplexors in a network with a playout buffer. Probabilistic characteristics of the playout process are found, depending on the traffic characteristics and parameters of the buffer. We present conditions on the buffer parameters that guarantee no jitter (complete playout).

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. He, J.F. and Sohraby, K., An Extended Combinatorial Analysis Framework for Discrete-Time Queueing Systems with General Sources, IEEE/ACM Trans. Networking, 2003, vol. 11, no. 1, pp. 95–110.

    Article  Google Scholar 

  2. He, J.F. and Sohraby, K., On the Queueing Analysis of Dispersed Periodic Messages, in Proc. IEEE INFOCOM’2000, Tel Aviv, Israel, 2000, pp. 1046–1054.

  3. Su, W. and Akyildiz, I.F., The Jitter Time-Stamp Approach for Clock Recovery of Real-Time Variable Bit-Rate Traffic, IEEE/ACM Trans. Networking, 2001, vol. 9, no. 6, pp. 746–754.

    Article  Google Scholar 

  4. Iida, K., Takine, T., Sunahara, H., and Oie, Y., Delay Analysis for CBR Traffic under Static-Priority Scheduling, IEEE/ACM Trans. Networking, 2001, vol. 9, no. 2, pp. 177–185.

    Article  Google Scholar 

  5. Lee, D.C., Worst-Case Fraction of CBR Teletraffic Unpunctual due to Statistical Multiplexing, IEEE/ACM Trans. Networking, 1996, vol. 4,no. 1, pp. 98–105.

    Article  Google Scholar 

  6. Privalov, A.Yu., Analiz veroyatnostnykh kharakteristic izmenchivosti zaderzhki paketa v telekommunikatsionnykh setyakh (Analysis of Probabilistic Characteristics of Packet Delay Variation in Telecommunication Networks), Samara: Samarsk. Gos. Aerokosm. Univ., 2000.

    Google Scholar 

  7. Takács, L., Combinatorial Methods in the Theory of Stochastic Processes, New York: Wiley, 1967. Translated under the title Kombinatornye metody v teorii sluchainykh protsessov, Moscow: Mir, 1971.

    MATH  Google Scholar 

  8. Humblet, P., Bhargava, A., and Hluchyj, M.G., Ballot Theorems Applied to the Transient Analysis of ND/D/1 Queues, IEEE/ACM Trans. Networking, 1993, vol. 1, no. 1, pp. 81–95.

    Article  Google Scholar 

  9. Bhargava, A., Humblet, P., and Hluchyj, M.G., Queueing Analysis of Continuous Bit-Stream Transport in Packet Networks, in Proc. IEEE GLOBECOM’89, Dallas, Texas, 1989, pp. 903–907.

  10. Le Boudec, J.-Y. and Thiran, P., Network Calculus. A Theory of Deterministic Queuing Systems for the Internet, Lect. Notes Comp. Sci., vol. 2050, Berlin: Springer, 2001.

    Google Scholar 

  11. Privalov, A. and Sohraby, K., Per-Stream Jitter Analysis in CBR ATM Multiplexors, IEEE/ACM Trans. Networking, 1998, vol. 6, no. 2, pp. 141–149.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Samara State Aerospace University, Russia

    A. Yu. Privalov

  2. Department of Computer Science and Electrical Engineering, University of Missouri, Kansas City, USA

    K. Sohraby

Authors
  1. A. Yu. Privalov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. K. Sohraby
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Original Russian Text © A.Yu. Privalov, K. Sohraby, 2007, published in Problemy Peredachi Informatsii, 2007, Vol. 43, No. 2, pp. 85–111.

Supported in part by the Cooperative Grant Program of Civilian Research and Development Foundation (CRDF), Grant no. RU-M1-2590-SA-04. A conference version of this paper was presented at the International Teletraffic Congress (ITC’19, Beijing, 2005).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Privalov, A.Y., Sohraby, K. Playout in slotted CBR networks: Single and multiple nodes. Probl Inf Transm 43, 143–166 (2007). https://doi.org/10.1134/S003294600702007X

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S003294600702007X

Keywords

Search

Navigation