1 / 34

Coordinate Live Streaming and Storage Sharing for Social Media Content Distribution

Coordinate Live Streaming and Storage Sharing for Social Media Content Distribution. Authors: Xu Cheng, Jiangchuan Liu , Senior Member, IEEE , Haiyang Wang, and Chonggang Wang , Senior Member, IEEE. Speaker : 童耀民 MA1G0222. 2013.12.23. Outline. INTRODUCTION MEASUREMENT STUDY

Download Presentation

Coordinate Live Streaming and Storage Sharing for Social Media Content Distribution

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Coordinate Live Streaming and Storage Sharing for Social Media Content Distribution Authors:Xu Cheng, Jiangchuan Liu, Senior Member, IEEE, HaiyangWang, and Chonggang Wang, Senior Member, IEEE Speaker :童耀民 MA1G0222 2013.12.23

  2. Outline • INTRODUCTION • MEASUREMENT STUDY • USER QUESTIONNAIRE SURVEY • COOLS SYSTEM OVERVIEW • COOLS DESIGN DETAILS • IMPROVING COOLS OVERLAY TREE • PERFORMANCE EVALUATION • CONCLUSION AND FUTURE WORK

  3. 1.INTRODUCTION

  4. INTRODUCTION • The recently emerged user-generated contents (UGC) services, social networking services (SNS), as well as the pervasive wireless mobile network services have formed social media which has drastically changed the content distribution landscape.

  5. INTRODUCTION • Today such UGC applications as YouTube allow any user to be a content provider, generating enormous amount of video contents that are quickly and extensively propagated on the Internet through such SNSes as Facebook and Twitter.

  6. INTRODUCTION • Unfortunately, the sheer and ever-increasing data volume, the broader coverage, and longer access durations of video objects also present significant challenges than other types of objects, not only to the social networking website management, but also to the network traffic engineering and to the resource provisioning of external video sites.

  7. INTRODUCTION • To better understand the challenges and opportunities therein, they investigate the social networking users’ behavior from both system traces and a questionnaire survey.

  8. INTRODUCTION

  9. INTRODUCTION • Through the posting function of social networking services, the server can broadcast the live video to the user’s friends, who can be either wired Internet users or mobile users. • 1)a friend can choose to watch the live video, and thus the requirement of streaming quality, such as startup latency and playback continuity, should be satisfied;

  10. INTRODUCTION • 2) a friend can choose not towatch the live video, but she or he can download the video and expect to watch it later. • 3) a friend shows no interest in the video.

  11. INTRODUCTION • In this paper, they present Coordinated Live Streaming and Storage Sharing (COOLS), a system for efficient peer-to-peer posting of user-generated videos. • Through a novel ID code design that embeds nodes’ locations in a tree overlay. • They also improve our overlay tree to achieve better efficiency and robustness.

  12. 2.MEASUREMENT STUDY

  13. MEASUREMENT STUDY • Fig. 2. Number of watched and shared videos against rank.

  14. MEASUREMENT STUDY • Fig. 3. CDF of time span from post to watch.

  15. 3.USER QUESTIONNAIRE SURVEY

  16. USER QUESTIONNAIRE SURVEY • Fig. 4. Breakdown of user’s concern on videos.

  17. USER QUESTIONNAIRE SURVEY • Fig. 5. Comparison of the possibility of watching the entire video.

  18. 4.COOLS SYSTEM OVERVIEW

  19. COOLS SYSTEM OVERVIEW • Fig. 6. Example of overlay tree with ID.

  20. 5.COOLS DESIGN DETAILS

  21. COOLS DESIGN DETAILS

  22. COOLS DESIGN DETAILS

  23. COOLS DESIGN DETAILS Fig. 8. Example of node demotion.

  24. 6.IMPROVING COOLS OVERLAY TREE

  25. IMPROVING COOLS OVERLAY TREE • We present a novel improved overlay tree structure: if the root node has children , then the nodes at depth have at most children, and the tree height is no greater than .

  26. IMPROVING COOLS OVERLAY TREE Fig. 9. Example of improved overlay tree.

  27. IMPROVING COOLS OVERLAY TREE • To understand this, we assume a complete tree in which the root has 4children, and thus there are at most20 nodes and the tree height is 3 . • Given that a complete tree in which the root nodehas children, there are nodes at depth 1, nodes at depth 2, and so on.

  28. IMPROVING COOLS OVERLAY TREE source Root 4=2k; k=2 Root Root Root Root d1 d1 d1 d1 d1 d1 d1 d1 d2 d2 d2 d2 d2 d2 d2 d2

  29. 7.PERFORMANCE EVALUATION

  30. PERFORMANCE EVALUATION Fig. 10. CDF of startup delay.

  31. PERFORMANCE EVALUATION Fig. 11. CDF of data loss rate

  32. PERFORMANCE EVALUATION Fig. 12. Comparison of overhead size

  33. 8. CONCLUSION AND FUTURE WORK

  34. CONCLUSION AND FUTURE WORK • Thanks.

More Related