Nonlinear Quadratic Pricing for Concavifiable Utilities in Network Rate Control

This paper deals with a category of concavifiable functions that can be used to model inelastic traffic in the network. Such class of functions can be concavified within an interval of interest using a quadratic pricing term so that we obtain as a result a concave objective function. We use a game- theoretical framework as well as a centralized optimization approach to discuss the heterogeneous network with nonlinear quadratic pricing. We point out the equivalence between these two frameworks and use a Stackelberg player as an extra degree of freedom to design pricing policy for the network. In the end, we propose an auction-like iterative algorithm and illustrate it with a numerical example.

[1]  Ioana Manolescu,et al.  XMark: A Benchmark for XML Data Management , 2002, VLDB.

[2]  Dimitri P. Bertsekas,et al.  Network optimization : continuous and discrete models , 1998 .

[3]  Andrew T. Campbell,et al.  Peering and provisioning of differentiated Internet services , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[4]  Lacra Pavel,et al.  A noncooperative game approach to OSNR optimization in optical networks , 2006, IEEE Transactions on Automatic Control.

[5]  Steven H. Low,et al.  Optimization flow control—I: basic algorithm and convergence , 1999, TNET.

[6]  Jignesh M. Patel,et al.  The Michigan Benchmark: A Microbenchmark for XML Query Processing Systems , 2002, EEXTT.

[7]  P. Tseng,et al.  On the convergence of the coordinate descent method for convex differentiable minimization , 1992 .

[8]  Quanyan Zhu,et al.  Solving constrained OSNR Nash game in WDM optical networks with a fictitious player , 2007, 2007 Fourth International Conference on Broadband Communications, Networks and Systems (BROADNETS '07).

[9]  Frank Kelly,et al.  Rate control for communication networks: shadow prices, proportional fairness and stability , 1998, J. Oper. Res. Soc..

[10]  Eitan Altman,et al.  Generalized Nash Bargaining Solution for bandwidth allocation , 2006, Comput. Networks.

[11]  Catherine Rosenberg,et al.  A game theoretic framework for bandwidth allocation and pricing in broadband networks , 2000, TNET.

[12]  Massimo Franceschet.  XPathMark: An XPath Benchmark for the XMark Generated Data , 2005, XSym.

[13]  Michael L. Honig,et al.  Auction mechanisms for distributed spectrum sharing , 2004 .

[14]  Erhard Rahm,et al.  XMach-1: A Benchmark for XML Data Management , 2001, BTW.

[15]  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.

[16]  Jyh-Charn Liu,et al.  XML Document Parsing: Operational and Performance Characteristics , 2008, Computer.

[17]  Stéphane Bressan,et al.  XOO7: applying OO7 benchmark to XML query processing tool , 2001, CIKM '01.

[18]  Sanjo Zlobec,et al.  Characterization of convexifiable functions , 2006 .

[19]  Quanyan Zhu,et al.  End‐to‐end DWDM optical link power‐control via a Stackelberg revenue‐maximizing model , 2008, Int. J. Netw. Manag..

[20]  Ness B. Shroff,et al.  Non-convex optimization and rate control for multi-class services in the Internet , 2005, IEEE/ACM Transactions on Networking.

[21]  Tamer Basar,et al.  Optimal Nonlinear Pricing for a Monopolistic Network Service Provider with Complete and Incomplete Information , 2007, IEEE Journal on Selected Areas in Communications.

[22]  Tim Roughgarden,et al.  Bounding the inefficiency of equilibria in nonatomic congestion games , 2004, Games Econ. Behav..

[23]  M. Tamer Özsu,et al.  XBench benchmark and performance testing of XML DBMSs , 2004, Proceedings. 20th International Conference on Data Engineering.