Sharma, Diksha and Bhatnagar, Shalabh (2006) Optimal Parameterized Policies for Resource Allocation in Communication Networks. In: Proceedings of IEEE International Conference on Signal and Image Processing, , 2006, Hubli, Karnataka.
10.1.1.137.1857.pdf - Published Version
Restricted to Registered users only
Download (280Kb) | Request a copy
The problem of finding optimal parameterized feedback policies for dynamic bandwidth allocation in communication networks is studied. 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 two different classes of multilevel closed-loop feedback policies for the system and use a two-timescale simultaneous perturbation stochastic approximation (SPSA) algorithm to find optimal policies within each prescribed class. We study the performance of the proposed algorithm on a numerical setting and show performance comparisons of the two optimal multilevel closedloop policies with optimal open loop policies. We observe that closed loop policies of Class B that tune parameters for both the queues and do not have the constraint that the entire bandwidth be used at each instant exhibit the best results overall as they offer greater flexibility in parameter tuning. Index Terms — Resource allocation, dynamic bandwidth allocation in communication networks, two-timescale SPSA algorithm, optimal parameterized policies. I.
|Item Type:||Conference Paper|
|Keywords:||Terms—Resource allocation;dynamic bandwidth allocation in communication networks;two-timescale SPSA algorithm;optimal parameterized policies.|
|Department/Centre:||Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)|
|Date Deposited:||10 Nov 2011 05:38|
|Last Modified:||10 Nov 2011 05:38|
Actions (login required)