Collaborative Caching in Wireless Video Streaming Through Resource Auctions

Dai, Jie; Liu, Fangming; Li, Bo; Li, Baochun; Liu, Jiangchuan

doi:10.1109/jsac.2012.120226

Cited by 86 publications

(45 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Distributed caching can effectively bring content close to the user and reduce the access latency correspondingly [21][22]. Furthermore, J. Dai et al [37] studied the collaborative caching problem and proposed a solution based on Vickrey-ClarkeGroves (VCG) auction. This technique is very beneficial for non-live video streaming such as progressive streaming, as these videos have a lower real-time property [23].…”

Section: Related Workmentioning

confidence: 99%

Mobile Live Video Streaming Optimization via Crowdsourcing Brokerage

Dou

et al. 2017

IEEE Trans. Multimedia

View full text Add to dashboard Cite

Abstract-Nowadays, people can enjoy a rich real-time sensing cognition of what they are interested in anytime and anywhere by leveraging powerful mobile devices such as smartphones. As a key support for the propagation of these richer live media contents, cellular-based access technologies play a vital role to provide reliable and ubiquitous Internet access to mobile devices. However, these limited wireless network channel conditions vary and fluctuate depending on weather, building shields, congestion, etc., which degrade the quality of live video streaming dramatically. To address this challenge, we propose to use crowdsourcing brokerage in future networks which can improve each mobile user's bandwidth condition and reduce the fluctuation of network condition. Further, to serve mobile users better in this crowdsourcing style, we study the brokerage scheduling problem which aims at maximizing the user's QoE (quality of experience) satisfaction degree cost-effectively. Both offline and online algorithms are proposed to solve this problem. The results of extensive evaluations demonstrate that by leveraging crowdsourcing technique, our solution can cost-effectively guarantee a higher quality view experience.

show abstract

Section: Related Workmentioning

confidence: 99%

Mobile Live Video Streaming Optimization via Crowdsourcing Brokerage

Dou

et al. 2017

IEEE Trans. Multimedia

View full text Add to dashboard Cite

show abstract

“…Finally, similar to [14], [16], [23], [24], our work use the cooperative game framework to share resources.…”

Section: Related Workmentioning

confidence: 99%

Falloc: Fair network bandwidth allocation in IaaS datacenters via a bargaining game approach

Guo

Liu

Tang

et al. 2013

2013 21st IEEE International Conference on Network Protocols (ICNP)

Self Cite

View full text Add to dashboard Cite

Abstract-With wide application of virtualization technology, tenants are able to access isolated cloud services by renting the shared resources in datacenters. Unlike resources such as CPU and memory, datacenter network, which relies on traditional transport-layer protocols, suffers unfairness due to a lack of VMlevel network isolation. In this paper, we propose Falloc, a new bandwidth allocation protocol, towards VM-based fairness across the datacenter with two main objectives: (i) guarantee bandwidth for VMs based on their base bandwidth requirements, and (ii) share residual bandwidth in proportion to weights of VMs. To design Falloc, we model the datacenter bandwidth allocation as a bargaining game and propose a distributed algorithm to achieve the asymmetric Nash bargaining solution (NBS). We apply the theory to practice by implementing Falloc with OpenFlow in experiments under diversed scenarios, which shows that Falloc can achieve fairness by adapting to different network requirements of VMs, and balance the tradeoff between bandwidth guarantee and proportional bandwidth share. By carrying out large scale tracedriven simulations using real-world Mapreduce workload, we show that Falloc achieves high utilization and maintains fairness among VMs in datacenters.

show abstract

“…In case the integer constraints are relaxed, the problem models the fractional cooperative caching, which is considered in this work. Cooperative caching at the SP level aims to mitigate the transit traffic cost among SPs [5][6][7][8]. The SPs in Ref.…”

Section: Introductionmentioning

confidence: 99%

“…The authors in Ref. [6] http://dx.doi.org/10.1016/j.comnet.2014.12.005 1389-1286/Ó 2014 Elsevier B.V. All rights reserved. use the Vickrey-Clarke-Groves auction game model to design a mechanism for the cache servers owned by selfish wireless SPs truthfully cooperating with each other.…”

Section: Introductionmentioning

confidence: 99%