A packet-size aware adaptive routing algorithm for parallel transmission server system

This paper describes a routing algorithm that assigns each arriving packet to one of multiple 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. The algorithm is based on mimic optimal routing, which was derived from numerical solutions to a packet assignment problem. It works under the condition that the inter-arrival time and packet-size distributions are unknown, but a distribution set to which these two distributions belong is known in advance. The algorithm calculates statistics, such as means of these distributions, from input traffic, so it works under dynamic input traffic, where such distributions vary with time