Dynamics of usage-priced communication networks: the case of a single bottleneck resource

Authors:
Youngmi Jin;George Kesidis
Affiliations:
Electrical Engineering and Computer Science and Engineering Departments, The Pennsylvania State University, PA;Electrical Engineering and Computer Science and Engineering Departments, The Pennsylvania State University, PA
Venue:
IEEE/ACM Transactions on Networking (TON)
Year:
2005

Citing 8
Cited 3

Matrix analysis

Matrix analysis
Parallel and distributed computation: numerical methods

Parallel and distributed computation: numerical methods
Analysis of the increase and decrease algorithms for congestion avoidance in computer networks

Computer Networks and ISDN Systems
Convergence rate and termination of asynchronous iterative algorithms

ICS '89 Proceedings of the 3rd international conference on Supercomputing
Optimization flow control—I: basic algorithm and convergence

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

IEEE/ACM Transactions on Networking (TON)
Computer Networking: A Top-Down Approach

Computer Networking: A Top-Down Approach
Optimization network flow control and price coordination with feedback: proposal of a new distributed algorithm

Computer Communications

Demand management for telecommunications services

Computer Networks: The International Journal of Computer and Telecommunications Networking
Wireless mesh networking games

GameNets'09 Proceedings of the First ICST international conference on Game Theory for Networks
A simple reputation model for BitTorrent-like incentives

GameNets'09 Proceedings of the First ICST international conference on Game Theory for Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we study end-user dynamics of communication networks employing usage-based pricing. We propose a generic network access mechanism in which users modify their access control parameter based on the quality of service they receive in order to maximize their net benefit. For the examples of users sharing access to a bandwidth resource via a single trunk with Erlang loss dynamics and for a differentiated services (diffserv) network, we study the equilibrium/fixed points and give analytical results on convergence assuming the network prices are fixed.