Publication Type

Conference Proceeding Article

Version

publishedVersion

Publication Date

9-2003

Abstract

In this paper, we analyze a method that links Lagrange multipliers from a resource allocation problem to the problem of revenue or profit maximization. This technique, first proposed in the transportation science literature by [7] has important implications for telecommunication network pricing. Indeed, the framework provides a generalization of telecommunication resource allocation/shadow price-based schemes such as those of [6] and [9], in that it permits the optimization of the shadow prices themselves, through a computationally simple procedure. We analyze the extent to which revenue can be maximized on a network that uses shadow-price-based prices, and how to deal with cases of unbounded multipliers.

Keywords

bilevel program, congestion control, internet pricing, network equilibrium, proportional fairness, revenue maximization

Discipline

Numerical Analysis and Computation | OS and Networks

Research Areas

Intelligent Systems and Optimization

Areas of Excellence

Digital transformation

Publication

Proceedings of the 5th COST 264 International Workshop on Networked Group Communications, NGC 2003and 3rd International Workshop on Internet Charging and QoS Technologies, ICQT 2003, Munich, Germany, September 16-19

Volume

2816

First Page

342

Last Page

354

ISBN

9783540394051

Identifier

10.1007/978-3-540-39405-1_31

Publisher

Springer Verlag

City or Country

Cham

Share

COinS