Advertisement

Optimal Resource Allocation for Brokers in Media Cloud

  • Wenlong NiEmail author
  • Wei Wayne LiEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11280)

Abstract

Due to the rapid increases in the population of mobile social users, providing the users with satisfied multimedia services has become an important issue. Media cloud has been shown to be an efficient solution to resolve the above issue, by allowing mobile social users to connect to it through a group of distributed brokers. However, as the resource (like bandwidth, servers, computing power, etc.) in media cloud is limited, how to allocate resource among media cloud with brokers becomes a challenge. Media cloud can determine the price of the resource and a broker can decide whether it will pay the price for the resource when there is an incoming multimedia task (simplified as task). A broker can collect the revenues from the mobile social users by providing the multimedia services. Since resource is limited, the price will generally go up as the resource becomes more and more consumed. Therefore, in this paper, by assuming that accepting each task a broker can get a reward (by collecting revenues from mobile social users like online ads, etc.) and it needs pay some price (to the media cloud) for each task in the network, we concentrate on the optimization problems of when to admit or reject a task for a broker in order to achieve the maximum total discounted expected reward for any initial state. By establishing a discounted Continuous-Time Markov Decision Process (CTMDP) model, we verify that the optimal policies for admitting tasks are state-related control limit policies. Our numerical results with explanations in both tables and diagrams are consistent with our theoretic results.

Keywords

Media cloud Cloud broker Mobile social user Resource allocation Optimal control policy Continuous-Time Markov Decision Process (CTMDP) 

References

  1. 1.
    Su, Z., Xu, Q., Zhu, H., Wang, Y.: A novel design for content delivery over software defined mobile social networks. IEEE Netw. 29(4), 62–67 (2015)CrossRefGoogle Scholar
  2. 2.
    Su, Z., Xu, Q., Fei, M., Dong, M.: Game theoretic resource allocation in media cloud with mobile social users. IEEE Trans. Multimed. 18(8), 1650–1660 (2016)CrossRefGoogle Scholar
  3. 3.
    Wu, Y., Wu, C., Li, B., Zhang, L.: Scaling social media applications into geo-distributed clouds. IEEE/ACM Trans. Netw. 23(3), 689–702 (2015)CrossRefGoogle Scholar
  4. 4.
    Ren, J., Zhang, Y., Zhang, K., Shen, X.: Exploiting mobile crowdsourcing for pervasive cloud services: Challenges and solutions. IEEE Commun. Mag. 53(3), 98–105 (2015)CrossRefGoogle Scholar
  5. 5.
    Qiu, X., Wu, C., Li, H., Li, Z., Lau, F.: Federated private clouds via brokers marketplace: a Stackelberg-game perspective. In: IEEE 7th International Conference on Cloud Computing, pp. 296–303, June 2014Google Scholar
  6. 6.
    Ni, W., Li, W., Alam, M.: Determination of optimal call admission control policy in wireless networks. IEEE Trans. Wirel. Commun. 8(2), 1038–1044 (2009)CrossRefGoogle Scholar
  7. 7.
    Li, W., Chao, X.: Call admission control for an adaptive heterogeneous multimedia mobile network. IEEE Trans. Wirel. Commun. 6(2), 515–525 (2007)CrossRefGoogle Scholar
  8. 8.
    Chao, X., Chen, H., Li, W.: Optimal control for a tandem network of queues with blocking. ACTA Math. Appl. Sin. 13(4), 425–437 (1997)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Puterman, M.L.: Markov Decision Process: Discrete Stochastic Dynamic Programming. Wiley, New York (2005)zbMATHGoogle Scholar
  10. 10.
    Ross, S.M.: Stochastic Process. Wiley, New York (1983)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2018

Authors and Affiliations

  1. 1.School of Computer Information EngineeringJiangXi Normal UniversityNanChangChina
  2. 2.Department of Computer ScienceTexas Southern UniversityHoustonUSA

Personalised recommendations