SIGMETRICS '04/Performance '04最新文献_第2页

Flow classification by histograms: or how to go on safari in the internet 通过直方图进行流量分类:或者如何在互联网上进行safari

SIGMETRICS '04/Performance '04 Pub Date : 2004-06-01 DOI: 10.1145/1005686.1005696

Augustin Soule, Kave Salamatian, N. Taft, R. Emilion, K. Papagiannaki

{"title":"Flow classification by histograms: or how to go on safari in the internet","authors":"Augustin Soule, Kave Salamatian, N. Taft, R. Emilion, K. Papagiannaki","doi":"10.1145/1005686.1005696","DOIUrl":"https://doi.org/10.1145/1005686.1005696","url":null,"abstract":"In order to control and manage highly aggregated Internet traffic flows efficiently, we need to be able to categorize flows into distinct classes and to be knowledgeable about the different behavior of flows belonging to these classes. In this paper we consider the problem of classifying BGP level prefix flows into a small set of homogeneous classes. We argue that using the entire distributional properties of flows can have significant benefits in terms of quality in the derived classification. We propose a method based on modeling flow histograms using Dirichlet Mixture Processes for random distributions. We present an inference procedure based on the Simulated Annealing Expectation Maximization algorithm that estimates all the model parameters as well as flow membership probabilities - the probability that a flow belongs to any given class. One of our key contributions is a new method for Internet flow classification. We show that our method is powerful in that it is capable of examining macroscopic flows while simultaneously making fine distinctions between different traffic classes. We demonstrate that our scheme can address issues with flows being close to class boundaries and the inherent dynamic behaviour of Internet flows.","PeriodicalId":172626,"journal":{"name":"SIGMETRICS '04/Performance '04","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121734986","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 70

Spatio-temporal available bandwidth estimation with STAB 使用STAB进行时空可用带宽估计

SIGMETRICS '04/Performance '04 Pub Date : 2004-06-01 DOI: 10.1145/1005686.1005734

V. Ribeiro, R. Riedi, Richard Baraniuk

引用次数: 22

Cross-architecture performance predictions for scientific applications using parameterized models 使用参数化模型的科学应用的跨架构性能预测

SIGMETRICS '04/Performance '04 Pub Date : 2004-06-01 DOI: 10.1145/1005686.1005691

G. Marin, J. Mellor-Crummey

引用次数: 238

How to identify and estimate the largest traffic matrix elements in a dynamic environment 如何识别和估计动态环境中最大的流量矩阵元素

SIGMETRICS '04/Performance '04 Pub Date : 2004-06-01 DOI: 10.1145/1005686.1005698

Augustin Soule, A. Nucci, R. Cruz, Emilio Leonardi, N. Taft

{"title":"How to identify and estimate the largest traffic matrix elements in a dynamic environment","authors":"Augustin Soule, A. Nucci, R. Cruz, Emilio Leonardi, N. Taft","doi":"10.1145/1005686.1005698","DOIUrl":"https://doi.org/10.1145/1005686.1005698","url":null,"abstract":"In this paper we investigate a new idea for traffic matrix estimation that makes the basic problem less under-constrained, by deliberately changing the routing to obtain additional measurements. Because all these measurements are collected over disparate time intervals, we need to establish models for each Origin-Destination (OD) pair to capture the complex behaviours of internet traffic. We model each OD pair with two components: the diurnal pattern and the fluctuation process. We provide models that incorporate the two components above, to estimate both the first and second order moments of traffic matrices. We do this for both stationary and cyclo-stationary traffic scenarios. We formalize the problem of estimating the second order moment in a way that is completely independent from the first order moment. Moreover, we can estimate the second order moment without needing any routing changes (i.e., without explicit changes to IGP link weights). We prove for the first time, that such a result holds for any realistic topology under the assumption of minimum cost routing and strictly positive link weights. We highlight how the second order moment helps the identification of the top largest OD flows carrying the most significant fraction of network traffic. We then propose a refined methodology consisting of using our variance estimator (without routing changes) to identify the top largest flows, and estimate only these flows. The benefit of this method is that it dramatically reduces the number of routing changes needed. We validate the effectiveness of our methodology and the intuitions behind it by using real aggregated sampled netflow data collected from a commercial Tier-1 backbone.","PeriodicalId":172626,"journal":{"name":"SIGMETRICS '04/Performance '04","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116298835","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 111

On performance bounds for the integration of elastic and adaptive streaming flows 弹性流与自适应流集成的性能边界

SIGMETRICS '04/Performance '04 Pub Date : 2004-06-01 DOI: 10.1145/1005686.1005716

T. Bonald, A. Proutière

引用次数: 74

Insensitive load balancing 不敏感负载均衡

SIGMETRICS '04/Performance '04 Pub Date : 2004-06-01 DOI: 10.1145/1005686.1005729

T. Bonald, M. Jonckheere, A. Proutière

引用次数: 56

Measuring adversaries 测量的敌人

SIGMETRICS '04/Performance '04 Pub Date : 2004-06-01 DOI: 10.1145/1005686.1005688

V. Paxson

引用次数: 3

Multicast protocols for scalable on-demand download 可扩展的按需下载的多播协议

SIGMETRICS '04/Performance '04 Pub Date : 2004-06-01 DOI: 10.1145/1005686.1005751

Niklas Carlsson, D. Eager, M. Vernon

{"title":"Multicast protocols for scalable on-demand download","authors":"Niklas Carlsson, D. Eager, M. Vernon","doi":"10.1145/1005686.1005751","DOIUrl":"https://doi.org/10.1145/1005686.1005751","url":null,"abstract":"Previous scalable protocols for downloading large, popular files from a single server include batching and cyclic multicast. With batching, clients wait to begin receiving a requested file until the beginning of its next multicast transmission, which collectively serves all of the waiting clients that have accumulated up to that point. With cyclic multicast, the file data is cyclically transmitted on a multicast channel. Clients can begin listening to the channel at an arbitrary point in time, and continue listening until all of the file data has been received. This paper first develops lower bounds on the average and maximum client delay for completely downloading a file, as functions of the average server bandwidth used to serve requests for that file, for systems with homogeneous clients. The results show that neither cyclic multicast nor batching consistently yields performance close to optimal. New hybrid download protocols are proposed that achieve within 15% of the optimal maximum delay and 20% of the optimal average delay in homogeneous systems. For heterogeneous systems in which clients have widely-varying achievable reception rates, an additional design question concerns the use of high rate transmissions, which can decrease delay for clients that can receive at such rates, in addition to low rate transmissions that can be received by all clients. A new scalable download protocol for such systems is proposed, and its performance is compared to that of alternative protocols as well as to new lower bounds on maximum client delay. The new protocol achieves within 25% of the optimal maximum client delay in all scenarios considered.","PeriodicalId":172626,"journal":{"name":"SIGMETRICS '04/Performance '04","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116685295","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 6

Emulating low-priority transport at the application layer: a background transfer service 在应用层模拟低优先级传输:后台传输服务

SIGMETRICS '04/Performance '04 Pub Date : 2004-06-01 DOI: 10.1145/1005686.1005703

P. Key, L. Massoulié, B. Wang

引用次数: 54

Characterization of queue fluctuations in probabilistic AQM mechanisms 概率AQM机制中队列波动的表征

SIGMETRICS '04/Performance '04 Pub Date : 2004-06-01 DOI: 10.1145/1005686.1005721

P. Tinnakornsrisuphap, R. La

引用次数: 27