Fast heuristics for multi-path selection for multiple description encoded video streaming

In a previous work [A. C. Begen, et al., 2003], we proposed an optimal multi-path selection method for multiple description (MD) encoded video streaming. To do so, we first modelled multi-path streaming and then developed an expression, i.e., an objective (cost) function, that estimated average streaming distortion in terms of network statistics, media characteristics and application requirements. Naturally, the ultimate goal was to find the set of paths that minimized this cost function. However, finding such sets of paths turned out to be intractable in large topologies. Hence, in this paper, we provide a fast heuristics-based solution by exploiting the infrastructure features of the Internet. The simulations run over various random Internet topologies show that the proposed heuristic is able to find a good solution in a much shorter time than the brute-force approach. Particularly, this heuristic is best suited to such interactive multimedia applications as video-conferencing and VoIP, where multi-path computation is a time-critical process. In addition, it is also suitable for the clients whose processing power capabilities are limited.