메뉴 건너뛰기




Volumn , Issue , 2018, Pages 196-201

Combinatorial clock auction for live video streaming in mobile edge computing

Author keywords

[No Author keywords available]

Indexed keywords

CLOCKS; COMPUTATIONAL COMPLEXITY; DYNAMIC PROGRAMMING; EDGE COMPUTING; POLYNOMIAL APPROXIMATION; QUALITY OF SERVICE; SCALABLE VIDEO CODING;

EID: 85050698447     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOMW.2018.8407007     Document Type: Conference Paper
Times cited : (19)

References (21)
  • 4
    • 84885634108 scopus 로고    scopus 로고
    • Toward a unified elastic computing platform for smartphones with cloud support
    • September
    • W. Zhang, Y. Wen, J. Wu, and H. Li. Toward a unified elastic computing platform for smartphones with cloud support. IEEE Network, 27(5): 34-40, September 2013.
    • (2013) IEEE Network , vol.27 , Issue.5 , pp. 34-40
    • Zhang, W.1    Wen, Y.2    Wu, J.3    Li, H.4
  • 8
    • 85028454824 scopus 로고    scopus 로고
    • Mobile edge computing enhanced adaptive bitrate video delivery with joint cache and radio resource allocation
    • X. Xu, J. Liu, and X. Tao. Mobile Edge Computing Enhanced Adaptive Bitrate Video Delivery With Joint Cache and Radio Resource Allocation. IEEE Access, 5: 16406-16415, 2017.
    • (2017) IEEE Access , vol.5 , pp. 16406-16415
    • Xu, X.1    Liu, J.2    Tao, X.3
  • 9
    • 85029884305 scopus 로고    scopus 로고
    • On the auction-based resource trading for a small-cell caching system
    • July
    • F. You, J. Li, J. Lu, and F. Shu. On the Auction-Based Resource Trading for a Small-Cell Caching System. IEEE Communications Letters, 21(7): 1473-1476, July 2017.
    • (2017) IEEE Communications Letters , vol.21 , Issue.7 , pp. 1473-1476
    • You, F.1    Li, J.2    Lu, J.3    Shu, F.4
  • 10
    • 85023161226 scopus 로고    scopus 로고
    • Roadside unit caching: Auction-based storage allocation for multIPle content providers
    • Oct
    • Z. Hu, Z. Zheng, T. Wang, L. Song, and X. Li. Roadside Unit Caching: Auction-Based Storage Allocation for MultIPle Content Providers. IEEE Transactions on Wireless Communications, 16(10): 6321-6334, Oct 2017.
    • (2017) IEEE Transactions on Wireless Communications , vol.16 , Issue.10 , pp. 6321-6334
    • Hu, Z.1    Zheng, Z.2    Wang, T.3    Song, L.4    Li, X.5
  • 11
    • 85023175503 scopus 로고    scopus 로고
    • Combinational auction-based service provider selection in mobile edge computing networks
    • H. Zhang, F. Guo, H. Ji, and C. Zhu. Combinational Auction-Based Service Provider Selection in Mobile Edge Computing Networks. IEEE Access, 5: 13455-13464, 2017.
    • (2017) IEEE Access , vol.5 , pp. 13455-13464
    • Zhang, H.1    Guo, F.2    Ji, H.3    Zhu, C.4
  • 14
    • 84989172943 scopus 로고    scopus 로고
    • Properties of the combinatorial clock auction
    • Jonathan Levin and Andrzej Skrzypacz. Properties of the combinatorial clock auction. The American Economic Review, 106(9): 2528-2551, 2016.
    • (2016) The American Economic Review , vol.106 , Issue.9 , pp. 2528-2551
    • Levin, J.1    Skrzypacz, A.2
  • 17
    • 84884538188 scopus 로고    scopus 로고
    • QoE-driven cache management for http adaptive bit rate streaming over wireless networks
    • Oct
    • W. Zhang, Y. Wen, Z. Chen, and A. Khisti. QoE-Driven Cache Management for HTTP Adaptive Bit Rate Streaming Over Wireless Networks. IEEE Transactions on Multimedia, 15(6): 1431-1445, Oct 2013.
    • (2013) IEEE Transactions on Multimedia , vol.15 , Issue.6 , pp. 1431-1445
    • Zhang, W.1    Wen, Y.2    Chen, Z.3    Khisti, A.4
  • 18
    • 84888027852 scopus 로고    scopus 로고
    • Do core-selecting combinatorial clock auctions always lead to high efficiency An experimental analysis of spectrum auction designs
    • Martin Bichler, Pasha Shabalin, and Jürgen Wolf. Do core-selecting combinatorial clock auctions always lead to high efficiency An experimental analysis of spectrum auction designs. Experimental Economics, 16(4): 511-545, 2013.
    • (2013) Experimental Economics , vol.16 , Issue.4 , pp. 511-545
    • Bichler, M.1    Shabalin, P.2    Wolf, J.3
  • 20
    • 0016047180 scopus 로고
    • Computing partitions with applications to the knapsack problem
    • E. Horowitz and S. Sahni. Computing partitions with applications to the knapsack problem. Journal of the ACM (JACM), 21(2): 277-292, 1974.
    • (1974) Journal of the ACM (JACM) , vol.21 , Issue.2 , pp. 277-292
    • Horowitz, E.1    Sahni, S.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.