Optimal Measurement-based Pricing for an M/M/1 Queue

In this paper, we consider a system modelled as an M/M/1 queue. Jobs corresponding to different classes are sent to the queue and are characterized by a delay cost per unit of time and a demand function. Our goal is to design an optimal pricing scheme for the queue, where the total charge depends on both the mean delay at the queue and arrival rate of each customer. We also assume that those two values have to be (statistically) measured, introducing errors on the total charge that might avert jobs from using the system, and then decrease demand. This model can be applied in telecommunication networks, where pricing can be used to control congestion, and the network can be characterized by a single bottleneck queue; the throughput of each class would be determined through passive measurements while the delay would be determined through active measurements.

[1]  Jeffrey K. MacKie-Mason,et al.  Pricing Congestible Network Resources (Invited Paper) , 1995, IEEE J. Sel. Areas Commun..

[2]  Murali S. Kodialam,et al.  Runs based traffic estimator (RATE): a simple, memory efficient scheme for per-flow rate estimation , 2004, IEEE INFOCOM 2004.

[3]  Mary Baker,et al.  Nettimer: A Tool for Measuring Bottleneck Link Bandwidth , 2001, USITS.

[4]  Allen B. Downey.  Using pathchar to estimate Internet link characteristics , 1999, SIGCOMM '99.

[5]  Costas Courcoubetis,et al.  Pricing Communication Networks: Economics, Technology and Modelling (Wiley Interscience Series in Systems and Optimization) , 2003 .

[6]  Eitan Altman,et al.  Queuing analysis of simple FEC schemes for voice over IP , 2002, Comput. Networks.

[7]  Andrew B. Whinston,et al.  Estimating Internet Users' Demand Characteristics , 2001 .

[8]  Michael Devetsikiotis,et al.  An overview of pricing concepts for broadband IP networks , 2000, IEEE Communications Surveys & Tutorials.

[9]  Bruno Tuffin,et al.  Charging the Internet Without Bandwidth Reservation: An Overview and Bibliography of Mathematical Approaches , 2003, J. Inf. Sci. Eng..

[10]  Jean-Chrysostome Bolot,et al.  Characterizing End-to-End Packet Delay and Loss in the Internet , 1993, J. High Speed Networks.

[11]  Costas Courcoubetis,et al.  Pricing Communication Networks , 2003 .

[12]  Vern Paxson,et al.  End-to-end Internet packet dynamics , 1997, SIGCOMM '97.

[13]  Albert Y. Ha.  Optimal Pricing That Coordinates Queues with Customer-Chosen Service Requirements , 2001, Manag. Sci..

[14]  Costas Courcoubetis,et al.  Pricing communication networks - economics, technology and modelling , 2003, Wiley-Interscience series in systems and optimization.

[15]  Yasushi Masuda,et al.  Capacity Management in Decentralized Networks , 2002, Manag. Sci..

[16]  Vern Paxson,et al.  Measurements and analysis of end-to-end Internet dynamics , 1997 .

[17]  Haim Mendelson,et al.  Optimal Incentive-Compatible Priority Pricing for the M/M/1 Queue , 1990, Oper. Res..

[18]  Jan A. Van Mieghem,et al.  Price and Service Discrimination in Queueing Systems: Incentive-Compatibility of Gcμ Scheduling , 2000 .

[19]  H. Mendelson,et al.  User delay costs and internal pricing for a service facility , 1990 .

[20]  Leonard Kleinrock,et al.  Theory, Volume 1, Queueing Systems , 1975 .

[21]  Donald F. Towsley,et al.  Inferring TCP connection characteristics through passive measurements , 2004, IEEE INFOCOM 2004.

[22]  Luiz A. DaSilva,et al.  Pricing for QoS-enabled networks: A survey , 2000, IEEE Communications Surveys & Tutorials.

[23]  R. Whitner,et al.  On Active Measurements in QoS-Enabled IP Networks , 2002 .