Abstract

This paper studies the traffic allocation in multi-path routing in consideration of the strict requirement for delay variation in the real-time applications. Firstly, the queuing delay is analyzed based on network calculus and the upper bounds of end-to-end delay and its variation in all paths are deduced. Then the transfer rate of data flowing into each path should be used as constraint for satisfying end-to-end delay requirement, and the Maximum Allowed Rate (MAR) for each path is calculated. Based on MAR, a traffic allocation algorithm named as TADVO is proposed for delay variation optimization, in which the traffic is allocated proportional to MAR of each path. Finally, TADVO is integrated into AOMDV. The simulation shows that the new protocol outperforms the other two in terms of delay and delay variation.

Full Text
Paper version not known

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 call

Disclaimer: 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.