Priority pricing in utility fair networks

This paper deals with a new pricing approach in utility fair networks, where the user's application is associated with a utility function. We allow users to have concave as well as non-concave utility functions. Bandwidth is allocated such that utility values of applications are shared fairly. In this work, we derive a fairness measure for utility functions that takes their specific shape into account. Based on this fairness measure, we present a simple pricing mechanism: the user announces his utility function and the network charges in accordance with the fairness measure. Then, we apply our pricing mechanism to a content provider's network. In our model customers want to scale their utilities to achieve their goals (e.g. file download, multimedia streaming) in a cost optimal way. In this regard, we formulate a download problem with predefined, deadline as an optimal control problem and account for dynamic changes of the state of congestion by using (online) model predictive control techniques. Finally, we develop online control strategies and implement them in a user agent (UA) that automatically scales the utilities.

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

[2]  Jorge J. Moré,et al.  The NEOS Server , 1998 .

[3]  Fernando Paganini,et al.  Congestion control for high performance, stability, and fairness in general networks , 2005, IEEE/ACM Transactions on Networking.

[4]  Leandros Tassiulas,et al.  Fair allocation of utilities in multirate multicast networks: a framework for unifying diverse fairness objectives , 2002, IEEE Trans. Autom. Control..

[5]  Jean C. Walrand,et al.  Fair end-to-end window-based congestion control , 2000, TNET.

[6]  Robert J. Vanderbei,et al.  LOQO User’s Manual – Version 4.05 , 2006 .

[7]  Mung Chiang,et al.  Equilibrium of Heterogeneous Congestion Control Protocols , 2006 .

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

[9]  Fernando Paganini,et al.  Internet congestion control , 2002 .

[10]  P. Berck,et al.  Calculus of variations and optimal control theory , 1993 .

[11]  S. Shenker.  Fundamental Design Issues for the Future Internet , 1995 .

[12]  Ellen W. Zegura,et al.  Utility max-min: an application-oriented bandwidth allocation scheme , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[13]  Tobias Harks,et al.  Utility Proportional Fair Bandwidth Allocation: An Optimization Oriented Approach , 2005, QoS-IP.

[14]  Marko Bacic,et al.  Model predictive control , 2003 .

[15]  Fernando Paganini,et al.  A global stability result in network flow control , 2002, Syst. Control. Lett..

[16]  Andrew T. Campbell,et al.  A Utility-Based Approach for Quantitative Adaptation in Wireless Packet Networks , 2001, Wirel. Networks.

[17]  Ao Tang,et al.  Network equilibrium of heterogeneous congestion control protocols , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..