The Optimal Control of Heterogeneous Queueing Systems: A Paradigm for Load-Sharing and Routing
IEEE Transactions on Computers
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
Optimal state-free, size-aware dispatching for heterogeneous M/G/-type systems
Performance Evaluation - Performance 2005
Analysis of size interval task assignment policies
ACM SIGMETRICS Performance Evaluation Review
Performance Evaluation
| Hi-index | 0.00 |
This paper describes a routing algorithm that assigns each arriving packet to one of several homogeneous parallel servers. The algorithm differs from existing routing policies in that it considers the impact of each arriving packet's size on the average packet delay. It is derived from mimic optimal routing, which mimics the behavior of numerical solutions to a packet assignment problem. It works under the condition that inter-arrival-time and packet-size distributions are unknown, but some possible candidates are known in advance. The algorithm calculates statistics, such as means of these distributions, from input traffic, so it provides not only good performance under stationary input traffic but also adaptive behavior under dynamic input traffic, where the distributions change with time.