• Corpus ID: 36495799

Towards Cost-Efficient Content Placement in Media Cloud : Modeling and Analysis

@inproceedings{Jin2016TowardsCC,
  title={Towards Cost-Efficient Content Placement in Media Cloud : Modeling and Analysis},
  author={Yichao Jin and Yonggang Wen and Kyle Guan},
  year={2016}
}
Cloud-centric media network (CCMN) was previously proposed to provide cost-effective content distribution services for user-generated contents (UGCs) based on media cloud. CCMN service providers orchestrate cloud resources to deliver UGCs in a pay-per-use style, with an objective to minimize the operational monetary cost. The monetary cost depends on the actual usage of cloud resources (e.g., computing, storage, and bandwidth), which in turn, is affected by the content placement strategy. In… 

Physical–Social-Aware D2D Content Sharing Networks: A Provider–Demander Matching Game

This work uses the weighted directed graph theory to model the two-sided physical–social-aware preferences, which jointly exploit the physical and social networking characteristics of both sides, and develops a distributed algorithm based on the Dinkelbach iteration and deferred acceptance approaches.

Social-Aware Rate Based Content Sharing Mode Selection for D2D Content Sharing Scenarios

A notion of social-aware rate is introduced, which combines the social selfishness from the social knowledge with the link rate to ensure the physical link quality and the effective cooperation together and develops a best-effort distributed algorithm framework.

References

SHOWING 1-10 OF 34 REFERENCES

Toward monetary cost effective content placement in cloud centric media network

This paper further study the content placement problem in CCMN, and suggests that, the optimal number of replica for each content follows a power law in respect to its popularity, under feasible storage and bandwidth constraints, in a set of deployed backbone networks.

Intra-cloud lightning: Building CDNs in the cloud

This paper develops a suite of offline, online-static and online-dynamic heuristic algorithms that take as input network topology and work load information such as user location and request rates and shows that they behave very close to optimal under various network conditions.

CoDaaS: An experimental cloud-centric content delivery platform for user-generated contents

The proposed content-delivery-as-a-service (CoDaaS) solution is built on a hybrid media cloud, and offers elastic private virtual content delivery service with an agreed Quality of Service (QoS) to UGC providers.

Replica placement in ring based content delivery networks

Dynamic Request Redirection and Elastic Service Scaling in Cloud-Centric Media Networks

This work considers the problem of optimally redirecting user requests in a cloud-centric media network to multiple destination Virtual Machines (VMs), and shows that under each request arrival mode, the optimal redirection policy can be found in terms of a price for each VM, which is a function of the VM's service cost.

Distributed Placement of Service Facilities in Large-Scale Networks

A scalable, distributed approach that answers the key question through an iterative re-optimization of the location and the number of facilities within such balls, and achieves performance under various synthetic and real Internet topologies that is comparable to that of optimal, centralized approaches requiring full topology and demand information.

Peer-Assisted On-Demand Streaming: Characterizing Demands and Optimizing Supplies

A theoretical framework based on queuing models is developed to justify the superiority of service prioritization based on a taxonomy of requests, and understand the fundamental principles behind optimal prefetching and caching designs in peer-assisted on-demand streaming systems.

QoS-aware replica placement for content distribution

It is shown that there exist polynomial optimal solutions to the QoS-aware placement problem for replica-blind services, and several heuristic algorithms for fast computation of good solutions are proposed and experimentally evaluated.

Optimal allocation of electronic content

  • I. CidonS. KuttenR. Soffer
  • Computer Science
    Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213)
  • 2001
It is observed that the use of dynamic programming is more natural for distributed implementations of distributed algorithms, and a natural function is found that simplifies the combination operation used in dynamic programming.

Object replication strategies in content distribution networks