首页> 外文期刊>Ad hoc networks >Multimedia traffic classification with mixture of Markov components
【24h】

Multimedia traffic classification with mixture of Markov components

机译:Markov组件混合的多媒体流量分类

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

We study multimedia traffic classification into popular applications to assist the quality of service (QoS) support of networking technologies, including but not limited to, WiFi. For this purpose, we propose to model the multimedia traffic flow as a stochastic discrete-time Markov chain in order to take into account the strong sequentiality (i.e. the dependencies across the data instances) in the traffic flow observations. This addresses the shortcoming of the prior techniques that are based on feature extraction which is prone to losing the information of sequentiality. Also, for investigating the best application of our Markov approach to traffic classification, we introduce and test three data driven classification schemes which are all derived from the proposed model and tightly related to each other. Our first classifier has a global perspective of the traffic data via the likelihood function as a mixture of Markov components (MMC). Our second and third classifiers have local perspective based on k-nearest Markov components (kNMC) with the negative loglikelihood as a distance as well as k-nearest Markov parameters (kNMP) with the Euclidean distance. We additionally introduce to the use of researchers a rich multimedia traffic dataset consisting of four application categories, e.g., video on demand, with seven applications, e.g., YouTube. In the presented comprehensive experiments with the introduced dataset, our local Markovian approach kNMC outperforms MMC and kNMP and provides excellent classification performance, 89% accuracy at the category level and 85% accuracy at the application level and particularly over 95% accuracy for live video streaming. Thus, in test time, the nearest Markov components with the largest likelihoods yield the most discrimination power. We also observe that kNMC significantly outperforms the state-of-the-art methods (such as SVM, random forest and autoencoder) on both the introduced dataset and benchmark dataset both at the category and application levels.
机译:我们将多媒体流量分类研究到流行的应用程序中,以协助网络技术的服务质量(QoS)支持,包括但不限于WiFi。为此目的,我们建议将多媒体业务流模拟作为随机离散时间马尔可夫链,以考虑到流量观测中的强序列度(即,数据实例的依赖关系)。这解决了基于特征提取的现有技术的缺点,其易于失去续定信息。此外,为了调查我们的马尔可夫方法对流量分类的最佳应用,我们介绍和测试三种数据驱动的分类方案,这些方案均来自所提出的模型,彼此紧密相关。我们的第一分类器通过似然函数作为Markov组件(MMC)的混合,具有全局对交通数据的视角。我们的第二和第三分类器具有基于K到最近马尔可夫组件(KNMC)的局部视角,其中负值为距离以及欧几里德距离的距离以及k离最近的马尔可夫参数(KNMP)。我们还向研究人员介绍了一个丰富的多媒体流量数据集,包括四个应用类别,例如视频点播,有七种应用,例如YouTube。在介绍数据集的综合实验中,我们当地的马尔维亚方法KNMC优于MMC和KNMP,并提供出色的分类性能,在类别级别的精度为89%和85%的高精度,特别是实时视频流的准确度超过95%。 。因此,在测试时间中,具有最大可能性的最近的马尔可夫组件产生最大的辨别力。我们还观察到,KNMC在类别和应用程序级别的引入的数据集和基准数据集中显着优于最先进的方法(如SVM,随机林和AutoEncoder)。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号