An algorithm for dynamic optimal bandwidth allocation in communication networks

Diksha Sharma, Shalabh Bhatnagar, Shyam ChakrabortyNOT 2006

Abstract

We study the problem of optimal bandwidth allocation in
\ncommunication networks. We consider a queueing model
\nwith two queues to which traffic from different competing
\nflows arrive. The queue length at the buffers is observed
\nevery T instants of time, on the basis of which a decision
\non the amount of bandwidth to be allocated to each buffer
\nfor the next T instants is made. We consider a class of
\nclosed-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.
BibTeX
@inproceedings{sharma2006algorithm,
  author = {Diksha Sharma and Shalabh Bhatnagar and Shyam Chakraborty},
  title = {{An algorithm for dynamic optimal bandwidth allocation in communication networks}},
  booktitle = {NOT},
  year = {2006},
}

Loading related content...

Figure