ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

An optimal weighted-average congestion based pricing scheme for enhanced QoS, , LNCS 4882, 2007

Vemu, Koteswara Rao and Bhatnagar, Shalabh and Hemachandra, N (2007) An optimal weighted-average congestion based pricing scheme for enhanced QoS, , LNCS 4882, 2007. In: ICDCIT'07 Proceedings of the 4th international conference on Distributed computing and internet technology , Dec. 17-20, 2007, Heidelberg.

Full text not available from this repository. (Request a copy)
Official URL: http://dl.acm.org/citation.cfm?id=1782491&CFID=606...

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.

Item Type: Conference Paper
Publisher: Springer-Verlag Berlin
Additional Information: Copyright of this article belongs to Springer-Verlag Berlin.
Department/Centre: Division of Electrical Sciences > Computer Science & Automation
Date Deposited: 17 Oct 2011 10:24
Last Modified: 17 Oct 2011 10:24
URI: http://eprints.iisc.ac.in/id/eprint/41493

Actions (login required)

View Item View Item