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 ISP 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 (SR) 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 ILP optimization problem to determine the flows to be re-routed 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 to reduce the estimation error by more than 50% with less than 5 snapshots.

Routing perturbation for traffic matrix evaluation in a segment routing network / Polverini, Marco; Cianfrani, Antonio; Listanti, Marco; Baiocchi, Andrea. - In: IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT. - ISSN 1932-4537. - 15:4(2018), pp. 1645-1660. [10.1109/TNSM.2018.2862423]

Routing perturbation for traffic matrix evaluation in a segment routing network

Polverini, Marco;Cianfrani, Antonio
;
Listanti, Marco;Baiocchi, Andrea
2018

Abstract

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 ISP 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 (SR) 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 ILP optimization problem to determine the flows to be re-routed 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 to reduce the estimation error by more than 50% with less than 5 snapshots.
2018
segment routing; traffic matrix; traffic measurement; computer networks and communications; electrical and electronic engineering
01 Pubblicazione su rivista::01a Articolo in rivista
Routing perturbation for traffic matrix evaluation in a segment routing network / Polverini, Marco; Cianfrani, Antonio; Listanti, Marco; Baiocchi, Andrea. - In: IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT. - ISSN 1932-4537. - 15:4(2018), pp. 1645-1660. [10.1109/TNSM.2018.2862423]
File allegati a questo prodotto
File Dimensione Formato  
Polverini_Pre-print_Routing_2018.pdf

solo gestori archivio

Tipologia: Documento in Pre-print (manoscritto inviato all'editore, precedente alla peer review)
Licenza: Tutti i diritti riservati (All rights reserved)
Dimensione 431.21 kB
Formato Adobe PDF
431.21 kB Adobe PDF   Contatta l'autore
Polverini_Routing_2018.pdf

solo gestori archivio

Tipologia: Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza: Tutti i diritti riservati (All rights reserved)
Dimensione 1.63 MB
Formato Adobe PDF
1.63 MB Adobe PDF   Contatta l'autore

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11573/1191853
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 6
  • ???jsp.display-item.citation.isi??? 5
social impact