Congestion-dependent pricing of network services

We consider a service provider (SP) who provides access to a communication network or some other form of on-line services. Users initiate calls that b elong to a set of diverse service classes, differing in resource requiremen ts, demand pattern, and call duration. The SP charges a fee per call, which can depend on the current congestion level, and which affects users' deman d for calls. We provide a dynamic programming formulation of the problems o f revenue and welfare maximization, and derive some qualitative properties of the optimal solution. We also provide a number of approximate approaches , together with an analysis that indicates that near-optimality is obtained for the case of many, relatively small, users. In particular, we show anal ytically as well as computationally, that the performance of an optimal pri cing strategy is closely matched by a suitably chosen static price, which d oes not depend on instantaneous congestion. This indicates that the easily implementable time-of-day pricing will often suffice. Throughout, we compar e the alternative formulations involving revenue or welfare maximization, r espectively, and draw some qualitative conclusions.