Transcasting: Cost-Efficient Video Multicast for Heterogeneous Mobile Terminals

This paper presents a cost-efficient video multicast method for live video streaming to heterogeneous mobile terminals over a content delivery network (CDN), where CDN consists of a video server, several proxies with wireless access points, and overlay links among the server and proxies. In this method, the original video sent from the server is converted into multiple versions with various qualities by letting proxies execute transcoding services based on the users' requirements, and delivered to mobile terminals along video delivery paths. To suppress the required computation and transfer costs in CDN, we propose an algorithm to calculate cost-efficient video delivery paths which minimizes the sum of the computation cost for proxies and the transfer cost on overlay links. Our basic idea for deriving cost-efficient delivery paths is to place transcoding service on different proxies in load-balancing manner, and to construct a minimal Sterner tree from all transcoding points of requested qualities. The overall goal of the placement is the balance between computation and transfer cost. Through simulations, we show that our algorithm can calculate more cost-efficient video delivery paths and achieve lower request rejections than other algorithms.

[1]  Helen J. Wang,et al.  Distributing streaming media content using cooperative networking , 2002, NOSSDAV '02.

[2]  Keiichi Yasumoto,et al.  Resource-aware service composition for video multicast to heterogeneous mobile users , 2005, MSC '05.

[3]  John G. Apostolopoulos,et al.  On multiple description streaming with content delivery networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[4]  Mostafa H. Ammar,et al.  On the use of destination set grouping to improve fairness in multicast video distribution , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[5]  Zheng Wang,et al.  An Architecture for Differentiated Services , 1998, RFC.

[6]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[7]  Ibrahim Matta,et al.  BRITE: an approach to universal topology generation , 2001, MASCOTS 2001, Proceedings Ninth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems.

[8]  David L. Black,et al.  An Architecture for Differentiated Service , 1998 .

[9]  Klara Nahrstedt,et al.  Distributed multimedia service composition with statistical QoS assurances , 2006, IEEE Transactions on Multimedia.

[10]  Tatsuya Suda,et al.  Source-adaptive multilayered multicast algorithms for real-time video distribution , 2000, TNET.

[11]  Steven McCanne,et al.  Receiver-driven layered multicast , 2001 .

[12]  Steven McCanne,et al.  Low-Complexity Video Coding for Receiver-Driven Layered Multicast , 1997, IEEE J. Sel. Areas Commun..

[13]  Helen J. Wang,et al.  Resilient peer-to-peer streaming , 2003, 11th IEEE International Conference on Network Protocols, 2003. Proceedings..

[14]  Weiping Li,et al.  Overview of fine granularity scalability in MPEG-4 video standard , 2001, IEEE Trans. Circuits Syst. Video Technol..

[15]  Mostafa H. Ammar,et al.  A comparison of layering and stream replication video multicast schemes , 2001, NOSSDAV '01.

[16]  Keiichi Yasumoto,et al.  MTcast: Robust and Efficient P2P-Based Video Delivery for Heterogeneous Users , 2005, OPODIS.

[17]  Zongpeng Li,et al.  sFlow: towards resource-efficient and agile service federation in service overlay networks , 2004, 24th International Conference on Distributed Computing Systems, 2004. Proceedings..

[18]  Klara Nahrstedt,et al.  Service composition for generic service graphs , 2006, Multimedia Systems.

[19]  Anees Shaikh,et al.  On the effectiveness of DNS-based server selection , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[20]  George Markowsky,et al.  A fast algorithm for Steiner trees , 1981, Acta Informatica.

[21]  Klara Nahrstedt,et al.  Layered peer-to-peer streaming , 2003, NOSSDAV '03.