A quantitative comparison of graph-based models for Internet topology
IEEE/ACM Transactions on Networking (TON)
Traffic Dispersion Strategies for Multimedia Streaming
FTDCS '01 Proceedings of the 8th IEEE Workshop on Future Trends of Distributed Computing Systems
Multiple Description Video Multicast in Wireless Ad Hoc Networks
BROADNETS '04 Proceedings of the First International Conference on Broadband Networks
Multi-path streaming: Optimization of load distribution
Performance Evaluation - Performance 2005
Multiple description video multicast in wireless ad hoc networks
Mobile Networks and Applications - Special issue: Recent advances in wireless networking
Disjoint multipath routing using colored trees
Computer Networks: The International Journal of Computer and Telecommunications Networking
On path selection and rate allocation for video in wireless mesh networks
IEEE/ACM Transactions on Networking (TON)
Asymptotically optimal load distribution for multipath streaming under fec
Probability in the Engineering and Informational Sciences
Description selection scheme for intermediate frame based multiple description video streaming
ICIAR'05 Proceedings of the Second international conference on Image Analysis and Recognition
| Hi-index | 0.00 |
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.