Skip to main content

An Optimal Weighted-Average Congestion Based Pricing Scheme for Enhanced QoS

  • Conference paper
Distributed Computing and Internet Technology (ICDCIT 2007)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 4882))

Abstract

Pricing is an effective tool to control congestion and achieve quality of service (QoS) provisioning for multiple differentiated levels of service. In this paper, we consider the problem of pricing for congestion control in the case of a network of nodes under a single service class and multiple queues, and present a multi-layered pricing scheme. We propose an algorithm for finding the optimal state dependent price levels for individual queues, at each node. The pricing policy used depends on a weighted average queue length at each node. This helps in reducing frequent price variations and is in the spirit of the random early detection (RED) mechanism used in TCP/IP networks. We observe in our numerical results a considerable improvement in performance using our scheme over that of a recently proposed related scheme in terms of both throughput and delay performance. In particular, our approach exhibits a throughput improvement in the range of 34 to 69 percent in all cases studied (over all routes) over the above scheme.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. La, R.J., Anantharam, V.: Charge-sensitive TCP and rate control in the internet. In: Proc. of INFOCOM, vol. 3, pp. 1166–1175 (March 2000)

    Google Scholar 

  2. La, R.J., Anantharam, V.: Utility-based rate control in the internet for elastic traffic. IEEE/ACM Trans. Netw. 10(2), 272–286 (2002)

    Article  Google Scholar 

  3. Dube, P., Borkar, V.S., Manjunath, D.: Differential join prices for parallel queues: Social optimality, dynamic pricing algorithms and application to internet pricing. In: Proceedings of IEEE Infocom, N.Y., vol. 1, pp. 276–283 (2002)

    Google Scholar 

  4. Odlyzko, A.: Paris metro pricing for the internet. In: EC 1999. Proceedings of the ACM Conference on Electronic Commerce, pp. 140–147. ACM Press, N.Y. (1999)

    Chapter  Google Scholar 

  5. Borkar, V.S., Manjunath, D.: Charge-based control of diffserv-like queues. Automatica 40(12), 2043–2047 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  6. Tandra, R., Hemachandra, N., Manjunath, D.: Diffserv node with join minimum cost queue policy and multiclass traffic. Perform. Eval. 55(1-2), 69–91 (2004)

    Article  Google Scholar 

  7. Garg, D., Borkar, V.S., Manjunath, D.: Network pricing for QoS: A ’regulation’ appproach. In: Abed, E.H. (ed.) Advances in Control, Communication Networks, and Transportation Systems (in honour of Pravin Varaiya), pp. 137–157 (2005)

    Google Scholar 

  8. Vemu, K.R., Bhatnagar, S., Hemachandra, N.: Link-Route Pricing for Enhanced QoS. Technical Report 2007-8, Department of Computer Science and Automation, Indian Institute of Science, Bangalore (2007), http://archive.csa.iisc.ernet.in/TR/2007/8/

  9. Bhatnagar, S., Fu, M.C., Marcus, S.I., Wang, I.-J.: Two timescale simultaneous perturbation stochastic approximation using deterministic perturbation sequences. ACM Transactions on Modelling and Computer Simulation 13(2), 180–209 (2003)

    Article  Google Scholar 

  10. Carlson, D., Davies, E., Wang, Z., Blake, S., Black, M., Weiss, W.: An architecture for differential services. Technical Report RFC 2475, IETF (1998)

    Google Scholar 

  11. Floyd, S., Jacobson, V.: Random early detection gateways for congestion avoidance. IEEE/ACM Trans. Netw. 1(4), 397–413 (1993)

    Article  Google Scholar 

  12. Vaidya, R., Bhatnagar, S.: Robust optimization of random early detection. Telecommunication Systems 33(4), 291–316 (2006)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Tomasz Janowski Hrushikesha Mohanty

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Vemu, K.R., Bhatnagar, S., Hemachandra, N. (2007). An Optimal Weighted-Average Congestion Based Pricing Scheme for Enhanced QoS. In: Janowski, T., Mohanty, H. (eds) Distributed Computing and Internet Technology. ICDCIT 2007. Lecture Notes in Computer Science, vol 4882. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77115-9_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-77115-9_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-77112-8

  • Online ISBN: 978-3-540-77115-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics