Inside the New Coolstreaming: Principles, Measurements and Performance Implications

Li, B.; Xie, S.; Qu, Y.; Keung, G. Y.; Lin, C.; Liu, J.; Zhang, X.

doi:10.1109/infocom.2007.157

Cited by 106 publications

(194 citation statements)

References 9 publications

Supporting

Mentioning

189

Contrasting

Unclassified

Order By: Relevance

“…A Block Map (BM) is introduced to specify the availability of blocks at each peer [64]. The periodic exchange of BMs among peers enables them to locate the required blocks.…”

Section: Fs2youmentioning

confidence: 99%

Survey of Cloud-Based Content Sharing Research: Taxonomy of System Models and Case Examples

Sugawara

2017

IEICE Trans. Commun.

View full text Add to dashboard Cite

SUMMARY This paper illustrates various content sharing systems that take advantage of cloud's storage and computational resources as well as their supporting conventional technologies. First, basic technology concepts supporting cloud-based systems from a client-server to cloud computing as well as their relationships and functional linkages are shown. Second, the taxonomy of cloud-based system models from the aspect of multiple clouds' interoperability is explained. Interoperability can be categorized into provider-centric and client-centric scenarios. Each can be further divided into federated clouds, hybrid clouds, multi-clouds and aggregated service by broker. Third, practical cloud-based systems related to contents sharing are reported and their characteristics are discussed. Finally, future direction of cloud-based content sharing is suggested. key words : content sharing, client-server, shared storage, peer-to-peer, grid computing, cloud computing, object storage, interoperability, federated cloud, hybrid cloud, multi-cloud, aggregated service by broker, provider centric, client centric IntroductionDue to rapid advances of computers, communication devices, and communication networks, diverse and vast amounts of digital contents are exchanged over the Internet, enabling numerous users to enjoy the benefits of technology. To realize smooth and stress-free content provisioning, searching and retrieving, numerous content sharing systems and supporting technologies have been developed and implemented. Currently, cloud computing systems for content sharing, such as exchanging text messages, documents, photos, voice, music, and videos, are important in our daily life, and many interesting systems have been implemented over the Internet.According to an Internet traffic forecast issued by Cisco [1], global IP traffic in 2015 stands at 72.5 exabytes (EB) per month and will nearly triple by 2020, to reach 194.4 EB per month. On the other hand, the percentage of Content Delivery Network (CDN) traffic in global IP traffic is expected to grow rapidly. CDN traffic in 2015 stands at 23.9 EB per month which is about one third of global IP, will grow to 104.0 EB which is more than half of global IP. Cloud-based content sharing plays a major role of CDN, and its importance must be getting larger and larger in the next decade. However, the concept of cloud computing is rather vague even now, and its definition is partially controversial. Then, it is sometimes difficult even for the researchers in the computer and communications fields to truly understand the natures of numerous cloud-based content sharing systems working over the Internet. Thus we would like this survey to be some help for the researchers to organize their ideas or concepts on cloud-based content sharing systems.The rest of this paper is organized into four sections. In Sect. 2, some basic technology concepts supporting cloudbased systems from client-server to cloud computing, including their relationships and functional linkages, are shown. Section 3 int...

show abstract

“…A Block Map (BM) is introduced to specify the availability of blocks at each peer [64]. The periodic exchange of BMs among peers enables them to locate the required blocks.…”

Section: Fs2youmentioning

confidence: 99%

Survey of Cloud-Based Content Sharing Research: Taxonomy of System Models and Case Examples

Sugawara

2017

IEICE Trans. Commun.

View full text Add to dashboard Cite

show abstract

“…BAR Gossip [20] and Flightpath [19] focus on tolerating the presence of byzantine peers. In Coolstreaming [18], the content location is pushed while the actual content is pulled as in swarming systems. HEAP [9] accounts for peers heterogeneity by letting nodes dynamically adjust their contribution to gossip dissemination according to their capabilities.…”

Section: Related Workmentioning

confidence: 99%

“…More recently, gossip-based approaches have been extensively used in the context of streaming applications [18,20,34]. Some recent work [3] has demonstrated that epidemic live streaming algorithms can achieve nearly unbeatable rates and delays.…”

Section: Introductionmentioning

confidence: 99%

Pulp: An adaptive gossip-based dissemination protocol for multi-source message streams

Felber

Kermarrec

Leonini

et al. 2012

Peer-to-Peer Netw. Appl.

View full text Add to dashboard Cite

Gossip-based protocols provide a simple, scalable, and robust way to disseminate messages in large-scale systems. In such protocols, messages are spread in an epidemic manner. Gossiping may take place between nodes using push, pull, or a combination. Push-based systems achieve reasonable latency and high resilience to failures but may impose an unnecessarily large redundancy and overhead on the system. At the other extreme, pull-based protocols impose a lower overhead on the network at the price of increased latencies. A few hybrid approaches have been proposedtypically pushing control messages and pulling datato avoid the redundancy of high-volume content and single-source streams. Yet, to the best of our knowledge, no other system intermingles push and pull in a multiple-senders scenario, in such a way that data messages of one help in carrying control messages of the other and in adaptively adjusting its rate of operation, further reducing overall cost and improving both on delays and robustness. In this paper, we propose an efficient generic push-pull dissemination protocol, Pulp, which combines the best of both worlds. Pulp exploits the efficiency of push approaches, while limiting redundant messages and therefore imposing a low overhead, as pull protocols do. Pulp leverages the dissemination of multiple messages from diverse sources: by exploiting the push phase of messages to transmit information about other disseminations, Pulp enables an efficient pulling of other messages, which themselves help in turn with the dissemination of pending messages. We deployed Pulp on a cluster and on PlanetLab. Our results demonstrate that Pulp achieves an appealing trade-off between coverage, message redundancy, and propagation delay.

show abstract

“…As discussed in [22], different implementations lead to different start-up delays. Generally, efficient distribution process enables the peers grab chunks quickly when they first join the system.…”

Section: Comparison Of Start-up Delaysmentioning

confidence: 99%

Enabling broadcast of user-generated live video without servers

Liang

Liu

2011

Peer-to-Peer Netw. Appl.

View full text Add to dashboard Cite

We are witnessing the unprecedented popularity of User-GeneratedContent (UGC) on the Internet. While YouTube hosts pre-recorded video clips, in near future, we expect to see the emergence of UserGenerated Live Video, for which any user can create its own temporary live video channel from a webcam or a hand-held wireless device. Hosting a large number of UG live channels on commercial servers can be very expensive. Server-based solutions also involve various economic, copyright and content control issues between users and the companies hosting their content. In this paper, leveraging on the recent successes of P2P video streaming, we study the strategies for end users to directly broadcast their own live channels to a large number of audiences without resorting to any server support. The key challenge is that end users are normally bandwidth constrained and can barely send out one complete video stream to the rest of the world. Existing P2P streaming solutions cannot maintain a high level of user Quality-of-Experience (QoE) with such a highly constrained video source. We propose two strategies to address this challenge. We first propose a proactive-push based source-side scheduling algorithm to increase the scale of P2P broadcasts that can be driven by end users. We then propose a novel layered P2P streaming architecture that introduces peer playback delay differentiations to further boost end users' capability of driving large-scale video streaming. Through detailed packet-level simulations and PlanetLab experiments, we show that the proposed strategies enable a source with upload bandwidth slightly higher than the video streaming rate to stream video to tens of thousands of peers with premium quality of experience.

show abstract

Inside the New Coolstreaming: Principles, Measurements and Performance Implications

Cited by 106 publications

References 9 publications

Survey of Cloud-Based Content Sharing Research: Taxonomy of System Models and Case Examples

Survey of Cloud-Based Content Sharing Research: Taxonomy of System Models and Case Examples

Pulp: An adaptive gossip-based dissemination protocol for multi-source message streams

Enabling broadcast of user-generated live video without servers

Contact Info

Product

Resources

About