A Feasibility Study of Collaborative Stream Routing in Peer-to-Peer Multiparty Video Conferencing

• Published in: 2011 IEEE International Symposium on Multimedia pp. 233 - 240
• Main Authors: Han Zhao, Smilkov, D., Dettori, P., Nogima, J., Schaffa, F. A., Westerink, P., Chai Wah Wu
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01.12.2011
• Subjects: Bandwidth; bandwidth feasibility; collaborative stream routing; Delay; heuristic algorithm; Heuristic algorithms; multi-party video conferencing peer-to-peer; Partitioning algorithms; quality-of-service; Relays; Routing; Streaming media
• ISBN: 1457720159; 9781457720154
• DOI: 10.1109/ISM.2011.45

Video transmission in multiparty video conferencing is challenging due to the demanding bandwidth usage and stringent latency requirement. In this paper, we systematically analyze the problem of collaborative stream routing using one-hop forwarding assistance in a bandwidth constraint environment. We model the problem as a multi-source degree-constrained multicast tree construction problem, and investigate heuristic algorithms to construct bandwidth-feasible shared multicast trees. The contribution of this work is primarily two-fold: (1) we study the solution space of finding a feasible bandwidth configuration for stream routing in a peer-to-peer (P2P) setting, and propose two heuristic algorithms that can quickly produce a bandwidth-feasible solution, making them suitable for large-scale conference sessions, (2) we conduct an empirical study using a realistic dataset and show the effectiveness of our heuristic algorithms. Various QoS metrics are taken into account to evaluate the performance of our algorithms. Finally, we discuss open issues for further exploration. The feasibility study presented in this paper will shed light on the design and implementation of practical P2P multiparty video conferencing applications.