Abstract
This paper presents a unified model of classical teletraffic models covering both circuit-switched and packet-switched networks. The models of Erlang, Engset, Palm, and Delbrouck are generalized to loss and delay systems with multi-rate BPP (Binomial, Poisson, Pascal) traffic streams which all are insensitive to the holding time distributions. The Engset and Pascal traffic streams are also insensitive to the idle time distribution. Engset traffic corresponds to a finite number of users and Pascal traffic results in same state probabilities as Pareto-distributed inter-arrival times. The model is similar to balanced fair scheduling by Bonald and Proutière, but the approach is much simpler and allows for explicit results for finite source traffic and performance measures of each individual service. The model is evaluated by a simple stable algorithm with a minimal memory requirement and a time requirement which is linear in number of streams and number of servers plus queueing positions.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bonald, T., Proutière, A.: Insensitive bandwidth sharing in data networks. Queueing Systems 44, 69–100 (2003)
Bonald, T.: A recursive formula for multirate systems with elastic traffic. IEEE Communications Letters 9(8), 753–755 (2005)
Delbrouck, L.E.N.: On the steady–state distribution in a service facility carrying mixtures of traffic with different peakedness factor and capacity requirements. IEEE Transactions on Communications COM-31(11), 1209–1211 (1983)
Holmberg, T., Iversen, V.B.: Resource sharing models for Quality-of-Service with multi-rate traffic. In: ITC19, Performance Challenges for Efficient Next Generation Networks. Ninteenth International Teletraffic Congress, Beijing, August 29 – September 2, Proceedings, pp. 1275–1284 (2005)
Iversen, V.B.: The exact evaluation of multi–service loss system with access control. Teleteknik, English ed. 1(2), pp. 56–61. NTS–7, Seventh Nordic Teletraffic Seminar, Lund, Sweden, August 25–27, 1987, p. 22 (1987)
Iversen, V.B.: Teletraffic Theory and Network Planning. COM, Technical University of Denmark, Textbook, p. 354 (2006) Available at http://com.dtu.dk/educaton/34340/material/telenookpdf.pdf
Iversen, V.B.: Modelling restricted accessibility for wireless multi-service systems. In: Cesana, M., Fratta, L. (eds.) Wireless Systems and Network Architectures in Next Generation Internet. LNCS, vol. 3883, pp. 93–102. Springer, Heidelberg (2006)
Zheng, H., Zhang, Q., Iversen, V.B.: Trunk reservation in multiservice networks with BPP traffic. In: García-Vidal, J., Cerdà-Alabern, L. (eds.) Euro-NGI 2007. LNCS, vol. 4396, pp. 200–212. Springer, Heidelberg (2007)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Iversen, V.B. (2007). Reversible Fair Scheduling: The Teletraffic Theory Revisited. In: Mason, L., Drwiega, T., Yan, J. (eds) Managing Traffic Performance in Converged Networks. ITC 2007. Lecture Notes in Computer Science, vol 4516. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72990-7_97
Download citation
DOI: https://doi.org/10.1007/978-3-540-72990-7_97
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72989-1
Online ISBN: 978-3-540-72990-7
eBook Packages: Computer ScienceComputer Science (R0)