Abstract
In a circuit-switched network, an accepted call blocks other connection requests. How could one quantify this interference? How do the routes used affect the performance of the network? How much should one “charge” each connection to maintain a predetermined revenue? What is the effect of a load change in some connection requests on the overall network and how should the charges be changed accordingly? How to compare network efficiency given a choice of alternate routes? To address some of these issues, we consider a stochastic model of a circuit-switched network and introduce “charges” for each class of users. The resulting “revenue-oriented” performance analysis could be used to show the effect of routing and load change on the network performance. The key to answering these questions is the efficient computation of the partition function, which captures the network behavior. We introduce the method of ensemble averaging to by-pass its computation exactly and to quickly approximate some network performance measures.
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
E. Arthurs and J. S. Kaufman. Sizing a message store subject to blocking criteria. In M. Arato, A. Butrimenko, and E. Gelenbe, editors, Performance of Computer Systems, pages 547–564, North-Holland, Amsterdam, The Netherlands, 1979.
M. A. Evgrafov. Asymptotic Estimates and Entire Functions. Gordon and Breach, New York, 1961.
A. Girard and Y. Ouimet. End-to-end blocking for circuit switched networks: polynomial algorithms for some special cases. IEEE Trans. Commun., COM- 31 (12): 1269–1273, December 1983.
J. Holtzmann. Analysis of dependence effects in telephone trunking networks. Bell Syst. Tech. J 50 (8): 2647–2662, October 1971.
D. Jagerman. Methods in traffic calculations. Bell Syst. Tech. J., 63 (7): 1283–1310, September 1984.
S. Katz. Statistical performance analysis of a switched communication network. In Proc. 5-th Intern. Teletraffic Congress, pages 566–575, Rockefeller University, New York, 1967.
J. S. Kaufman. Blocking in a shared resource environment. IEEE Trans. Commun., COM-29(10): 1474–1481, October 1981.
F. P. Kelly. Blocking probabilities in large circuit-switched networks. Adv. Appl. Prob., (18): 473–505, 1986.
F. P. Kelly. The Optimization of Queueing and Loss Networks, pages 375–392. North-Holland, 1988.
F. P. Kelly. Routing in circuit-switched networks: optimization, shadow prices and decentralization. Adv. Appl. Prob., (20), March 1988.
P. Lin, B. Leon, and C. Stewart. Analysis of circuit switched networks employing originating-office control with spill-forward. IEEE Trans. Commun., COM- 26 (6): 754–765, June 1978.
J. Mckenna and D. Mitra. Asymptotic expansions and integral representations of moments of queue lengths in closed Markovian networks. J. Assoc. Comput. Mach., 31 (2): 346–360, April 1984.
D. Mitra. Blocking and routing in circuit-switched networks. In O. J. Boxma, editor, Proc. International Seminar on Teletraffic Analysis and Computer Performance Evaluation, North-Holland, 1986.
E. Pinsky. Ensemble averaging: a new approximation technique in the performance analysis of large-scale systems. 1988. Submitted to the Journal of Performance Evaluation.
E. Pinsky and C. Binney. An overview of poly-bcmp: a software package for fast performance analysis of large communication networks. In Proc. 2nd IEEE Workshop on Computer-Aided Design, Analyzing & Modeling of Computer Networks & Links, IEEE, 1988. Amherst, Mass.
E. Schroedinger. Statistical Thermodynamics. University Press, Cambridge, England, 1948.
K. Terplan. Communication Networks Management. Prentice-Hall, 1987.
W. Wang and E. Pinsky. An asymptotic analysis of complete sharing policy. In Proc. INFOCOM’89, IEEE, April 1989. Presented in Ottawa, Canada.
W. Wang and E. Pinsky. ‘Pricing’ in a completely shared resource environment. In Proc. SICON ’89, IEEE Singapore Section, July 1989. Presented in Singapore.
W. Whitt. Blocking when service is required from several facilities simultaneously. Bell Syst Tech. J., 64 (8): 1807–1856, October 1985
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1990 Plenum Press, New York
About this chapter
Cite this chapter
Wang, Wh., Pinsky, E. (1990). The Application of the Partition Function in “Revenue-Oriented” Performance Analysis for Network Management. In: Kershenbaum, A., Malek, M., Wall, M. (eds) Network Management and Control. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-1471-4_26
Download citation
DOI: https://doi.org/10.1007/978-1-4613-1471-4_26
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4612-8779-7
Online ISBN: 978-1-4613-1471-4
eBook Packages: Springer Book Archive