An algorithm for dynamic optimal bandwidth allocation in communication networks

Sharma, Diksha and Bhatnagar, Shalabh and Chakraborty, Shyam (2006) An algorithm for dynamic optimal bandwidth allocation in communication networks. In: Proceedings of Fifth Asia Pacific International Symposium on Information Technology (APIS5), , 2006, Hangzhou, China.

PDF 10.1.1.128.1339.pdf - Published Version Restricted to Registered users only Download (139kB) | Request a copy

Abstract

We study the problem of optimal bandwidth allocation in communication networks. We consider a queueing model with two queues to which traffic from different competing flows arrive. The queue length at the buffers is observed every T instants of time, on the basis of which a decision on the amount of bandwidth to be allocated to each buffer for the next T instants is made. We consider a class of closed-loop feedback policies for the system and use a twotimescale simultaneous perturbation stochastic approximation(SPSA) algorithm to find an optimal policy within the prescribed class. We study the performance of the proposed algorithm on a numerical setting. Our algorithm is found to exhibit good performance.

Item Type:	Conference Paper
Keywords:	Resource allocation;dynamic bandwidth allocation in communication networks;two-timescale SPSA algorithm;optimal parameterized policies.
Department/Centre:	Division of Electrical Sciences > Electronic Systems Engineering (Formerly Centre for Electronic Design & Technology)
Date Deposited:	10 Nov 2011 05:42
Last Modified:	10 Nov 2011 05:42
URI:	http://eprints.iisc.ac.in/id/eprint/41967

Actions (login required)

View Item