Price dynamics of vertically differentiated information markets
Proceedings of the first international conference on Information and computation economies
Congestion-dependent pricing of network services
IEEE/ACM Transactions on Networking (TON)
Paris metro pricing for the internet
Proceedings of the 1st ACM conference on Electronic commerce
Dynamic pricing and congestion control for best-effort ATM services
Computer Networks: The International Journal of Computer and Telecommunications Networking
Dynamic pricing by software agents
Computer Networks: The International Journal of Computer and Telecommunications Networking - electronic commerce
A game theoretic framework for bandwidth allocation and pricing in broadband networks
IEEE/ACM Transactions on Networking (TON)
Internet pricing with a game theoretical approach: concepts and examples
IEEE/ACM Transactions on Networking (TON)
Multiservice Loss Models for Broadband Telecommunication Networks
Multiservice Loss Models for Broadband Telecommunication Networks
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Pricing strategies under heterogeneous service requirements
Computer Networks: The International Journal of Computer and Telecommunications Networking
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Management of IT services
Bandwidth provisioning and pricing for networks with multiple classes of service
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Internet economics: Pricing and policies
A mathematical model of the Paris metro pricing scheme for charging packet networks
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Internet economics: Pricing and policies
Pricing and admission control for QoS-enabled internet
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Internet economics: Pricing and policies
Non-convex optimization and rate control for multi-class services in the Internet
IEEE/ACM Transactions on Networking (TON)
Dynamics of usage-priced communication networks: the case of a single bottleneck resource
IEEE/ACM Transactions on Networking (TON)
Pricing differentiated services: a game-theoretic approach
Computer Networks: The International Journal of Computer and Telecommunications Networking
A mathematical analysis of the cumulus pricing scheme
Computer Networks and ISDN Systems
Fair and efficient dynamic bandwidth allocation for multi-application networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
IEEE Journal on Selected Areas in Communications
Pricing congestible network resources
IEEE Journal on Selected Areas in Communications
Fundamental design issues for the future Internet
IEEE Journal on Selected Areas in Communications
IEEE Network: The Magazine of Global Internetworking
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
In this paper we develop a novel method of controlling the demand in a multi-class, QoS-enabled network, using pricing and resource allocation for income maximisation. We first present a solution to the problem of calculating the optimal prices and QoS for a single link using a limiting regime approximation, which reduces the associated computational burden. A heuristic algorithm is then proposed that improves the limiting regime solution, achieving better results for links with small capacity. We further extend this approach to a multi-link network, where a distributed iterative algorithm is developed based on the solution of the single link model. Results from small and medium size networks show that, even when the assumptions we used do not hold, our approach yields results very close to the optimal ones (0.17-2.95% difference), which are computed by exhaustively searching in the decision space. Moreover, the calculation time using the proposed approach is approximately 1.5min for problems which took more than 240min to solve using exhaustive search.