DocumentCode
104490
Title
Self-Similar Traffic End-to-End Delay Minimization Multipath Routing Algorithm
Author
Donghyuk Han ; Jong-moon Chung
Author_Institution
Sch. of Electr. & Electron. Eng., Yonsei Univ., Seoul, South Korea
Volume
18
Issue
12
fYear
2014
fDate
Dec. 2014
Firstpage
2121
Lastpage
2124
Abstract
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.
Keywords
cooperative communication; game theory; telecommunication network routing; telecommunication traffic; average delay minimisation; average delay minimization; cooperative game algorithm; fractional Brownian motion traffic models; maximum delay minimisation; multipath routing algorithm; network delay; network traffic; self-similar traffic end-to-end delay minimization; traffic distribution ratio; Analytical models; Delays; Minimization; Multipath channels; Quality of service; Routing; Fractional Brownian motion (fBm); fractional Brownian motion; multipath routing; self-similar;
fLanguage
English
Journal_Title
Communications Letters, IEEE
Publisher
ieee
ISSN
1089-7798
Type
jour
DOI
10.1109/LCOMM.2014.2362747
Filename
6920012
Link To Document