On the feasibility of utilizing correlations between user populations for traffic inference

Kun-Chan Lan, J. Heidemann
{"title":"On the feasibility of utilizing correlations between user populations for traffic inference","authors":"Kun-Chan Lan, J. Heidemann","doi":"10.1109/LCN.2005.97","DOIUrl":null,"url":null,"abstract":"Network models today are often derived from two different methods. On one hand, detailed traffic models are generated based on traces from a single tap into the network. Alternatively, one can collect higher-level traffic-matrix data with SNMP from many routers. However, inferring flow-level details from such data is still an open research issue. Today it is infeasible to collect a fine-grained, packet-level representation of a complete, multi-router network. Even if it were economically feasible to synchronize and monitor every router in a large network, the amount of data generated would tax storage and computation resources. In this work, we propose a methodology to infer flow-level traffic across a network by exploiting the correlations between user populations across different networks. The contribution of this paper is twofold. First, based on traces of Web traffic collected from two different sources, we observe that the user-behavior parameters of the traffic (such as user \"think\" time in Web traffic) are correlated across time, while the application-specific parameters of the traffic (such as object size) are correlated across \"similar\" networks. Second, by utilizing the correlations between similar networks, we propose a methodology for inferring traffic at places where continuously taking measurements is infeasible. We evaluate the effectiveness of our methodology via simulation","PeriodicalId":368269,"journal":{"name":"The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l","volume":"15 12","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LCN.2005.97","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Network models today are often derived from two different methods. On one hand, detailed traffic models are generated based on traces from a single tap into the network. Alternatively, one can collect higher-level traffic-matrix data with SNMP from many routers. However, inferring flow-level details from such data is still an open research issue. Today it is infeasible to collect a fine-grained, packet-level representation of a complete, multi-router network. Even if it were economically feasible to synchronize and monitor every router in a large network, the amount of data generated would tax storage and computation resources. In this work, we propose a methodology to infer flow-level traffic across a network by exploiting the correlations between user populations across different networks. The contribution of this paper is twofold. First, based on traces of Web traffic collected from two different sources, we observe that the user-behavior parameters of the traffic (such as user "think" time in Web traffic) are correlated across time, while the application-specific parameters of the traffic (such as object size) are correlated across "similar" networks. Second, by utilizing the correlations between similar networks, we propose a methodology for inferring traffic at places where continuously taking measurements is infeasible. We evaluate the effectiveness of our methodology via simulation
利用用户群之间的相关性进行流量推断的可行性
今天的网络模型通常来自两种不同的方法。一方面,详细的流量模型是基于网络中单个点触的痕迹生成的。或者,可以使用SNMP从许多路由器收集更高级的流量矩阵数据。然而,从这些数据推断流级细节仍然是一个开放的研究问题。今天,收集一个完整的多路由器网络的细粒度、包级表示是不可行的。即使同步和监控大型网络中的每个路由器在经济上是可行的,产生的数据量也会增加存储和计算资源的负担。在这项工作中,我们提出了一种方法,通过利用不同网络中用户群体之间的相关性来推断网络中的流级流量。本文的贡献是双重的。首先,基于从两个不同来源收集的Web流量的轨迹,我们观察到流量的用户行为参数(如用户在Web流量中的“思考”时间)是跨时间相关的,而流量的特定应用参数(如对象大小)是跨“相似”网络相关的。其次,通过利用相似网络之间的相关性,我们提出了一种方法来推断在连续测量是不可行的地方的流量。我们通过模拟来评估我们的方法的有效性
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书