覆盖网络中多服务静态部署算法

doi:10.3969/j.issn.1001-2400.2014.04.024

J4 ›› 2014, Vol. 41 ›› Issue (4): 137-143.doi: 10.3969/j.issn.1001-2400.2014.04.024

覆盖网络中多服务静态部署算法

脱立恒^1,2;倪宏²;李满天^1,2;刘学²

(1. 中国科学院大学理学院，北京 100049;
2. 中国科学院声学研究所国家网络新媒体工程技术研究中心，北京 100190)

收稿日期:2013-04-01 出版日期:2014-08-20 发布日期:2014-09-25
通讯作者: 脱立恒
作者简介:脱立恒(1984-)，男，中国科学院大学博士研究生，E-mail: tuolh@dsp.ac.cn．
基金资助:
国家科技支撑计划资助项目(2011BAH11B04)；国家高技术研究发展计划(863)资助项目(2011AA01A102)；中国科学院先导专项资助项目(XDA6030500)

Static multi-service deployment algorithm on the overlay network

TUO Liheng^1,2;NI Hong²;LI Mantian^1,2;LIU Xue²

(1. School of Physics, University of Chinese Academy of Sciences, Beijing 100049， China;
2. National Network New Media Engineering Research Center, Institute of Acoustics Chinese Academy of Sciences, Beijing 100190， China)

Received:2013-04-01 Online:2014-08-20 Published:2014-09-25
Contact: TUO Liheng

摘要/Abstract

摘要：

针对因特网的覆盖网络中多服务在不同服务节点的部署问题，提出了一种保证平均请求转发延迟满足服务质量要求，以最小化服务部署规模为目标的服务部署模型．该模型在传统的单服务部署问题的基础上，增加了多服务的分配任务；为了合理均衡利用服务节点的服务器资源，引入并发上限限制单节点的并发数目．证明了该模型属于非确定性多项式时间完全问题，提出了两种贪婪启发式算法，两种算法可以在多项式时间内求解．实验结果表明，所提出模型和启发式方法能够大大降低服务部署规模，分别将服务部署规模降低为原始规模的41％和47.8％．

关键词: 覆盖网络, 服务部署, 启发式算法, 请求转发延迟

Abstract:

The Static Multi-Service deployment Model SMSPM for short, is proposed to deal with the problem of overlay network multi-service deployment on the Internet. The SMSPM minimizes the scale of service deployment as a target and guarantees the average request forwarding delay to satisfy the quality of service. Based on single service deployment, the SMSPM allocates multiple services to different service nodes We introduce the concurrent upper limit on the number of concurrents in a single node to use reasonably server resources of service nodes. We prove that the SMSPM problem is NP-Complete. We propose two greedy heuristic algorithms, NBND and BND. NBND and BND can solve the problem in the polynomial time. Experimental results show that NBND and BND. SMSPM and two greedy heuristic algorithms can greatly lower the scale of multi-service deployment. BND and NBND can reduce the scale of multi-service deployment to 41％ and 47.8％ of the original scale of multi-service deployment.

Key words: overlay network, service deployment, heuristic algorithms, request forwarding delay

中图分类号:

TP393

脱立恒;倪宏;李满天;刘学. 覆盖网络中多服务静态部署算法[J]. J4, 2014, 41(4): 137-143.

TUO Liheng;NI Hong;LI Mantian;LIU Xue. Static multi-service deployment algorithm on the overlay network[J]. J4, 2014, 41(4): 137-143.

参考文献

［1］尹浩, 袁小群, 林闯, 等. 内容网络服务节点部署理论综述［J］. 计算机学报, 2010, 33(9): 1161-1620.
Yin Hao, Yuan Xiaoqun, Lin Chuang, et al. The Survey of Service Nodes Deployment Theories for Content Networks［J］. Chinese Journal of Computers, 2010, 33(9): 1161-1620.
［2］ Goldengorin B, Ghosh D, Sierksma G. Branch and PEG Algorithms for the Simple Plant Location Problem［J］. Computers ＆ Operations Research, 2003, 30(7): 967-981.
［3］ Brimberg 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.
［4］ Rosing K E. An Optimal Method for Solving the (Generalized) Multi-Weber Problem［J］. European Journal of Operational Research, 1992, 58(3): 414-426.
［5］ Chekuri 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.
［6］ Guha S, Khuller S. Greedy Strikes Back: Improved Facility Location Algorithms［J］. Journal of Algorithms, 1999, 31(1): 228-248.
［7］ Laoutaris 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.
［8］ Cahill A J, Sreenan C J. An Efficient CDN Deployment Algorithm for the Delivery of High-quality TV Content［C］//Proceedings of the 12th Annual ACM International Conference on Multimedia. New York: ACM, 2004: 975-976.
［9］ Kecskemeti G, Terstyanszky G, Kacsuk P, et al. An Approach for Virtual Appliance Distribution for Service Deployment［J］. Future Generation Computer Systems, 2011, 27(3): 280-289.
［10］郭涛, 温少君, 陈俊杰. 基于个性化的云平台虚拟机部署机制的研究［J］. 太原理工大学学报, 2012, 43(2): 125-129.
Guo Tao, Wen Shaojun, Chen Junjie. The Research on Personalized VM Deployment Mechanism in Cloud［J］. Journal of Taiyuan University of Technology, 2012, 43(2): 125-129.
［11］ Liu T, Lu T, Wang W, et al. SDMS-O: a Service Deployment Management System for Optimization in Clouds While Guaranteeing Users' QoS Requirements［J］. Future Generation Computer Systems, 2012, 28(7): 1100-1109.
［12］陈香兰, 李曦, 龚育昌. 服务组合中一种静态基础服务部署研究［J］. 小型微型计算机系统, 2008, 29(4): 709-714.
Chen Xianglan, Li Xi, Gong Yuchang. Static Service Deployment Algorithm in Service Composition［J］. Journal of Chinese Computer Systems, 2008, 29(4): 709-714.
［13］史佩昌, 王怀民, 尹刚, 等. 云服务传递网络资源动态分配模型［J］. 计算机学报, 2011, 34(12): 2305-2318.
Shi Peichang, Wang Huaimin, Yin Gang, et al. The Dynamic Allocation Model for the Resources of Cloud Services Delivery Network［J］. Chinese Journal of Computers, 2011, 34(12): 2305-2318.
［14］ Averbakh I. Complexity of Robust Single Facility Location Problems on Networks with Uncertain Edge Lengths［J］. Discrete Applied Mathematics, 2003, 127(3): 505-522.

[1]	徐剑;倪宏;邓浩江;刘磊. 覆盖多播网络中代理服务器的部署算法[J]. J4, 2013, 40(3): 139-144.
[2]	暂时无作者信息. 两阶段混合流程调度问题研究[J]. J4, 2002, 29(3): 305-310.

覆盖网络中多服务静态部署算法

Static multi-service deployment algorithm on the overlay network

PDF (PC)

赞

可视化

被引次数

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 2

Metrics

本文评价

推荐阅读 0