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

Smoothed functional and Quasi-Newton algorithms for routing in multi-stage queueing network with constraints

Lakshmanan, K and Bhatnagar, Shalabh (2011) Smoothed functional and Quasi-Newton algorithms for routing in multi-stage queueing network with constraints. In: ICDCIT'11 Proceedings of the 7th international conference on Distributed Computing and Internet Technology, 2011, Heidelberg.

Full text not available from this repository. (Request a copy)
Official URL: http://dx.doi.org/10.1007/978-3-642-19056-8_12

Abstract

We consider the problem of optimal routing in a multi-stage network of queues with constraints on queue lengths. We develop three algorithms for probabilistic routing for this problem using only the total end-to-end delays. These algorithms use the smoothed functional (SF) approach to optimize the routing probabilities. In our model all the queues are assumed to have constraints on the average queue length. We also propose a novel quasi-Newton based SF algorithm. Policies like Join Shortest Queue or Least Work Left work only for unconstrained routing. Besides assuming knowledge of the queue length at all the queues. If the only information available is the expected end-to-end delay as with our case such policies cannot be used. We also give simulation results showing the performance of the SF algorithms for this problem.

Item Type: Conference Paper
Additional Information: Copyright of this article belongs to Springer Berlin Heidelberg.
Department/Centre: Division of Electrical Sciences > Computer Science & Automation
Depositing User: Id for Latest eprints
Date Deposited: 18 Mar 2013 10:29
Last Modified: 18 Mar 2013 10:29
URI: http://eprints.iisc.ac.in/id/eprint/46019

Actions (login required)

View Item View Item