The representation of multistage interconnection networks in queuing models of parallel systems
Journal of the ACM (JACM)
On choosing a task assignment policy for a distributed server system
Journal of Parallel and Distributed Computing - Special issue on software support for distributed computing
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Ant colony optimization theory: a survey
Theoretical Computer Science
Numerical Optimization: Theoretical and Practical Aspects (Universitext)
Numerical Optimization: Theoretical and Practical Aspects (Universitext)
Analysis of join-the-shortest-queue routing for web server farms
Performance Evaluation
Adaptive Newton-based multivariate smoothed functional algorithms for simulation optimization
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Ant Colony Optimization Algorithms for Shortest Path Problems
Network Control and Optimization
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.00 |
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.