距离感知基于CAN的云计算网络路由机制

doi:1000-436X(2011)07-0029-11

通信学报 ›› 2011, Vol. 32 ›› Issue (7): 29-39.doi: 1000-436X(2011)07-0029-11

距离感知基于CAN的云计算网络路由机制

韩志杰¹,黄刘生¹,王汝传²,孙力娟²,盛明¹

¹ 中国科技大学计算机科学技术学院，安徽合肥 230026
² 南京邮电大学计算机学院，江苏南京 210003

出版日期:2011-07-25 发布日期:2017-07-15
基金资助:
国家自然科学基金资助项目;国家自然科学基金资助项目;国家自然科学基金资助项目;江苏省科技支撑计划(工业)基金资助项目;江苏省科技支撑计划(工业)基金资助项目;江苏省级现代服务业发展专项基金资助项目;江苏省高校自然科学基础研究基金资助项目;江苏省高校自然科学基础研究基金资助项目;高校科研成果产业化推进工程基金资助项目;国家博士后基金资助项目;江苏高校科技创新计划基金资助项目;江苏高校科技创新计划基金资助项目;江苏省六大高峰人才基金资助项目;教育部高等学校博士学科点专项科研基金资助项目;江苏省计算机信息处理技术重点实验室基金资助项目

Distance aware route algorithm for cloud computing based on CAN

¹ University of Science and Technology of China,Institute of Computer Science and Technology,Hefei 230026,China
² College of Computer,Nanjing University of Posts and Telecommunications,Nanjing 210003,China

Online:2011-07-25 Published:2017-07-15
Supported by:
The National Natural Science Foundation of China;The National Natural Science Foundation of China;The National Natural Science Foundation of China;Scientific ＆ Technological Support Project (Industry)of Jiangsu Province;Scientific ＆ Technological Support Project (Industry)of Jiangsu Province;The Special Foundation for Development of Modern Service Industry of Jiangsu Province Project;Sponsored by Jiangsu Provincial Research Scheme of Natural Science for Higher Education Institutions;Sponsored by Jiangsu Provincial Research Scheme of Natural Science for Higher Education Institutions;Scientific Research ＆ Industry Promotion Project for Higher Education Institutions;Postdoctoral Foundation;Science & Technology Innovation Fund for Higher Education Institutions of Jiangsu Province;Science & Technology Innovation Fund for Higher Education Institutions of Jiangsu Province;The Six Kinds of Top Talent of Jiangsu Province;Doctoral Fund of Ministry of Education of China;The Key Laboratory Foundation of Information Technology Processing of Jiangsu Province

摘要/Abstract

摘要：

摘要：以结构化拓扑为基础，采用CAN(content addressable network)协议，提出了一种新的云计算网络路由算法。该算法以M-CRP技术为基础，改进传统CAN协议，组网时在物理上相近的节点会处于逻辑上相邻的位置；相应的路由机制也对物理拓扑结构给予充分的考虑，优先考虑物理临近并且通信成本较低的节点；自适应机制网络状态不断变化，M-CRP-CAN(multiple-CDN-based relative network positioning)在组网、路由、自适应等机制都有较强底层物理拓扑结构感知性。实验表明，算法能够提高数据的交换效率，减少了网络中不必要的跨域流量，减少骨干链路的负载，提高了云计算网络性能。

关键词: 云计算, 路由, CAN

Abstract:

Based on the traditional CRP mechanism,a new mechanism called M-CRP which is more adapt to the cloud computer mechanism was advanced.Based on traditional CAN,a new mechanism called M-CRP-CAN which make full use of M-CRP and make not only the CAN framework structure award of the physical location of nodes was advanced but also the routing mechanism give more thought about the physical topology.The self-adaption can make the M-CRP-CAN has more ability to change according to the net status.In network simulation platform,the experimental results show that M-CRP’s performance is better than CRP in aspect of efficiency and precision.This M-CRP improves CRP from aspect of efficiency,precision and performance with multi-level mechanism,which make the node in cloud,has more perception to the underlying topology.In the meantime the M-CRP-CAN with M-CRP approach has realized localization download and greatly raised the data transfer rate,reduced the cross-traffic in backbone network and improve the network performance therefore enhance cloud computing system efficiency.，

Key words: cloud computing, route, content addressable network

韩志杰,黄刘生,王汝传,孙力娟,盛明. 距离感知基于CAN的云计算网络路由机制[J]. 通信学报, 2011, 32(7): 29-39.

图/表 18

图1

图2

图3

图4

图5

图6

图7

图8

图

图10

图11

图12

图13

图14

图15

图16

图17

图18

参考文献 15

[1]	AO-JAN S , CHOFFNES D R , FABIAN E ,et al. Relative network positioning via CDN redirections[A]. Proc of the Int’l on Distributed Computing Systems (ICDCS)[C]. New York,NY,USA, 2008. 377-386.
[2]	GUMMADI K , SAROIU P , STEVEN D ,et al. Estimating latency between arbitrary Internet end hosts[A]. Proc ACM Internet Measurement Workshop[C]. Marseille,France, 2002. 5-8.
[3]	RATNASAMY S , HANDLEY M , KARP R ,et al. Topologically-aware overlay construction and server selection[A]. Proc of IEEE INFOCOM[C]. New York,USA, 2002. 1190-1199.
[4]	BERNARD W , ALEKSANDRS S , EMIN G ,et al. A lightweight network location service without virtual coordinates[A]. Proc of ACM SIGCOMM[C]. Beijing,China, 2005. 85-96.
[5]	FRANCIS P , JAMIN S , CHENG J ,et al. ID maps:a global Internet host distance estimation service[A]. Proc of IEEE/ACM Transactions on Networking[C]. New York,NY,USA, 2001. 525-539.
[6]	NG T , HUI Z , CAMEGIE M ,et al. Predicting Internet network distance with coordinates-based approaches[A]. Proc of IEEE INFOCOM[C]. New York,USA, 2002. 170-179.
[7]	NG T , HUI Z . A network positioning system for the Internet[A]. Proc of the USENIX Annual Technical Conference[C]. Boston,MA,USA, 2004. 11-22.
[8]	MARCELO P , JON C , STEVE W ,et al. Lighthouses for scalable distributed locations[A]. Proc of the International Workshop on Peerto-Peer Systems (IPTPS)[C]. San Diego,CA USA, 2003. 279-291.
[9]	SHAVITT Y , TANKEL T . Big-bang simulation for embedding network distances in Euclidean space[A]. Proc of IEEE INFOCOM[C]. San Francisco,USA, 2003. 993-1006.
[10]	LIYING T , MARK C.Virtual landmarks for the Internet . [A]. Proc of the Internet Measurement Conference[C]. Miami Beach,FL,USA, 2003. 143-152.
[11]	FABRIZIO M , DOMENICO T , PAOLO T . Adapting mapReduce for dynamic environments using peer to peer model[A]. Proc of the First Workshop on Cloud Computing and its Applications (CCA 2008)[C]. Chicago,USA, 2008. 113-125.
[12]	卢国强 . 云计算环境下的泛联路由平台[J]. 信息安全与技术, 2010(8): 106-108. LU G Q . The route algorithm for cloud computing[J]. Information Security and Technology, 2010(8): 106-108.
[13]	SYLVIA R , PAVL F , MARK H ,et al. A sealable content—addressable network[A]. Proc of the ACM SIGCOMM[C]. Pittsburgh,PA,USA, 2001. 161-172.
[14]	SALTON G , MCGILL M J . Introduction to Modern Information Retrieval[M]. New York: McGraw-HillPress, 1986.
[15]	RODRIGO N , CALHEIRO S , RAJIV R ,et al. Cloudsim:a novel framework for modeling and simulation of cloud computing infrastructures and serviece[EB/OL]. , 2011.

距离感知基于CAN的云计算网络路由机制

Distance aware route algorithm for cloud computing based on CAN

在线阅读

PDF下载

可视化

被引次数

摘要/Abstract

引用本文

使用本文

图/表 18

参考文献 15

相关文章 15

Metrics

推荐阅读 0

[1]	李竟博, 马礼, 李阳, 傅颖勋, 马东超. 感传算协同工业互联网优化设计[J]. 通信学报, 2023, 44(6): 12-22.
[2]	赵仕祺, 黄小红, 钟志港. 基于信誉的域间路由选择机制的研究与实现[J]. 通信学报, 2023, 44(6): 47-56.
[3]	马玲, 樊漆亮, 许婷, 郭冠琛, 张圣林, 孙永谦, 张玉志. 基于强化学习的在线离线混部云环境下的调度框架[J]. 通信学报, 2023, 44(6): 90-102.
[4]	张进, 葛强, 徐伟海, 江逸茗, 马海龙, 于洪涛. 拟态路由器BGP代理的设计实现与形式化验证[J]. 通信学报, 2023, 44(3): 33-44.
[5]	秦武韬, 王鹏, 李玉峰. 基于周期耦合处理的CAN总线数据组合加密方法[J]. 通信学报, 2023, 44(1): 29-38.
[6]	杨思锦, 庄雷, 宋玉, 王家兴, 阳鑫宇. 多模态网络中时间敏感网络模态的智能调度机制[J]. 通信学报, 2022, 43(5): 82-91.
[7]	陈全, 杨磊, 郭剑鸣, 李星辰, 赵勇, 陈小前. 低轨巨型星座网络：组网技术与研究现状[J]. 通信学报, 2022, 43(5): 177-189.
[8]	李传煌, 陈泱婷, 唐晶晶, 楼佳丽, 谢仁华, 方春涛, 王伟明, 陈超. QL-STCT：一种SDN链路故障智能路由收敛方法[J]. 通信学报, 2022, 43(2): 131-142.
[9]	裴金川, 胡宇翔, 田乐, 胡涛, 李子勇. 联合路由规划的时间敏感网络流量调度方法[J]. 通信学报, 2022, 43(12): 54-65.
[10]	王鹏, 张修社, 索龙, 史可懿. 基于随机时变图的时间确定性网络路由算法[J]. 通信学报, 2021, 42(9): 21-30.
[11]	朱立东, 张勇, 贾高一. 卫星互联网路由技术现状及展望[J]. 通信学报, 2021, 42(8): 33-42.
[12]	杨明川, 薛冠昌, 李清毅. 基于邻居卫星负载状态的低轨卫星分布式路由算法[J]. 通信学报, 2021, 42(8): 43-51.
[13]	王化群, 刘哲, 何德彪, 李继国. 公有云中身份基多源IoT终端数据PDP方案[J]. 通信学报, 2021, 42(7): 52-60.
[14]	霍如, 倪东, 卢华, 夏云峰, 汪硕, 黄韬, 刘韵洁. 区块链PCN的高效路由策略[J]. 通信学报, 2021, 42(6): 30-40.
[15]	徐潇雨, 胡浩, 张红旗, 刘玉岭. 基于深度确定性策略梯度的随机路由防御方法[J]. 通信学报, 2021, 42(6): 41-51.