Traffic matrix estimation

Author:

Medina A.1,Taft N.2,Salamatian K.3,Bhattacharyya S.2,Diot C.2

Affiliation:

1. Sprint Advanced Technology Labs. Burlingame, CA and Boston University. Boston MA

2. Sprint Advanced Technology Labs. Burlingame, CA

3. University of Paris VI. Paris, France

Abstract

Very few techniques have been proposed for estimating traffic matrices in the context of Internet traffic. Our work on POP-to-POP traffic matrices (TM) makes two contributions. The primary contribution is the outcome of a detailed comparative evaluation of the three existing techniques. We evaluate these methods with respect to the estimation errors yielded, sensitivity to prior information required and sensitivity to the statistical assumptions they make. We study the impact of characteristics such as path length and the amount of link sharing on the estimation errors. Using actual data from a Tier-1 backbone, we assess the validity of the typical assumptions needed by the TM estimation techniques. The secondary contribution of our work is the proposal of a new direction for TM estimation based on using choice models to model POP fanouts. These models allow us to overcome some of the problems of existing methods because they can incorporate additional data and information about POPs and they enable us to make a fundamentally different kind of modeling assumption. We validate this approach by illustrating that our modeling assumption matches actual Internet data well. Using two initial simple models we provide a proof of concept showing that the incorporation of knowledge of POP features (such as total incoming bytes, number of customers, etc.) can reduce estimation errors. Our proposed approach can be used in conjunction with existing or future methods in that it can be used to generate good priors that serve as inputs to statistical inference techniques.

Publisher

Association for Computing Machinery (ACM)

Subject

Computer Networks and Communications,Software

Reference11 articles.

Cited by 164 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. In-Network Address Caching for Virtual Networks;Proceedings of the ACM SIGCOMM 2024 Conference;2024-08-04

2. DRL-Tomo: a deep reinforcement learning-based approach to augmented data generation for network tomography;The Computer Journal;2024-07-21

3. Achieving Predictable and Scalable Load Balancing Performance in LEO Mega-Constellations;ICC 2024 - IEEE International Conference on Communications;2024-06-09

4. Routing-Oblivious Network Tomography with Flow-Based Generative Model;IEEE INFOCOM 2024 - IEEE Conference on Computer Communications;2024-05-20

5. The all-pairs vitality-maximization (VIMAX) problem;Annals of Operations Research;2024-05-10

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3