Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
