GPU OpenFlow海量数据网络处理模型——GOMDI

doi:10.11772/j.issn.1001-9081.2014.08.2243

计算机应用 ›› 2014, Vol. 34 ›› Issue (8): 2243-2247.DOI: 10.11772/j.issn.1001-9081.2014.08.2243

GPU OpenFlow海量数据网络处理模型——GOMDI

张伟¹,解争龙¹,丁要军¹,²,张潇晓²

1. 咸阳师范学院信息工程学院，陕西咸阳712000
2. 西北工业大学计算机学院，西安710072

收稿日期:2014-03-03 修回日期:2014-04-18 出版日期:2014-08-01 发布日期:2014-08-10
通讯作者: 张伟
作者简介:张伟（1981-），男，陕西咸阳人，讲师，硕士，主要研究方向：并行计算、机器学习；解争龙（1961-），男，陕西咸阳人，教授，硕士，主要研究方向：网络安全；丁要军（1980-），男（回族），河南许昌人，讲师，博士，主要研究方向：机器学习、网络安全；张潇晓（1986-），男，湖南株洲人，博士研究生，主要研究方向：云计算、金融分析、机器学习。
基金资助:
国家自然科学基金资助项目;陕西省教育厅科研计划项目;陕西省科技厅科研计划项目;咸阳师范学院专项科研基金资助项目

GOMDI: GPU OpenFlow massive data network analysis model

ZHANG Wei¹,XIE Zhenglong¹,DING Yaojun¹,²,ZHANG Xiaoxiao²

1. College of Information Engineering, Xianyang Normal University, Xianyang Shaanxi 712000, China;
2. College of Computer, Northwestern Polytechnical University, Xi'an Shaanxi 710072, China

Received:2014-03-03 Revised:2014-04-18 Online:2014-08-01 Published:2014-08-10
Contact: ZHANG Wei

摘要/Abstract

摘要：

OpenFlow的出现提高了现有网络的服务质量(QoS)，但在处理海量数据时存在网络会话识别效率低、网络报文转发路径不佳等缺点。在OpenFlow的研究基础上，提出了海量网络数据处理(GOMDI)模型，通过将GPU并行计算、生物序列算法和机器学习方法相融合，设计出GOMDI网络会话匹配算法和路径选择算法。实验结果表明，GOMDI网络会话匹配算法与CPU环境相比加速比提升了近300；路径选择算法中网络丢包率低于5%，网络延时小于20ms。因此，GOMDI模型可有效地提升网络性能，满足大数据环境下实时处理海量信息的需求。

Abstract:

OpenFlow enhances the Quality of Service (QoS) of traditional networks, but it has disadvantage that its network session identification efficiency is low and the network packet forwarding path is poor and so on. On the basis of the current study of the OpenFlow, GPU OpenFlow Massive Data Network Analysis (GOMDI) model was proposed by this paper, through integrating the biological sequence algorithm, GPU parallel computing algorithm and machine learning methods. The network session matching algorithm and path selection algorithm of GOMDI were designed. The experimental results show that the speedup of the GOMDI network session matching algorithm is over 300 higher than the CPU environment in real network, and the network packet loss rate of its path selection algorithm is lower than 5%, the network delay is less than 20ms. Thus, the GOMDI model can effectively improve network performance and meet the needs of the real-time processing for massive information in big data environment.

中图分类号:

TP393.02

张伟解争龙丁要军张潇晓. GPU OpenFlow海量数据网络处理模型——GOMDI[J]. 计算机应用, 2014, 34(8): 2243-2247.

ZHANG Wei XIE Zhenglong DING Yaojun ZHANG Xiaoxiao. GOMDI: GPU OpenFlow massive data network analysis model[J]. Journal of Computer Applications, 2014, 34(8): 2243-2247.

参考文献

［1］GREENBERG A, HJALMTYSSON G, MALTZ D A, et al. A clean slate 4D approach to network control and management ［J］. ACM SIGCOMM Computer Communication Review, 2005, 35(5): 41-54.
［2］McKEOWN N, ANDERSON T, BALAKRISHNAN H, et al. OpenFlow: enabling innovation in campus networks ［J］. ACM SIGCOMM Computer Communication Review, 2008, 38(2): 69-74.
［3］MOORE A W, PAPAGIANNAKI K. Toward the accurate identification of network applications ［C］// Proceedings of the 6th International Conference on Passive and Active Network Measurement. Berlin: Springer, 2005: 41-54.
［4］NEEDLEMAN S B, WUNSCH C D. A general method applicable to the search for similarities in the amino acid sequence of two proteins ［J］. Journal of Molecular Biology, 1970, 48(3): 443-453.
［5］SMITH T F, WATERMAN M S. Identification of common molecular subsequences ［J］. Journal of Molecular Biology, 1981, 147(1): 195-197.
［6］AJI A M, FENG W, BLAGOJEVIC F, et al. Cell-SWat: modeling and scheduling wavefront computations on the cell broadband engine ［C］// Proceedings of the 5th Conference on Computing Frontiers. New York: ACM Press, 2008: 13-22.
［7］MARTINS W S, del CUVILLO J, USECHE F J, et al. A mul-tithreaded parallel implementation of a dynamic programming algorithm for sequence comparison ［C］// PSB 2001: Proceedings of the 6th Pacific Symposium on Biocomputing. Hawaii: ［s.n.］, 2001. 2001: 311-322.
［8］SIMON H A. The sciences of the artificial ［M］. Cambridge: MIT Press, 1996.
［9］MICHALSKI R S. A theory and methodology of inductive learning ［J］. Artificial Intelligence, 1983, 20(2): 111-161.
［10］ANDERSON J R. Machine learning: an artificial intelligence approach ［M］. San Francisco: Morgan Kaufmann Publishers, 1986.
［11］CORTES C, VAPNIK V. Support-vector networks ［J］. Machine Learning, 1995, 20(3): 273-297.
［12］ESTE A, GRINGOLI F, SALGARELLI L. Support vector ma-chines for TCP traffic classification ［J］. Computer Networks, 2009, 53(14): 2476-2490.
［13］LI Z, YUAN R, GUAN X. Accurate classification of the Internet traffic based on the SVM method ［C］// ICC'07: Proceedings of the 2007 IEEE International Conference on Communications. Washington, DC: IEEE Computer Society, 2007: 1373-1378.
［14］PLATT J. Probabilistic outputs for support vector machines and comparisons to regularized likelihood methods ［M］// SMOLA A J, BARTLETT P J. Advances in Large Margin Classifiers. Cambridge: MIT Press, 2000: 61-74.
［15］JOACHIMS T. Training linear SVMs in linear time ［C］// Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. New York: ACM Press, 2006: 217-226.
［16］BURGES C J C. A tutorial on support vector machines for pattern recognition ［J］. Data Mining and Knowledge Discovery, 1998, 2(2): 121-167.
［17］MANGASARIAN O L, STREET W N, WOLBERG W H. Breast cancer diagnosis and prognosis via linear programming ［J］. Operations Research, 1995, 43(4): 570-577.
［18］HARTIGAN J A, WONG M A. Algorithm AS 136: a k-means clustering algorithm ［J］. Journal of the Royal Statistical Society, Series C: Applied Statistics, 1979, 28(1): 100-108.
［19］LIU Y, LI W, LI Y. Network traffic classification using k-means clustering ［C］// IMSCCS 2007: Proceedings of the Second International Multi-Symposiums on Computer and Computational Sciences. Washington, DC: IEEE Computer Society, 2007: 360-365.
［20］ERMAN J, ARLITT M, MAHANTI A. Traffic classification using clustering algorithms ［C］// Proceedings of the 2006 SIGCOMM Workshop on Mining Network Data. New York: ACM Press, 2006: 281-286.

[1]	盛俊, 李斌, 陈崚. 基于模块度和标签传递的推荐算法[J]. 计算机应用, 2020, 40(9): 2606-2612.
[2]	罗香玉, 李嘉楠, 罗晓霞, 王佳. 改进的动态图社区演化关系分析方法[J]. 计算机应用, 2020, 40(8): 2313-2318.
[3]	郭曙杰, 李志华, 蔺凯青. 云环境下基于模糊隶属度的虚拟机放置算法[J]. 计算机应用, 2020, 40(5): 1374-1381.
[4]	卢光跃, 周亮, 吕少卿, 施聪, 苏可可. 基于图信号处理的无线传感器网络异常节点检测算法[J]. 计算机应用, 2020, 40(3): 783-787.
[5]	赵季红, 吴豆豆, 曲桦, 殷振宇. 基于软件定义网络的可靠性虚拟网络映射保障机制[J]. 计算机应用, 2020, 40(3): 770-776.
[6]	蔺凯青, 李志华, 郭曙杰, 李双俐. 云环境中多目标优化的虚拟机放置算法[J]. 计算机应用, 2019, 39(12): 3597-3603.
[7]	冯文博, 洪征, 吴礼发, 付梦琳. 网络协议识别技术综述[J]. 计算机应用, 2019, 39(12): 3604-3614.
[8]	郭棉, 李绮琦. 面向延迟敏感型物联网应用的计算迁移策略[J]. 计算机应用, 2019, 39(12): 3590-3596.
[9]	冯凯, 李婧. k元n方体的可靠性评估[J]. 计算机应用, 2019, 39(11): 3323-3327.
[10]	陈晓明, 李引珍, 沈强, 巨玉祥. 基于双层复杂网络的城市交通网络协同优化方法[J]. 计算机应用, 2019, 39(10): 3079-3087.
[11]	盛俊, 顾沈胜, 陈崚. 基于隐空间映射的带符号网络上的顶点分类[J]. 计算机应用, 2019, 39(5): 1411-1415.
[12]	邹腾宽, 汪钰颖, 吴承荣. 网络背景流量的分类与识别研究综述[J]. 计算机应用, 2019, 39(3): 802-811.
[13]	毛莺池, 郝帅, 平萍, 戚荣志. 基于组合双向拍卖的云资源调度方法[J]. 计算机应用, 2019, 39(1): 1-7.
[14]	刘鹏飞, 毛莺池, 王龙宝. 基于云雾协作模型的任务分配方法[J]. 计算机应用, 2019, 39(1): 8-14.
[15]	邹腾宽汪钰颖吴承荣. 网络背景流量的分类与识别研究综述[J]. 计算机应用, 0, (): 0-0.

GPU OpenFlow海量数据网络处理模型——GOMDI

GOMDI: GPU OpenFlow massive data network analysis model

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 15

编辑推荐

Metrics