Achieving optimal revenues in dynamically priced network services with QoS guarantees

Authors:
Steven Shelford;Gholamali C. Shoja;Eric G. Manning
Affiliations:
Department of Computer Science, University of Victoria, Victoria, BC, Canada;Department of Computer Science, University of Victoria, Victoria, BC, Canada;Department of Computer Science, University of Victoria, Victoria, BC, Canada and Department of Electrical and Computer Engineering, University of Victoria, Victoria, BC, Canada
Venue:
Computer Networks: The International Journal of Computer and Telecommunications Networking
Year:
2007

Citing 9
Cited 0

Pricing in computer networks: reshaping the research agenda

ACM SIGCOMM Computer Communication Review
Interconnecting ISP Networks

IEEE Internet Computing
An empirical evaluation of wide-area internet bottlenecks

SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
A Modest Proposal for Preventing Internet Congestion

A Modest Proposal for Preventing Internet Congestion
Scalable resource reservation signaling in the internet

Scalable resource reservation signaling in the internet
Pricing and admission control for QoS-enabled internet

Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Internet economics: Pricing and policies
The impact of residential broadband traffic on Japanese ISP backbones

ACM SIGCOMM Computer Communication Review
Pricing Communication Networks: Economics, Technology and Modelling (Wiley Interscience Series in Systems and Optimization)

Pricing Communication Networks: Economics, Technology and Modelling (Wiley Interscience Series in Systems and Optimization)
An overview of pricing concepts for broadband IP networks

IEEE Communications Surveys & Tutorials

Quantified Score

Hi-index	0.00

Visualization

Abstract

We have previously proposed the use of dynamically priced network services to provide QoS guarantees within a network. End-to-end QoS can be achieved by concatenating several of these services, perhaps from different ISPs. In this paper we consider the problem of a single ISP determining the bandwidth to allocate to each service, and on which path, in order to maximize revenue while guaranteeing end-to-end QoS. No knowledge of demand functions is assumed. Optimal allocation of bandwidth to services is first considered, where services are assumed to be routed on predetermined paths. We define the Iterative Allocation Adjustment heuristic, based on the concepts of tatonnement, which, through simulation, is shown to achieve over 95% of the optimal revenue for an ISP. We also examine how to value the links in the network to identify rerouting possibilities, or possible routes for new services, in order to improve the revenue of an ISP.