Dynamic congestion-based pricing of bandwidth and buffer

Authors:
Nan Jin;Gayathri Venkitachalam;Scott Jordan
Affiliations:
Department of Electrical Engineering and Computer Science, University of California, Irvine, CA;Department of Electrical Engineering and Computer Science, University of California, Irvine, CA;Department of Electrical Engineering and Computer Science, University of California, Irvine, CA
Venue:
IEEE/ACM Transactions on Networking (TON)
Year:
2005

Citing 22
Cited 3

Asymptotic analysis of a data-handling system with many sources

SIAM Journal on Applied Mathematics
Effective bandwidth of general Markovian traffic sources and admission control of high speed networks

IEEE/ACM Transactions on Networking (TON)
A histogram-based model for video traffic behavior in an ATM multiplexer

IEEE/ACM Transactions on Networking (TON)
A new approach to service provisioning in ATM networks

IEEE/ACM Transactions on Networking (TON)
On the self-similar nature of Ethernet traffic (extended version)

IEEE/ACM Transactions on Networking (TON)
Charging and accounting for bursty connections

Internet economics
Best-effort versus reservations: a simple comparative analysis

Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Effective bandwidths with priorities

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

IEEE/ACM Transactions on Networking (TON)
Equilibrium bandwidth and buffer allocations for elastic traffics

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

IEEE/ACM Transactions on Networking (TON)
Measurement-based admission control with aggregate traffic envelopes

IEEE/ACM Transactions on Networking (TON)
Internet pricing with a game theoretical approach: concepts and examples

IEEE/ACM Transactions on Networking (TON)
Traffic equivalence and substitution in a multiplexer with applications to dynamic available capacity estimation

IEEE/ACM Transactions on Networking (TON)
Utility-based rate control in the Internet for elastic traffic

IEEE/ACM Transactions on Networking (TON)
Optimal pricing for multiple services in telecommunications networks offering quality-of-service guarantees

IEEE/ACM Transactions on Networking (TON)
The effect of bandwidth and buffer pricing on resource allocation and QoS

Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Internet economics: Pricing and policies
On the relevance of time scales in performance oriented traffic characterizations

INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
Management of service level agreements for multimedia Internet service using a utility model

IEEE Communications Magazine
Convexity properties of loss and overflow functions

Operations Research Letters
A new approach for allocating buffers and bandwidth to heterogeneous, regulated traffic in an ATM node

IEEE Journal on Selected Areas in Communications
Pricing congestible network resources

IEEE Journal on Selected Areas in Communications

On the feasibility of dynamic congestion-based pricing in differentiated services networks

IEEE/ACM Transactions on Networking (TON)
The practical performance of subgradient computational techniques for mesh network utility optimization

NET-COOP'07 Proceedings of the 1st EuroFGI international conference on Network control and optimization
Fast track article: A metric and framework for measuring information utility in mission-oriented networks

Pervasive and Mobile Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider pricing of network resources in a reservation-based quality-of-service architecture. The pricing policy implements a distributed resource allocation to provide guaranteed bounds on packet loss and end-to-end delay for real-time applications. Distributed pricing roles are assigned to each user, each network node, and an arbitrager in between the user and the network. When delay constraints are not binding, we investigate two dynamic pricing algorithms using gradient projection and Newton's method to update prices, and prove their convergence. We analyze the performance of the dynamic pricing policies and show that the gradient algorithm using Newton's method converges more quickly and displays only a few small fluctuations. When delay constraints are binding, we investigate subgradient methods which can provide convergence to some range of the optimal allocation.