Skip to main content
SpringerLink
Log in

On the Moments of Overflow and Freed Carried Traffic for the GI/M/C/0 System

  • Published:
Methodology And Computing In Applied Probability Aims and scope Submit manuscript

Abstract

In circuit-switched networks call streams are characterized by their mean and peakedness (two-moment method). The GI/M/C/0 system is used to model a single link, where the GI-stream is determined by fitting moments appropriately. For the moments of the overflow traffic of a GI/M/C/0 system there are efficient numerical algorithms available. However, for the moments of the freed carried traffic, defined as the moments of a virtual link of infinite capacity to which the process of calls accepted by the link (carried arrival process) is virtually directed and where the virtual calls get fresh exponential i.i.d. holding times, only complex numerical algorithms are available. This is the reason why the concept of the freed carried traffic is not used. The main result of this paper is a numerically stable and efficient algorithm for computing the moments of freed carried traffic, in particular an explicit formula for its peakedness. This result offers a unified handling of both overflow and carried traffics in networks. Furthermore, some refined characteristics for the overflow and freed carried streams are derived.

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

  • A. Brandt, P. Franken, and B. Lisek, Stationary Stochastic Models, Akademie-Verlag: Berlin; Wiley: Chichester, 1990.

    Google Scholar 

  • P. J. Deschamps, “Analytic approximation of blocking probabilities in circuit switched communication networks,” IEEE Trans. on Comm. vol. COM-27(3) pp. 603-606, 1979.

    Google Scholar 

  • P. Franken and J. Kerstan, “Bedienungssysteme mit unendlich vielen Bedienungsapparaten,” in Operationsforschung und mathematische Statistik I, Akademie-Verlag: Berlin, pp. 67-76, 1968.

    Google Scholar 

  • P. Franken, D. König, U. Arndt, and V. Schmidt, Queues and Point Processes, Akademie-Verlag: Berlin; Wiley: Chichester, 1982.

    Google Scholar 

  • A. Girard, Routing and Dimensioning in Circuit-Switched Networks, Addison-Wesley: Reading, 1990.

    Google Scholar 

  • B. W. Gnedenko and D. König, Handbuch der Bedienungstheorie, vol. I, vol. II, Akademie-Verlag: Berlin, 1984.

    Google Scholar 

  • H. Heffes and J. M. Holtzman, “Peakedness of traffic carried by a finite trunk group with renewal input,” Bell Sys. Tech. J. vol. 52 pp. 1617-1642, 1973.

    Google Scholar 

  • S. Katz, “Statistical performance analysis of switched communications networks,” Proc. 5th Int. Teletraffic Cong., pp. 566-575, 1967.

  • A. Kuczura, “The interrupted Poisson process as an overflow process,” Bell Sys. Tech. J. vol. 52(3) pp. 437-448, 1973.

    Google Scholar 

  • A. Kuczura and D. Bajaj, “A method of moments for the analysis of a switched communication network's performance,” IEEE Trans. on Comm. vol. COM-25(2) pp. 185-193, 1977.

    Google Scholar 

  • C. Pearce and R. Potter, “Some formulae old and new for overflow traffic in telephony,” Australian Telecommunication Research vol. 11 pp. 92-97, 1977.

    Google Scholar 

  • R. M. Potter, “Explicit formulae for all overflow moments of the Kosten and Brockmeyer systems with renewal input,” Australian Telecommunication Research vol. 13 pp. 39-49, 1980.

    Google Scholar 

  • Y. Rapp, “Planning of junction network in a multiexchange area,” Ericsson Technics vol. 20(1) pp. 77-130, 1964.

    Google Scholar 

  • L. Reneby, “Service protection and overflow in circuit switched networks,” Thesis, Technical Report 107, Department of Communication Systems, Lund Institute of Technology, Lund, 1991.

    Google Scholar 

  • L. Takacs, “On the generalization of Erlang's formula,” Acta Math. Acad. Sci. Hungar. vol. 7 pp. 419-433, 1956.

    Google Scholar 

  • L. Takacs, Introduction to the Theory of Queues, Oxford University Press: New York, 1962.

    Google Scholar 

  • E. A. van Doom, “Some analytical aspects of the peakedness concept,” Proc. 10th Int. Teletraffic Cong., Montreal, 1983.

  • “Extended version: Some aspects of the peakedness concept in teletraffic theory,” J. of Inf. Processing and Cybernetics (Elektron. Inf. verarb. Kybern.) EIK vol. 22(2/3) pp. 93-104, 1986.

  • R. I. Wilkinson, “Theories for toll traffic engineering in the U.S.A.,” Bell Sys. Tech. J. vol. 35(2) pp. 421-514, 1956.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Wirtschaftswissenschaftliche Fakultät, Humboldt-Universität zu Berlin, Spandauer Str. 1, D-10178, Berlin, Germany

    Andreas Brandt

  2. Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB), Takustr. 7, D-14195, Berlin, Germany

    Manfred Brandt

Authors
  1. Andreas Brandt
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Manfred Brandt
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Brandt, A., Brandt, M. On the Moments of Overflow and Freed Carried Traffic for the GI/M/C/0 System. Methodology and Computing in Applied Probability 4, 69–82 (2002). https://doi.org/10.1023/A:1015757414583

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1015757414583

Search

Navigation