Publications

Detailed Information

A Revenue-Based Model for Making Resource Investment Decisions in IP Networks

DC Field Value Language
dc.contributor.authorJagannathan, Srinivasan-
dc.contributor.authorAltmann, Jorn-
dc.contributor.authorRhodes, Lee-
dc.date.accessioned2009-08-10T23:15:34Z-
dc.date.available2009-08-10T23:15:34Z-
dc.date.issued2003-03-
dc.identifier.citationIFIP/IEEE IM2003, Integrated Symposium on Integrated Network Management, Colorado Springs, March 2003en
dc.identifier.urihttps://hdl.handle.net/10371/6845-
dc.description.abstractCapacity 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. 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. 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.
en
dc.language.isoenen
dc.publisherIFIP/IEEE IM2003en
dc.subjectNetwork and Systems Monitoringen
dc.subjectInvestment Cycle,en
dc.subjectBusiness Process,en
dc.subjectNetworken
dc.subjectService Managementen
dc.titleA Revenue-Based Model for Making Resource Investment Decisions in IP Networksen
dc.typeConference Paperen
Appears in Collections:
Files in This Item:

Altmetrics

Item View & Download Count

  • mendeley

Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.

Share