期刊文献+

云服务传递网络资源动态分配模型 被引量:10

The Dynamic Allocation Model for the Resources of Cloud Services Delivery Networks
下载PDF
导出
摘要 云服务传递网络(Cloud Services Delivery Networks,CSDN)在Internet之上构建了一层分布式服务器网络,以就近和按需的方式向用户提供云传递服务.面对互联网规模化和多样化云服务的资源需求特点,CSDN形成了针对不同类型云服务传递的逻辑子服务器网络.CSDN的很大一部分服务器和带宽资源用于流媒体和下载类云服务的传递,该类型云服务传递资源的动态分配问题是该文的研究重点.根据该类型业务内存资源和带宽资源同为瓶颈资源以及该类型热点内容可采用P2P机制的两个特点,文中首先将该问题建模为多维设备选址模型.然后在对该建模分析及其NP完全性证明后,提出了一种启发式模型求解算法.最后以服务传递开销节省作为性能评价指标,以实际系统的运行数据为输入,全面评估了该模型求解算法的有效性. Cloud Services Delivery Networks(CSDN) constructs a layer distributed server overlay over the Internet,which uses the way to the nearest and on-demand approach providing services to end users.Facing the scale and diversification of the resource demand characteristics of the Internet cloud services,CSDN forms different logical sub-server overlay for different kinds of cloud services.However,most servers and bandwidth resources of CSDN are used to deliver the streaming and downloading kind of cloud services,and the dynamic allocation of their delivery resource is the main research emphasis in this paper.This paper first models the problem to be a multi-dimensional facility location problem,according to the two characteristics: the memory resource and bandwidth resource of this kind of application are the bottleneck resource;the hot contents of this kind of application can be delivered using the Peer-to-Peer mechanisms.After the model analyzed and its NP-Complete proved,we then propose a heuristic algorithm.Finally,using the service delivery cost savings as the performance metrics,while the actual system's operation trace is as the input,the effectiveness of the algorithm are comprehensively assessed.
出处 《计算机学报》 EI CSCD 北大核心 2011年第12期2305-2318,共14页 Chinese Journal of Computers
基金 国家"九七三"重点基础研究发展规划项目基金(2011CB302600) 国家自然科学基金(90818028 61003226) 国家杰出青年科学基金(60625203) 国家科技重大专项"核心电子器件 高端通用芯片及基础软件"(2009ZX01043-001)资助~~
关键词 云服务 传递网络 协同 对等网络 动态分配 cloud service delivery networks cooperation peer-to-peer dynamic allocation
  • 相关文献

参考文献25

  • 1Armbrust M, Fox A, Griffith R, Joseph R D, Katz R, Kon winski A, Lee G, Patterson D, Rabkin A, Stoica I, Zaharia M. A view of cloud computing. Communications of the ACM 2010, 53(5):862-876.
  • 2Yin H, Liu X N, Min G Y, Lin C. Content delivery net- works : A bridge between emerging applications and future IP networks. IEEE Network Magazine, 2010, 24(4): 52-56.
  • 3Nygren E, Sitaraman R K, Sun J. The Akamai network: A platform for high-performance internet applications. ACM SIGOPS Operating Systems Review, 2010, 44(3): 2-19.
  • 4Albanese F, Carra D, Michiardi P, Bestavros A. Cloud- based content distribution on a budget. Boston University, Boston: Teehnieal Report BUCS-TR-2010 022, 2010.
  • 5Wendell P, Jiang J W, Freedman M J, Rexford J. DONAR deeentralized server selection for cloud services//Proeeedings of the SIGCOMM. New Delhi, India, 2010:231-242.
  • 6Li B, Deng X, Go L M, Sohraby K. On the optimal place- ment of web proxies in the internet: Linertopology//Proceedings of the 8th IFIP Conference on High Performance Networking. Networking. Vienna, Austria, 1998:485 495.
  • 7Qiu L L, Padmanabhan N V, Voelker G M. On the placement of web server replicas//Proceedings of the IEEE INFO- COM. Alaska, USA, 2001:1587-1596.
  • 8Wang Z, Jiang H, Sun Y, Li J, Liu J, Eryk D. A K-coordinated decentralized replica placement aIgorithm//Proceedings of the ISCC. Riccione, Italy, 2010:811-816.
  • 9Jiang H, Wang Z, Wong A K, Li Jun, Li Zhongcheng. A replica placement algorithm for hybrid CDN-P2P architecture//Proceedings of the ICPADS. Shenzhen, China, 2009: 758-763.
  • 10Drezner Z, Hamacher H W. Facility Location: Applications and Theory. New York: Springer, 2004:132-141.

二级参考文献49

  • 1Blumenthal M S,Clark D D.Rethinking the design of the Internet:The end to end arguments vs.the brave new world.ACM Transactions on Internet Technology,2001,1(1):70-109.
  • 2Feldmann A.Internet clean-slate design:What and why? ACM SIGCOMM Computer Communications Review,2007,37(3):59-64.
  • 3Goldengorin B,Ghosh D et al.Branch and peg algorithms for the simple plant location problem.Computers & Operations Research,2004,31(2):241-255.
  • 4Drezner Z,Hamacher H W.Facility Location:Applications and Theory.Springer,2004:132-141.
  • 5Korkel M.On the exact solution of large-scale simple plant location problems.European Journal of Operational Research,1989,39(2):157-173.
  • 6Ryu C,Guignard M.An efficient algorithm for the capacitated plant location problem.Working Paper 92-11-02,Decision Sciences Department,University of Pennsylvania,The Wharton School,1992.
  • 7Harkness J,ReVelle C.Facility location with increasing production costs.European Journal of Operational Research,2003,145(1):1-13.
  • 8Geoffrion A M,McBride R.Lagrangean relaxation to capacitated facility location problems.AIIE Transactions,1978,10(1):40-47.
  • 9Van Roy T J.A cross decomposition algorithm for capacitated facility location.Operations Research,1986,34(1):145-163.
  • 10Tcha D,Lee B.A branch and bound algorithm for the multi-level uncapacitated facility location problem.European Journal of Operational Research,1984,18(1):35-43.

共引文献8

同被引文献86

  • 1于建军,狄焰亮,董科军,南凯.科研在线:云服务模式的网络虚拟科研环境[J].华中科技大学学报(自然科学版),2011,39(S1):33-37. 被引量:15
  • 2[美]曼纽尔·卡斯特.网络社会的崛起[M].北京:社会科学文献出版社,2006.434.
  • 3[美]埃莉诺·奥斯特罗姆.余逊达,等译.公共事务的治理之道[M].上海:上海三联书店,2000.
  • 4中国互联网络信息中心.第31次中国互联网络发展状况统计报告[EB/OL].http://www.cnnic.net.cn/gywm/xwzx/rdxw/2012nrd/201301/t20130115_38507.htm.2013-1-15.
  • 5Goldengorin B,Ghosh D,Sierksma G.Branch and PEG Algorithms for the Simple Plant Location Problem[J].Computers & Operations Research,2003,30(7):967-981.
  • 6Brimberg J,Hansen P,Mladenovic N,et al.Improvement and Comparison of Heuristics for Solving the Uncapacitated Multisource Weber Problem[J].Operations Research,2000,48(3):444-460.
  • 7Rosing K E.An Optimal Method for Solving the(Generalized)Multi-Weber Problem[J].European Journal of Operational Research,1992,58(3):414-426.
  • 8Chekuri C,Chuzhoy J,Lewin-Eytan L,et al.Non-cooperative Multicast and Facility Location Games[C]//Proceedings of the 7th ACM Conference on Electronic Commerce.New York:ACM,2006:72-81.
  • 9Guha S,Khuller S.Greedy Strikes Back:Improved Facility Location Algorithms[J].Journal of Algorithms,1999,31(1):228-248.
  • 10Laoutaris N,Smaragdakis G,Oikonomou K,et al.Distributed Deployment of Service Facilities in Large-scale Networks[C]//Proceedings of the 26th IEEE International Conference on Computer Communications.Piscataway:IEEE,2007:2144-2152.

引证文献10

二级引证文献31

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部