Abstract
Postpaid billing systems in most cases are using offline charging methods to rate the calls. Since latency is an accepted property, the throughput can be lower than the capacity required to process peak-hour traffic in a real-time manner. In this paper we will give an efficient mathematical model to calculate the processing power while taking the maximum queue size and maximum record age constraints into consideration.
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
Anderson, G.L., Flockhart, A.D., Foster, R.H., Mathews, E.P.: Queue waiting time estimation (EP0899673) (August 2003)
Daigle, J.N.: Queueing Theory with Applications to Packet Telecommunication. Springer Science, University of Mississippi (2005)
Graves, S.C.: The application of queueing theory to continuous perishable inventory systems. Management Science 28(4) (April 1982)
Rajabi, A., Hormozdiari, F.: Time constraint m/m/1 queue (2006)
Rottembourg, B.: Call center scheduling (2002)
Schoenmeyr, T., Graves, S.C.: Strategic safety stocks in supply chains with capacity constraints (2009)
Shtivelman, Y.: Method for estimating telephony system-queue waiting time in an agent level routing environment (6898190) (May 2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Ary, B., Imre, S. (2011). Sizing of xDR Processing Systems. In: Szabó, R., Zhu, H., Imre, S., Chaparadza, R. (eds) Access Networks. AccessNets 2010. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 63. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20931-4_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-20931-4_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20930-7
Online ISBN: 978-3-642-20931-4
eBook Packages: Computer ScienceComputer Science (R0)