Self-Similar Traffic End-to-End Delay Minimization Multipath Routing Algorithm

In this letter, a multipath routing algorithm to reduce end-to-end delay and loss rate is proposed. The proposed multipath routing algorithm, self-similar delay minimization (SDM), estimates network delay of realistic network traffic by analyzing self-similar parameters based on fractional Brownian motion (fBm) traffic models, computes the optimal number of paths for average delay minimization, and also derives an optimal traffic distribution ratio for multipath routing using a cooperative game algorithm. Simulation results show that the average end-to-end delay and loss rate performance can be significantly improved when using SDM compared to using the average delay minimisation (ADM) or maximum delay minimisation (MDM) multipath routing algorithms.