Pricing and Design of Differentiated Services: Approximate Analysis and Structural Insights

We consider a model of a service system that delivers two nonsubstitutable services to a market of heterogenous users. The first service is delivered subject to a "guaranteed" (G) processing rate, and the second is a "best-effort" (BE) type service in which residual capacity not allocated to the guaranteed class isshared among BE users. Users, in turn, are sensitive to both price and congestion-related effects. The service provider's objective is to optimally design the system so as to extract maximum revenues. The design variables in this problem consist of a pair of static prices for the two services, a policy that controls admission of G users into the system, and the mechanism by which users are informed of the state of congestion in the system. Because these objectives are difficult to address using exact analysis, we pursue approximations that are tractable and lead to structural insights. Specifically, we first solve a deterministic relaxation of the original objective to obtain a "fluid-optimal" solution that is subsequently evaluated and refined to account for stochastic fluctuations. Using diffusion limits, we derive approximations that yield the following structural results: (1) pricing rules derived from the deterministic analysis are "almost" optimal, (2) the optimal operational regime for the system is close to heavy traffic, and (3) real-time congestion notification results in increased revenues. Numerical results illustrate the accuracy of the proposed approximations and validate the aforementioned structural insights.

[1]  G. Ryzin,et al.  Optimal dynamic pricing of inventories with stochastic demand over finite horizons , 1994 .

[2]  Ward Whitt,et al.  Heavy-Traffic Limits for Queues with Many Exponential Servers , 1981, Oper. Res..

[3]  Constantinos Maglaras,et al.  Diffusion Approximations for a Multiclass Markovian Service System with "Guaranteed" and "Best-Effort" Service Levels , 2004, Math. Oper. Res..

[4]  Constantinos Maglaras,et al.  Decision , Risk and Operations Working Papers Series Contact Centers with a CallBack Option and Real-Time Delay Information , 2004 .

[5]  W. Whitt STOCHASTIC MODELS FOR THE DESIGN AND MANAGEMENT OF CUSTOMER CONTACT CENTERS : SOME RESEARCH DIRECTIONS , 2002 .

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

[7]  Ward Whitt,et al.  How Multiserver Queues Scale with Growing Congestion-Dependent Demand , 2003, Oper. Res..

[8]  D. W. Stroock,et al.  Multidimensional Diffusion Processes , 1979 .

[9]  Jeffrey I. McGill,et al.  Revenue Management: Research Overview and Prospects , 1999, Transp. Sci..

[10]  H. Kushner,et al.  Admission Control for Combined Guaranteed Performance and Best Effort Communications Systems Under Heavy Traffic , 1999 .

[11]  Brian E. Carpenter,et al.  Differentiated services in the Internet , 2002, Proc. IEEE.

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

[13]  E. Perkins,et al.  9. Markov Processes, Characterization and Convergence , 1988 .

[14]  Eitan Altman,et al.  Bandwidth allocation for guaranteed versus best effort service categories , 2000, Queueing Syst. Theory Appl..

[15]  Rami Atar,et al.  Scheduling a multi class queue with many exponential servers: asymptotic optimality in heavy traffic , 2004, math/0407058.

[16]  Ward Whitt,et al.  Understanding the Efficiency of Multi-Server Service Systems , 1992 .

[17]  M. Reiman,et al.  The multiclass GI/PH/N queue in the Halfin-Whitt regime , 2000, Advances in Applied Probability.

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

[19]  R. Srikant,et al.  Diffusion approximations for a single node accessed by congestion-controlled sources , 2000, IEEE Trans. Autom. Control..

[20]  J. Michael Harrison,et al.  Dynamic Scheduling of a Multiclass Queue in the Halfin-Whitt Heavy Traffic Regime , 2004, Oper. Res..

[21]  T. M. Williams Nonpreemptive Multi-Server Priority Queues , 1980 .

[22]  Avishai Mandelbaum,et al.  Telephone Call Centers: Tutorial, Review, and Research Prospects , 2003, Manuf. Serv. Oper. Manag..

[23]  A. Stolyar,et al.  Heavy tra c limits for a mobile phone system loss model , 1994 .

[24]  S. Ethier,et al.  Markov Processes: Characterization and Convergence , 2005 .

[25]  Richard H. Davis Waiting-Time Distribution of a Multi-Server, Priority Queuing System , 1966, Oper. Res..

[26]  R. Srikant,et al.  Revenue-maximizing pricing and capacity expansion in a many-users regime , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[27]  Avishai Mandelbaum,et al.  Designing a Call Center with Impatient Customers , 2002, Manuf. Serv. Oper. Manag..

[28]  John N. Tsitsiklis,et al.  Congestion-dependent pricing of network services , 2000, TNET.

[29]  Constantinos Maglaras,et al.  Pricing and Capacity Sizing for Systems with Shared Resources: Approximate Solutions and Scaling Relations , 2003, Manag. Sci..

[30]  R. M. Loynes,et al.  The stability of a queue with non-independent inter-arrival and service times , 1962, Mathematical Proceedings of the Cambridge Philosophical Society.

[31]  ArmonyMor,et al.  On Customer Contact Centers with a Call-Back Option , 2004 .

[32]  J. Dshalalow Advances in Queueing Theory, Methods, and Open Problems , 1995 .

[33]  Constantinos Maglaras Pricing and Performance Analysis for a System with Differentiated Services and Customer Choice , 2003 .

[34]  Richard J. Gibbens,et al.  Resource pricing and the evolution of congestion control , 1999, at - Automatisierungstechnik.

[35]  Constantinos Maglaras,et al.  On Customer Contact Centers with a Call-Back Option: Customer Decisions, Routing Rules, and System Design , 2004, Oper. Res..

[36]  W. Whitt,et al.  PIECEWISE-LINEAR DIFFUSION PROCESSES , 1995 .

[37]  W. Whitt,et al.  Improving Service by Informing Customers About Anticipated Delays , 1999 .