Routing Perturbation for Traffic Matrix Evaluation in a Segment Routing Network

被引:6
作者
Polverini, Marco [1 ,2 ]
Cianfrani, Antonio [1 ,2 ]
Listanti, Marco [1 ,2 ]
Baiocchi, Andrea [1 ,2 ]
机构
[1] Univ Roma La Sapienza, DIET Dept, I-00184 Rome, Italy
[2] Consorzio Nazl Interuniv Telecomunicaz, I-43124 Parma, Italy
来源
IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT | 2018年 / 15卷 / 04期
关键词
Traffic matrix; traffic measurement; segment routing;
D O I
10.1109/TNSM.2018.2862423
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Traffic matrix (TM) assessment is a key issue for optimizing network management costs and quality of service. This paper presents a method to measure the intensity of ingress-egress traffic flows on an Internet service providers network that overcomes the limits of the classical measurement-based approaches. The proposed algorithm, called segment routing perturbation traffic (SERPENT), uses a routing perturbation approach enabled by the segment routing paradigm: The paths of a subset of flows are changed so that their intensities can be determined measuring the variation of the load of the network links. The TM is measured in successive steps, called snapshots, in which sets of flows are progressively re-routed and measured, under a maximum link utilization constraint. We state an integer linear programming (ILP) optimization problem to determine the flows to be rerouted in one snapshot. SERPENT is an heuristic offering an efficient solution to the stated ILP. Results show that SERPENT assesses the intensity of more than 80% of flows even when the network is highly stressed, while reducing the configuration cost with respect to classical approaches. Moreover, when used in conjunction with an estimation algorithm, SERPENT allows a reduction of the estimation error by more than 50% with fewer than 5 snapshots.
引用
收藏
页码:1645 / 1660
页数:16
相关论文
共 23 条
[1]  
[Anonymous], 2018, ROUTING PERTURBATION
[2]  
Bhatia Randeep, 2015, 2015 IEEE Conference on Computer Communications (INFOCOM). Proceedings, P657, DOI 10.1109/INFOCOM.2015.7218434
[3]  
Cianfrani Antonio, 2016, 2016 IEEE Conference on Computer Communications: Workshops (INFOCOM WKSHPS), P245, DOI 10.1109/INFCOMW.2016.7562080
[4]   Building a better NetFlow [J].
Estan, C ;
Keys, K ;
Moore, D ;
Varghese, G .
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2004, 34 (04) :245-256
[5]  
Filsfils Clarence., 2017, Segment Routing Architecture, Internet-Draft
[6]  
Gong Y., 2015, P 1 ACM SIGCOMM S SO, P26
[7]  
Gunnar A., 2004, P 4 ACM SIGCOMM C IN, P149, DOI DOI 10.1145/1028788.1028807
[8]   Flow Monitoring Explained: From Packet Capture to Data Analysis With NetFlow and IPFIX [J].
Hofstede, Rick ;
Celeda, Pavel ;
Trammell, Brian ;
Drago, Idilio ;
Sadre, Ramin ;
Sperotto, Anna ;
Pras, Aiko .
IEEE COMMUNICATIONS SURVEYS AND TUTORIALS, 2014, 16 (04) :2037-2064
[9]  
Hohn N., 2003, Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement, P222
[10]   Coarse-grained traffic matrix estimation for data center networks [J].
Hu, Zhiming ;
Qiao, Yan ;
Luo, Jun .
COMPUTER COMMUNICATIONS, 2015, 56 :25-34