Public access to the Internet
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)
IEEE/ACM Transactions on Networking (TON)
BRITE: An Approach to Universal Topology Generation
MASCOTS '01 Proceedings of the Ninth International Symposium in Modeling, Analysis and Simulation of Computer and Telecommunication Systems
Call admission control and routing in integrated services networks using neuro-dynamic programming
IEEE Journal on Selected Areas in Communications
An optimization-based approach for QoS routing in high-bandwidth networks
IEEE/ACM Transactions on Networking (TON)
Integration of explicit effective-bandwidth-based QoS routing with best-effort routing
IEEE/ACM Transactions on Networking (TON)
Spot pricing of secondary spectrum access in wireless cellular networks
IEEE/ACM Transactions on Networking (TON)
Optimal pricing in a free market wireless network
Wireless Networks
The optimality of two prices: maximizing revenue in a stochastic communication system
IEEE/ACM Transactions on Networking (TON)
INFOCOM'10 Proceedings of the 29th conference on Information communications
Decentralized algorithms for adaptive pricing in multiclass loss networks
IEEE/ACM Transactions on Networking (TON)
Distributed resource allocation based on queue balancing in multihop cognitive radio networks
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
We show that when networks are large significant simplicity can be achieved for pricing-based control. We first consider a general loss network with Poisson arrivals and arbitrary holding time distributions. In dynamic pricing schemes, the network provider can charge different prices to the user according to the current utilization level of the network and also other factors. We show that when the system becomes large the performance (in terms of expected revenue) of an appropriately chosen static pricing scheme, whose price is independent of the current network utilization, will approach that of the optimal dynamic pricing scheme. Further, we show that under certain conditions, this static price is independent of the route that the flows take. We then extend the result to the case of dynamic routing, and show that the performance of an appropriately chosen static pricing scheme with bifurcation probability determined by average parameters can also approach that of the optimal dynamic routing scheme when the system is large. These results deepen our understanding of pricing-based network control. In particular, they provide us with the insight that, when the system is large, an appropriate pricing strategy based on the average network conditions (hence, slowly changing) can approach optimality.