Abstract
Customers of bandwidth services can be divided into two distinct groups: those customers requesting bandwidth for the future and those desiring bandwidth immediately. We develop a dynamic network provisioning methodology that minimally satisfies the QoS (blocking probability) requirements for the ‘on—demand’ customers. Our method is sufficiently general and captures time varying trends in the demand for services as well as different bandwidth requests for the multiple classes of customers. This allows a network provider to be efficient in reserving excess bandwidth for forward contracts. Asymptotic results and bounds for the Erlang loss system are invoked to obtain simple approximate solutions to this bandwidth provisioning problem.
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.
Similar content being viewed by others
References
Courcoubetis, C.A. and Reiman, M.I. “Pricing in a Large Single Link Loss System,” Tele—traffic Engineering in a Competitive World, P Key and D. Smith (editors), Elsevier, pp. 737–746, 1999.
Erlang, A. K. “Solutions of Some Problems in the Theory of Probabilities of Significance in Automatic Telephone Exchanges,” The Post Office Electrical Engineers’ Journal; (from the 1917 article in Danish in Elektroteknikeren vol 13), pp. 189–197, 1918.
Jennings, O. B., Mandelbaum A., Massey, W. A., and Whitt, W. “Server Staffing to Meet Time—Varying Demand,” Management Science, pp. 1383–1394, 1996.
Hampshire, R. C, Massey, W. A., and Wang, Q. “Dynamic Pricing for On—Demand Bandwidth Services,” Bell Laboratories Technical Report, 2002
Jagerman, D. L. “Nonstationary Blocking in Telephone Traffic,” Bell System Technical Journal, pp. 625–661, 1975.
Jagerman, D. L. “Some Properties of the Erlang Loss Function,” The Bell System Technical Journal, pp. 525–551, 1974.
Kelly, F. P. “Reversibility and Stochastic Networks,” John Wiley & Sons Ltd., 1979.
Keon, N. and Anandalingam, G. “Real Time Pricing of Multiple Telecommunication Services Under Uncertain Demand,” Proceedings of the 7th International Conference on Telecommunication Systems, Modelling and Analysis, pp. 28–47, 1999.
Lanning, S., Massey, W. A., Rider, B. and Wang, Q. “Optimal Pricing in Queueing Systems with Quality of Service Constraints,” Proceedings of the 16th International Teletraffic Congress — ITC 16, pp. 747–756, 1999.
Massey, W. A. and Wallace, R. B. “An Asymptotic Optimal Design of the M/M/C/K Queue for Call Centers,” submitted in 2002 to the Selected Proceedings of the Council for African American Researchers in the Mathematical Sciences.
Massey, W. A. and Whitt, W. “An Analysis of the Modified Offered Load Approximation for the Nonstationary Erlang Loss Model,” Annals of Applied Probability, pp. 1145–1160, 1994.
Mitra, D. and Morrison, J. “Erlang Capacity and Uniform Approximations for Shared Unbuffered Resources,” IEEE/ACM Trans. Networking, pp. 558–570, 1994.
Reiman, M. I. “A Critically Loaded Multiclass Erlang Loss System,” Queueing Systems, pp. 65–82, 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer Science+Business Media New York
About this chapter
Cite this chapter
Hampshire, R.C., Massey, W.A., Mitra, D., Wang, Q. (2003). Provisioning for Bandwidth Sharing and Exchange. In: Anandalingam, G., Raghavan, S. (eds) Telecommunications Network Design and Management. Operations Research/Computer Science Interfaces Series, vol 23. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-3762-2_11
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3762-2_11
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-5326-1
Online ISBN: 978-1-4757-3762-2
eBook Packages: Springer Book Archive