Abstract
Capacity planning is a critical task in network management. It identifies how much capacity is needed to match future traffic demand. It directly affects customer satisfaction and revenues. In this work we present a network usage analysis tool called Dynamic Netvalue Analyzer (DNA), which helps alleviate a big problem that network engineers and marketing executives face— making optimal resource investment decisions. Marketing executives have to project customer growth while network engineers have to project traffic volume based on the entire customer population. DNA helps the prediction process by presenting actual network usage data from a business perspective, in a form that is useful to both network engineers and marketing executives. Using these projections, decisions on how to upgrade resources can be made. We show that information from DNA can be used to: (1) quantify revenue earned on each link, (2) quantify return-on-investment on performing a link upgrade, and (3) quantify the loss due to customer dissatisfaction when a link is not upgraded. We also illustrate how these formulations based on business information can be used to improve capacity planning decisions.
The original version of this chapter was revised: The copyright line was incorrect. This has been corrected. The Erratum to this chapter is available at DOI: 10.1007/978-0-387-35674-7_66
Chapter PDF
Similar content being viewed by others
Keywords
References
J. Altmann and L. Rhodes, “Dynamic Netvalue Analyzer - A Pricing Plan Modeling Tool for ISPs Using Actual Network Usage Data”, IEEE WECWIS2002, International Workshop on Advance Issues of E-Commerce and Web-Based Information Systems, 2002.
J. Case, K. McCloghrie, M. Rose and S. Waldbusser, “Protocol Operations for Version 2 of the Simple Network Management Protocol (SNMPv2)”, RFC 1905, 1996.
Y. Diao, J. L. Hellerstein, and S. Parekh, “A Business-Oriented Approach to the Design of Feedback Loops for Performance Management”, Distributed Operations and Management, 2001.
J. Hershberger and S. Suri, “Vickrey Prices and Shortest Paths: What is an Edge Worth?”, IEEE Symposium on Foundations of Computer Science, 2001.
J.Hershberger, S. Suri and A. Bhosle., “On the Difficulty of some Shortest Path Problems,” STACS, Berlin, 2003.
S. Keshav, “An Engineering Approach to Computer Networking: ATM Networks, the Internet, and the Telephone Network”, Addison-Wesley, 1997.
D. A. Menasce and V. A. F. Almeida, “Capacity Planning for Web Services: Metrics, Models, and Methods”, Prentice Hall PTR, 2002.
Opnet, http://www.opnet.com
T. Robertazzi, “Planning Telecommunication Networks”, Wiley-IEEE Press, February 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 IFIP International Federation for Information Processing
About this chapter
Cite this chapter
Jagannathan, S., Altmann, J., Rhodes, L. (2003). A Revenue-Based Model for Making Resource Investment Decisions in IP Networks. In: Goldszmidt, G., Schönwälder, J. (eds) Integrated Network Management VIII. IM 2003. IFIP — The International Federation for Information Processing, vol 118. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35674-7_25
Download citation
DOI: https://doi.org/10.1007/978-0-387-35674-7_25
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-5521-3
Online ISBN: 978-0-387-35674-7
eBook Packages: Springer Book Archive