Nothing Special   »   [go: up one dir, main page]

skip to main content
article

On the feasibility of dynamic congestion-based pricing in differentiated services networks

Published: 01 October 2008 Publication History

Abstract

Differentiated services can ensure that traffic on some codepoints receives higher quality of service (QoS) than traffic on other codepoints, but without additional mechanisms it cannot target any particular QoS. Congestion-based pricing has been suggested as a method to target QoS in other network architectures. Here, we investigate whether congestion-based pricing can be used to control aggregate traffic into each codepoint by motivating users to choose the codepoints appropriate for each application. We first ask what information needs to be exchanged; we assert that both price and QoS information must be available for users to make decisions. We then ask how effective congestion-based pricing in diffServ can be; we find that it is feasible only for networks with sufficiently high bandwidth to guarantee that QoS can be quickly measured.

References

[1]
R. Cocchi, D. Estrin, S. Shenker, and L. Zhang, "Pricing in computer networks: Motivation, formulation, and example," IEEE/ACM Trans. Netw., vol. 1, no. 6, pp. 614-627, Dec. 1993.
[2]
A. Odlyzko, "Paris metro pricing for the internet," in Proc. ACM Conf. Electronic Commerce (EC'99), 1999, pp. 140-147.
[3]
C. Courcoubetis and V. Siris, "Managing and pricing service level agreements for differentiated services," in 7th Int. Workshop on QoS, 1999, pp. 165-173.
[4]
P. Marbach, "Pricing priority classes in a differentiated services network," presented at the Allerton Conf. Communication, Control, and Computing, Monticello, IL, 1999.
[5]
A. Orda and N. Shimkin, "Incentive pricing in multiclass systems," Telecommun. Syst., vol. 13, pp. 241-267, 2000.
[6]
P. Marbach, "Pricing differentiated services networks: Bursty traffic," in Proc. IEEE INFOCOM, 2001, pp. 650-658.
[7]
J. Altmann, H. Daanen, H. Oliver, and A. S.-B. Suárez, "How to market-manage a QoS network," in Proc. IEEE INFOCOM, 2002, pp. 284-293.
[8]
P. Marbach, "Priority service and max-min fairness," IEEE/ACM Trans. Netw., vol. 11, no. 5, pp. 733-746, Oct. 2003.
[9]
N. Semret, R. Liao, A. Campbell, and A. A. Lazar, "Pricing, provisioning and peering: Dynamic markets for differentiated internet services and implications for network interconnections," IEEE J. Sel. Areas Commun., vol. 18, no. 12, pp. 2499-2513, Dec. 2001.
[10]
E. W. Fulp and D. S. Reeves, "Optimal provisioning and pricing of differentiated services using QoS class promotion," in Proc. INFORMATIK: Workshop on Advanced Internet Charging and QoS Technology, 2001.
[11]
A. Gupta, D. O. Stahl, and A. B. Whinston, "Priority pricing of integrated services networks," Internet Economics, pp. 323-352, 1997.
[12]
L. He and J. Walrand, "Pricing differentiated Internet services," in Proc. IEEE INFOCOM, 2005, pp. 195-204.
[13]
K. Park, M. Sitharam, and S. Chen, "Quality of service provision in noncooperative networks: Heterogenous preferences, multi-dimensional QoS vectors, and burstiness," in Proc. Int. Conf. Information and Computation Economies, 1998, pp. 111-127.
[14]
J. K. MacKie-Mason and H. Varian, "Pricing congestible resources," IEEE J. Sel. Areas Commun., vol. 13, no. 7, pp. 1141-1149, Sep. 1995.
[15]
H. Jiang and S. Jordan, "The role of price in the connection establishment process," Eur. Trans. Telecommun., vol. 6, no. 4, pp. 421-429, Jul.-Aug. 1995.
[16]
C. Courcoubetis and R. Weber, Pricing Communication Networks: Economics, Technology, and Modelling. Hoboken, NJ: Wiley, 2003.
[17]
N. Jin, G. Venkitachalam, and S. Jordan, "Dynamic congestion-based pricing of bandwidth and buffer," IEEE/ACM Trans. Netw., vol. 13, no. 6, pp. 1233-1246, Dec. 2005.
[18]
F. Kelly, A. Maulloo, and D. Tan, "Rate control for communication networks: Shadow prices, proportional fairness and stability," J. Oper. Res. Soc., vol. 49, pp. 237-252, 1998.
[19]
S. Low and D. Lapsley, "Optimization flow control, i: Basic algorithm and convergence," IEEE/ACM Trans. Netw., vol. 7, no. 6, pp. 861-875, Dec. 1999.
[20]
R. J. La and V. Anantharam, "Utility-based rate control in the internet for elastic traffic," IEEE/ACM Trans. Netw., vol. 10, no. 2, pp. 272-286, Apr. 2002.
[21]
R. Srikant, The Mathematics of Internet Congestion Control. Cambridge, MA: Birkhauser, 2004.
[22]
T. Alpcan and T. Basar, "A globally stable adaptive congestion control scheme for Internet-style networks with delay," IEEE/ACM Trans. Netw., vol. 13, no. 6, pp. 1261-1274, Dec. 2005.
[23]
H. Yaiche, R. R. Maxumdar, and C. Rosenberg, "A game theoretic framework for bandwidth allocation and pricing in broadband networks," IEEE/ACM Trans. Netw., vol. 8, no. 5, pp. 667-678, Oct. 2000.
[24]
X.-R. Cao, H.-X. Shen, R. Milito, and P. Wirth, "Internet pricing with a game theoretical approach: Concepts and examples," IEEE/ACM Trans. Netw., vol. 10, no. 2, pp. 208-216, Apr. 2002.
[25]
J. Qiu and E. W. Knightly, "Measurement-based admission control with aggregate traffic envelopes," IEEE/ACM Trans. Netw., vol. 9, no. 2, pp. 199-210, Apr. 2001.
[26]
C. A. Courcoubetis, A. Dimakis, and G. D. Stamoulis, "Traffic equivalence and substitution in a multiplexer with applications to dynamic available capacity estimation," IEEE/ACM Trans. Netw., vol. 10, no. 2, pp. 217-231, Apr. 2002.
[27]
L. Breslau and S. Shenker, "Best-effort versus reservations: A simple comparative analysis," in SIGCOMM Symp. Communications Architectures and Protocols, 1998.
[28]
L.-T. Park, J.-W. Baek, and W.-K. J. Hong, "Management of service level agreements for multimedia Internet service using a utility model," IEEE Commun. Mag., vol. 39, no. 5, pp. 100-106, May 2001.
[29]
R. K. Sundaram, A First Course in Optimization Theory. Cambridge, U.K.: Cambridge Univ. Press, 1996.
[30]
J. Rosen, "Existence and uniqueness of equilibrium points for concave N-person games," Econometrica, vol. 33, pp. 520-534, 1965.
[31]
D. P. Bertsekas, Nonlinear Programming, 2nd ed. Belmont, MA: Athena Scientific, 1999.
[32]
K. Pawlikowski, "Steady-state simulation of queueing processes: A survey of problems and solutions," ACM Comput. Surv., vol. 22, no. 2, pp. 123-170, Jun. 1990.
[33]
G. S. Fishman and L. S. Yarberry, "An implementation of the batch means method," INFORMS J. Comput., vol. 9, pp. 296-310, 1997.

Cited By

View all
  • (2011)FIFO Service with Differentiated QueueingProceedings of the 2011 ACM/IEEE Seventh Symposium on Architectures for Networking and Communications Systems10.1109/ANCS.2011.29(122-133)Online publication date: 3-Oct-2011
  • (2011)Fuzzy enabled congestion control for Differentiated Services NetworksApplied Soft Computing10.1016/j.asoc.2011.05.01311:8(5457-5462)Online publication date: 1-Dec-2011

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image IEEE/ACM Transactions on Networking
IEEE/ACM Transactions on Networking  Volume 16, Issue 5
October 2008
238 pages

Publisher

IEEE Press

Publication History

Published: 01 October 2008
Revised: 03 September 2006
Received: 12 December 2005
Published in TON Volume 16, Issue 5

Author Tags

  1. differentiated services
  2. pricing
  3. quality of service (QoS)

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)2
  • Downloads (Last 6 weeks)0
Reflects downloads up to 24 Sep 2024

Other Metrics

Citations

Cited By

View all
  • (2011)FIFO Service with Differentiated QueueingProceedings of the 2011 ACM/IEEE Seventh Symposium on Architectures for Networking and Communications Systems10.1109/ANCS.2011.29(122-133)Online publication date: 3-Oct-2011
  • (2011)Fuzzy enabled congestion control for Differentiated Services NetworksApplied Soft Computing10.1016/j.asoc.2011.05.01311:8(5457-5462)Online publication date: 1-Dec-2011

View Options

Get Access

Login options

Full Access

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media