Enabling hierarchical dissemination of streams in content distribution networks

Pallickara, Shrideep; Fox, Geoffrey

doi:10.1002/cpe.1909

Cited by 4 publications

(2 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The problem of rapid data dissemination in complex heterogeneous network environments, such as peer‐to‐peer (P2P) networks , distributed systems , streaming systems , wireless networks , and the clouds , is now recognized as a key element in many real applications and Web services such as the acquisition of timely weather information, emergency responses (e.g., earthquake early warning ), information battlefields environment, news dissemination, complex distributed queries , and traffic‐condition broadcasts. In all these scenarios, the real data usually need to be sent to a large number of users as quickly as possible.…”

Section: Introductionmentioning

confidence: 99%

BLOR: An efficient bandwidth and latency sensitive overlay routing approach for flash data dissemination

Wang

et al. 2014

Concurrency and Computation

View full text Add to dashboard Cite

SUMMARYThe problem of flash data dissemination refers to transmitting time-critical data to a large group of distributed receivers in a timely manner, which widely exists in many mission-critical applications and Web services. However, existing approaches for flash data dissemination fail to ensure the timely and efficient transmission, because of the unpredictability of the dissemination process. Overlay routing has been widely used as an efficient routing primitive for providing better end-to-end routing quality by detouring inefficient routing paths in the real networks. To improve the predictability of the flash data dissemination process, we propose a bandwidth and latency sensitive overlay routing approach named BLOR, by optimizing the overlay routing and avoiding inefficient paths in flash data dissemination. BLOR tries to select optimal routing paths in terms of network latency, bandwidth capacity, and available bandwidth in nature, which has never been studied before. Additionally, a location-aware unstructured overlay topology construction algorithm, an unbiased top-k dominance model, and an efficient semi-distributed information management strategy are proposed to assist the routing optimization of BLOR. Extensive experiments have been conducted to verify the effectiveness and efficiency of the proposals with real-world data sets.

show abstract

Section: Introductionmentioning

confidence: 99%

BLOR: An efficient bandwidth and latency sensitive overlay routing approach for flash data dissemination

Wang

et al. 2014

Concurrency and Computation

View full text Add to dashboard Cite

show abstract

“…For example, Johnson et al [26] conducted one of the earliest CDN performance evaluations to compare different commercial products. More specifically, performance evaluation has been employed to study different CDN architectures [27]; and some other studies used to study performance evaluation to identify the best algorithm that met hierarchical streaming requirements [28]. Given the emerging computing paradigm -Cloud computing, researchers and practitioners have started using network virtualization and Cloud techniques to satisfy CDN requirements.…”

Section: Related Workmentioning

confidence: 99%

Towards understanding the runtime configuration management of do-it-yourself content delivery network applications over public clouds

Mitra

Zhang

et al. 2014

Future Generation Computer Systems

View full text Add to dashboard Cite

Towards understanding the runtime configuration management of do-it-yourself content delivery network applications over public clouds, Future Generation Computer Systems (2014), http://dx.doi.org/10.1016/j.future. 2013.12.019 This is a PDF file of an unedited manuscript that has been accepted for publication. As a service to our customers we are providing this early version of the manuscript. The manuscript will undergo copyediting, typesetting, and review of the resulting proof before it is published in its final form. Please note that during the production process errors may be discovered which could affect the content, and all legal disclaimers that apply to the journal pertain. Towards Understanding the Runtime Configuration Management of Do-It-Yourself Content Delivery NetworkApplications over Public Clouds AbstractCloud computing is a new paradigm shift which enables applications and related content (audio, video, text, images, etc.) to be provisioned in an on-demand manner and being accessible to anyone anywhere in the world without the need for owning expensive computing and storage infrastructures. Interactive multimedia content-driven applications in the domains of healthcare, aged-care, and education have emerged as one of the new classes of big data applications. This new generation of applications need to support complex content operations including production, deployment, consumption, personalisation, and distribution. However, to efficiently provision these applications on the Cloud data centres, there is a need to understand their run-time resource configurations. For example: (i) where to store and distribute the content to and from driven by end-user Service Level Agreements (SLAs)? (ii) how many content distribution servers to provision? and (iii) what Cloud VM configuration (number of instances, types, speed, etc.) to provision? In this paper, we present concepts and factors related to engineering such content-driven applications over public Clouds. Based on these concepts and factors, we propose a performance evaluation methodology for quantifying and understanding the runtime configuration these classes of applications. Finally, we conduct several benchmark driven experiments for validating the feasibility of the proposed methodology.

show abstract