Abstract

Aiming at the problems in service oriented real-time multimedia transmission, such as a long delay, frequent jitter and low reliability, this paper proposes LD-RPath algorithm LD/RPath estimates the dynamic data volume on service nodes and links through reasonable data volume approximation. And the data splitting technique is imported to convert the node delay into the edge delay. In the mean time, the reliability of nodes is considered as a coefficient of delay, so that the multimedia delivery problem is transformed into a conventional shortest path problem. The advantages of this algorithm are as follows. 1) The reliability is integrated into the edge weights reasonably, which guarantee the reliability in the choice of the shortest path. 2) The reasonable approximate of data reduces the problem's complexity. 3) Node split integrates node weights into edge weights.

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.