首页> 外文学位 >Scalable network traffic analysis on cloud computing platform.
【24h】

Scalable network traffic analysis on cloud computing platform.

机译:云计算平台上的可扩展网络流量分析。

获取原文
获取原文并翻译 | 示例

摘要

Understanding and quantifying network performance usually requires the analysis of a large volume of network traffic. Current network analysis does not scale well during the analysis of Terabyte or Petabyte traffic. Due to the emergence of a distributed computing platform, Spark facilitates the analysis of a large volume of data. However, there is no seamless method to analyze the vast volume of network traffic. In this study, the network traffic analysis framework on Amazon cloud computing environment has been developed. Different network scenarios were created in CloudSim to analyze the generated network traffic using scalable clustering machine learning techniques. The proposed system has two major subsystems; (i) data collection: the generation of different network traffic corresponding to different network topologies; and (ii) data analysis and distributed processing: Amazon EC2 was used for running the Spark program with different machine cores. The model took place on Spark MLlib and used three different clustering algorithms. The scalable K-means++ (K-means||) clustering algorithm was selected based in its speed and scalability for testing the system. It was faster than K-means and than GMM. The time for the analysis of K-means|| is 30.10% less than K-means and 75.18% less than for GMM algorithm for 150 million-line records of data. These findings allow the application of this technology for more complex problems with vast network traffic and large network topologies.
机译:了解和量化网络性能通常需要分析大量网络流量。在分析TB或PB流量时,当前的网络分析不能很好地扩展。由于分布式计算平台的出现,Spark促进了对大量数据的分析。但是,没有无缝方法可以分析大量网络流量。在本研究中,已经开发了基于Amazon云计算环境的网络流量分析框架。 CloudSim中创建了不同的网络方案,以使用可伸缩的群集机器学习技术来分析生成的网络流量。拟议的系统有两个主要子系统。 (i)数据收集:生成与不同网络拓扑相对应的不同网络流量; (ii)数据分析和分布式处理:Amazon EC2用于运行具有不同机器核心的Spark程序。该模型在Spark MLlib上进行,并使用了三种不同的聚类算法。基于可伸缩性K-means ++(K-means ||)聚类算法,基于其速度和可伸缩性选择了用于测试系统的算法。它比K-means和GMM快。分析K均值的时间||对于1.5亿行数据记录,它比K均值低30.10%,比GMM算法低75.18%。这些发现使该技术可以用于网络流量大和网络拓扑复杂的问题。

著录项

  • 作者

    Alzahrani, Sabah Mohammed.;

  • 作者单位

    Tennessee State University.;

  • 授予单位 Tennessee State University.;
  • 学科 Computer engineering.;Electrical engineering.;Computer science.
  • 学位 M.S.
  • 年度 2015
  • 页码 197 p.
  • 总页数 197
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号