Abstract
Video applications, such as video-on-demand systems, in general have bandwidth and delay constraints. Such QoS requirements can no longer be guaranteed when video is transmitted with the traditional shortest-path routing over a bandwidth-limited network such as the Internet. We propose multipath routing algorithms for video unicast so as to meet a certain bandwidth requirement with minimum start-up delay (and hence low user buffer requirement). We first formulate the problem which in its most general form is difficult to solve. However, for the special case where the network links are of unit capacity, we present an exact solution using a k-shortest-disjoint paths algorithm with video rescheduling in the source. For the most general case, we propose an efficient heuristic based on max-flow and shortest path algorithms. The complexity of such an algorithm is only O(|V|/sup 3/), where |V| is the number of nodes in the network. Extensive simulation results show that the multipath approach meets the bandwidth requirement with a delay close to that of shortest-path routing.
Sign-in/Register to access full text options 
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.
