Online pricing for bandwidth provisioning in multi-class networks

Authors:
Uday Savagaonkar;Edwin K. P. Chong;Robert L. Givan
Affiliations:
School of Electrical and Computer Engineering, Purdue University, West Lafayette, IN;Department of Electrical and Computer Engineering, Colorado State University, Fort Collins, CO;School of Electrical and Computer Engineering, Purdue University, West Lafayette, IN
Venue:
Computer Networks: The International Journal of Computer and Telecommunications Networking
Year:
2004

Citing 10
Cited 3

Optimization of queues using an infinitesimal perturbation analysis-based stochastic algorithm with general update times

SIAM Journal on Control and Optimization
A new approach to service provisioning in ATM networks

IEEE/ACM Transactions on Networking (TON)
Optimization flow control—I: basic algorithm and convergence

IEEE/ACM Transactions on Networking (TON)
Congestion-dependent pricing of network services

IEEE/ACM Transactions on Networking (TON)
A game theoretic framework for bandwidth allocation and pricing in broadband networks

IEEE/ACM Transactions on Networking (TON)
Dynamic Programming and Optimal Control

Dynamic Programming and Optimal Control
Markov Decision Processes: Discrete Stochastic Dynamic Programming

Markov Decision Processes: Discrete Stochastic Dynamic Programming
Neuro-Dynamic Programming

Neuro-Dynamic Programming
Rollout Algorithms for Stochastic Scheduling Problems

Journal of Heuristics
On-line sampling-based control for network queueing problems

On-line sampling-based control for network queueing problems

Pricing of risk for loss guaranteed intra-domain internet service contracts

Computer Networks: The International Journal of Computer and Telecommunications Networking
A game-theoretic model for capacity-constrained fair bandwidth allocation

International Journal of Network Management
Path-vector contracting: Profit maximization and risk management

Computer Networks: The International Journal of Computer and Telecommunications Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of pricing for bandwidth provisioning over a single link, where users arrive according to a known stochastic traffic model. The network administrator controls the resource allocation by setting a price at every epoch, and each user's response to the price is governed by a demand function. We formulate this problem as a partially observable Markov decision process (POMDP), and explore two novel pricing schemes--reactive pricing and spot pricing--and compare their performance to appropriately tuned flat pricing. We use a gradient-ascent approach in all the three pricing schemes. We provide methods for computing unbiased estimates of the gradient in an online (incremental) fashion. Our simulation results show that our novel schemes take advantage of the known underlying traffic model and significantly outperform the model-free pricing scheme of flat pricing.