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

Vemu, Koteswara Rao ; Bhatnagar, Shalabh ; Hemachandra, N. (2007) An Optimal Weighted-Average Congestion Based Pricing Scheme for Enhanced QoS In: International Conference on Distributed Computing and Internet Technology, December 17-20, 2007, Bangalore, India.

Full text not available from this repository.

Official URL: http://doi.org/10.1007/978-3-540-77115-9_14

Related URL: http://dx.doi.org/10.1007/978-3-540-77115-9_14

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 or Workshop Item (Paper)
Source:Copyright of this article belongs to Springer Nature.
Keywords:Queue Length; Price Scheme; Congestion Control; Random Early Detection; Incoming Customer.
ID Code:116719
Deposited On:12 Apr 2021 07:27
Last Modified:12 Apr 2021 07:27

Repository Staff Only: item control page