簡易檢索 / 詳目顯示

研究生: 呂昆育
Kun-Yu Lyu
論文名稱: 雲端運算中之邊緣雲擺放並降低流量負載
Edge Cloud Placement with Traffic Load Alleviation for Cloud Computing
指導教授: 金台齡
Tai-Lin Chin
口試委員: 邱舉明
Ge-Ming Chiu
陳永昇
Yeong-Sheng Chen
李敏凡
Min-Fan Lee
學位類別: 碩士
Master
系所名稱: 電資學院 - 資訊工程系
Department of Computer Science and Information Engineering
論文出版年: 2018
畢業學年度: 107
語文別: 英文
論文頁數: 49
中文關鍵詞: 邊緣運算流量降載
外文關鍵詞: edge computing, traffic load alleviation
相關次數: 點閱:263下載:1
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報
  • 在現代社會中,網際網路是十分普及的,使用者使用網際網路來完成各式各樣的服務,使用者提出要求給網路上的雲端伺服器,雲端伺服器提供使用者所需的服務給使用者,因此,使用者與雲端伺服器之間會產生一段流量,當服務產生較大流量,而且使用者離雲端伺服器的距離又很遠時,除了資料傳送所需的時間長以外,資料流流過更長的距離會更容易與其他資料競爭頻寬,增加網路流量負載,有一個解決方法是透過加入邊緣雲,讓使用者的要求在邊緣雲被滿足,因為資料流流動距離較短,資料流對網路的影響較小,所以能夠降低網路流量負載,邊緣雲的所在位置會影響到資料傳送所需的時間和網路流量負載。本論文調查在雲端網路中如何選擇邊緣雲的位置及分配使用者給合適的邊緣雲來最小化使用者請求服務所產生的流量的問題,問題被正式地定義成一個整數規劃問題,文章中提出新的方法來選擇邊緣雲的位置並為每個使用者選擇合適的邊緣雲,使用者要求會傾向在鄰近邊緣雲被處理,如此可以使網路中的流量負載最小化。模擬結果顯示提出的方法比起其他最近的方法在降低網路流量負載中有更好的表現。


    In the modern world, the Internet is very widespread. People ask the Internet to provide kinds of services. The user sends a request message to the cloud server on the Internet. Then, the cloud server provides service to the user. Hence, between the user and the server, a traffic is generated as the user is served. However, if there a large traffic be generated and it is a long distance between the user and the cloud server, not only the data transmission time is longer, but also the data flow has more chance to compete with other data flow for the bandwidth, which leads to increase of traffic load. A solution is to deploy edge clouds in the networks. The user requests are served in edge clouds. Due to the cost of deploying an edge cloud is lower than setting up a cloud server, the more edge clouds can be deployed in the networks under the same budget. The deployment of edge cloud is resilient. The edge cloud is close to the user so the influence of data flow generated by service is small, the traffic load of the networks is alleviated. Locations of edge clouds influence data transmission time and traffic load of the networks. This thesis investigates the problem of selecting the locations of edge clouds in a cloud network and allocating user requests to appropriate edge clouds to share the workload of the cloud server while minimizing the traffic originally generated between the user and the cloud server. The problem is formally defined in an integer programming problem. The thesis proposed novel schemes to select the locations of edge clouds and allocate user requests to appropriate edge clouds. User requests are preferred to be processed locally in the nearby edge cloud such that the traffic load in the network could be minimized. Simulation results show that the proposed scheme outperforms other schemes in the recent literature. It is shown to be effective in reducing the traffic load in the network.

    Recommendation Letter . . . . . . i Approval Letter . . . . . . ii Abstract in Chinese . . . . . . iii Abstract in English . . . . . . iv Acknowledgements . . . . . . v Contents . . . . . . vi List of Figures . . . . . . viii List of Tables . . . . . . ix 1 Introduction . . . . . . 1 2 Related Work . . . . . . 4 2.1 Work Offloading Problem . . . . . . 4 2.2 Placement Problem . . . . . . 5 2.2.1 Cloudlet Placement . . . . . . 6 2.2.2 Virtual Machine (VM) Placement . . . . . . 6 2.2.3 Cache Placement . . . . . . 7 2.2.4 Placement Problem in SDN . . . . . . 8 3 Problem Formulation . . . . . . 10 3.1 System Model . . . . . . 10 3.2 Problem Formulation . . . . . . 12 4 Edge Cloud Placement . . . . . . 16 4.1 Set-by-Set Algorithm . . . . . . 16 4.2 K-Clustering Algorithm . . . . . . 20 5 Simulations . . . . . . 24 5.1 Simulation Environment . . . . . . 24 5.2 Performance Evaluation . . . . . . 25 6 Conclusions . . . . . . 35 Appendix: Erlang-B Formula . . . . . . 36 References . . . . . . 38

    [1] M. Satyanarayanan, “Mobile computing: the next decade,” in Proceedings of the 1st ACM workshop on mobile cloud computing & services: social networks and beyond, pp. 5:1–5:6, ACM, 2010.
    [2] H. T. Dinh, C. Lee, D. Niyato, and P. Wang, “A survey of mobile cloud computing: architecture, applications, and approaches,” Wireless communications and mobile computing, vol. 13, no. 18, pp. 1587–1611, 2013.
    [3] M. Satyanarayanan, V. Bahl, R. Caceres, and N. Davies, “The case for vm-based cloudlets in mobile computing,” IEEE pervasive Computing, vol. 4, no. 8, pp. 14–23, 2009.
    [4] W. Shi, J. Cao, Q. Zhang, Y. Li, and L. Xu, “Edge computing: Vision and challenges,” IEEE Internet of Things Journal, vol. 3, no. 5, pp. 637–646, 2016.
    [5] H. Flores, P. Hui, S. Tarkoma, Y. Li, S. Srirama, and R. Buyya, “Mobile code offloading: from concept to practice and beyond,” IEEE Communications Magazine, vol. 53, no. 3, pp. 80–88, 2015.
    [6] M. V. Barbera, S. Kosta, A. Mei, and J. Stefa, “To offload or not to offload? the bandwidth and energy costs of mobile cloud computing,” in IEEE INFOCOM, pp. 1285–1293, IEEE, 2013.
    [7] S. Kosta, A. Aucinas, P. Hui, R. Mortier, and X. Zhang, “Thinkair: Dynamic resource allocation and parallel execution in the cloud for mobile code offloading,” in Infocom, 2012 Proceedings IEEE, pp. 945–953, IEEE, 2012.
    [8] Y. Zhang, D. Niyato, and P. Wang, “Offloading in mobile cloudlet systems with intermittent connectivity,” IEEE Transactions on Mobile Computing, vol. 14, no. 12, pp. 2516–2529, 2015.
    [9] C. You, K. Huang, H. Chae, and B.-H. Kim, “Energy-efficient resource allocation for mobile-edge computation offloading,” IEEE Transactions on Wireless Communications, vol. 16, no. 3, pp. 1397–1411, 2017.
    [10] Y. Mao, J. Zhang, and K. B. Letaief, “Dynamic computation offloading for mobile-edge computing with energy harvesting devices,” IEEE Journal on Selected Areas in Communications, vol. 34, no. 12, pp. 3590–3605, 2016.
    [11] M. Jia, J. Cao, and W. Liang, “Optimal cloudlet placement and user to cloudlet allocation in wireless metropolitan area networks,” IEEE Transactions on Cloud Computing, vol. 5, no. 4, pp. 725–737, 2017.
    [12] X. Chen, L. Jiao, W. Li, and X. Fu, “Efficient multi-user computation offloading for mobile-edge cloud computing,” IEEE/ACM Transactions on Networking, vol. 24, no. 5, pp. 2795–2808, 2016.
    [13] R. Newton, S. Toledo, L. Girod, H. Balakrishnan, and S. Madden, “Wishbone: Profile-based partitioning for sensornet applications,” in NSDI’09: 6th USENIX Symposium on Networked Systems Design and Implementation, vol. 9, pp. 395–408, 2009.
    [14] E. Cuervo, A. Balasubramanian, D.-k. Cho, A. Wolman, S. Saroiu, R. Chandra, and P. Bahl, “Maui: making smartphones last longer with code offload,” in Proceedings of the 8th international conference on Mobile systems, applications, and services, MobiSys ’10, pp. 49–62, ACM, 2010.
    [15] B.-G. Chun, S. Ihm, P. Maniatis, M. Naik, and A. Patti, “Clonecloud: elastic execution between mobile device and cloud,” in Proceedings of the sixth conference on Computer systems, EuroSys ’11, pp. 301–314, ACM, 2011.
    [16] M.-R. Ra, A. Sheth, L. Mummert, P. Pillai, D. Wetherall, and R. Govindan, “Odessa: enabling interactive perception applications on mobile devices,” in Proceedings of the 9th international conference on Mobile systems, applications, and services, MobiSys ’11, pp. 43–56, ACM, 2011.
    [17] T. Zhao, S. Zhou, X. Guo, Y. Zhao, and Z. Niu, “A cooperative scheduling scheme of local cloud and internet cloud for delay-aware mobile cloud computing,” in Globecom Workshops (GC Wkshps), 2015 IEEE, pp. 1–6, IEEE, 2015.
    [18] L. Zhao, J. Liu, Y. Shi, W. Sun, and H. Guo, “Optimal placement of virtual machines in mobile edge computing,” in IEEE Global Communications Conference (GLOBECOM), pp. 1–6, IEEE, 2017.
    [19] Y. Gao, H. Guan, Z. Qi, Y. Hou, and L. Liu, “A multi-objective ant colony system algorithm for virtual machine placement in cloud computing,” Journal of Computer and System Sciences, vol. 79, no. 8, pp. 1230–1242, 2013.
    [20] M. Shiraz, S. Abolfazli, Z. Sanaei, and A. Gani, “A study on virtual machine deployment for application outsourcing in mobile cloud computing,” The Journal of Supercomputing, vol. 63, no. 3, pp. 946–964, 2013.
    [21] K. S. Prabh and T. F. Abdelzaher, “Energy-conserving data cache placement in sensor networks,” ACM Transactions on Sensor Networks (TOSN), vol. 1, no. 2, pp. 178–203, 2005.
    [22] B. Tang, H. Gupta, and S. R. Das, “Benefit-based data caching in ad hoc networks,” IEEE transactions on Mobile Computing, vol. 7, no. 3, pp. 289–304, 2008.
    [23] L. F. Müller, R. R. Oliveira, M. C. Luizelli, L. P. Gaspary, and M. P. Barcellos, “Survivor: an enhanced controller placement strategy for improving sdn survivability,” in Global Communications Conference (GLOBECOM), 2014 IEEE, pp. 1909–1915, IEEE, 2014.
    [24] C.-Y. Chu, K. Xi, M. Luo, and H. J. Chao, “Congestion-aware single link failure recovery in hybrid sdn networks,” in 2015 IEEE Conference on Computer Communications (INFOCOM), pp. 1086–1094, IEEE, 2015.
    [25] A. O. Allen, Probability, statistics, and queueing theory. Academic Press, 2014.
    [26] S. F. Gieselman, N. K. Singhal, and B. Mukherjee, “Minimum-cost virtual-topology adaptation for optical wdm mesh networks,” in IEEE International Conference on Communications (ICC), vol. 3, pp. 1787–1791, May 2005.

    QR CODE