Traffic engineering with estimated traffic matrices

Traffic engineering and traffic matrix estimation are often treated as separate fields, even though one of the major applications for a traffic matrix is traffic engineering. In cases where a traffic matrix cannot be measured directly, it may still be estimated from indirect data (such as link measurements), but these estimates contain errors. Yet little thought has been given to the effects of inexact traffic estimates on traffic engineering. In this paper we consider how well traffic engineering works with estimated traffic matrices in the context of a specific task; namely that of optimizing network routing to minimize congestion, measured by maximum link-utilization. Our basic question is: how well is the real traffic routed if the routing is only optimized for an estimated traffic matrix? We compare against optimal routing of the real traffic using data derived from an operational tier-1 ISP. We find that the magnitude of errors in the traffic matrix estimate is not, in itself, a good indicator of the performance of that estimate in route optimization. Likewise, the optimal algorithm for traffic engineering given knowledge of the real traffic matrix is no longer the best with only the estimated traffic matrix as input. Our main practical finding is that the combination of a known traffic matrix estimation technique and a known traffic engineering technique can get close to the optimum in avoiding congestion for the real traffic. We even demonstrate stability in the sense that routing optimized on data from one day continued to perform well on subsequent days. This stability is crucial for the practical relevance to off-line traffic engineering, as it can be performed by ISPs today.

[1]  Ross W. Callon,et al.  Use of OSI IS-IS for routing in TCP/IP and dual environments , 1990, RFC.

[2]  Edith Cohen,et al.  Making intra-domain routing robust to changing and uncertain traffic demands: understanding fundamental tradeoffs , 2003, SIGCOMM '03.

[3]  Albert G. Greenberg,et al.  Experience in measuring backbone traffic variability: models, metrics, measurements and meaning , 2002, IMW '02.

[4]  Ratul Mahajan,et al.  Measuring ISP topologies with rocketfuel , 2002, TNET.

[5]  K. G. Ramakrishnan,et al.  Optimal routing in shortest-path data networks , 2001, Bell Labs Technical Journal.

[6]  Anja Feldmann,et al.  NetScope: traffic engineering for IP networks , 2000, IEEE Netw..

[7]  Celso C. Ribeiro,et al.  A Memetic Algorithm for OSPF Routing , 2002 .

[8]  Harald Räcke,et al.  Minimizing Congestion in General Networks , 2002, FOCS.

[9]  Anja Feldmann,et al.  Deriving traffic demands for operational IP networks: methodology and experience , 2000, SIGCOMM.

[10]  Philippe L. Toint,et al.  Transportation Modelling and Operations Research: A Fruitful Connection , 1998 .

[11]  Jacek Kowalski,et al.  Modelling Traffic Demand Between Nodes in a Telecommunications Network , 1995 .

[12]  A. Dwivedi,et al.  Traffic model for USA long-distance optical network , 2000, Optical Fiber Communication Conference. Technical Digest Postconference Edition. Trends in Optics and Photonics Vol.37 (IEEE Cat. No. 00CH37079).

[13]  Panos M. Pardalos,et al.  A Genetic Algorithm for the Weight Setting Problem in OSPF Routing , 2002, J. Comb. Optim..

[14]  Eric C. Rosen,et al.  Multiprotocol Label Switching Architecture , 2001, RFC.

[15]  David K. Smith Network Flows: Theory, Algorithms, and Applications , 1994 .

[16]  J. L. Wang,et al.  Minimax open shortest path first routing algorithms in networks supporting the SMDS service , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.

[17]  Debasis Mitra,et al.  A case study of multiservice, multipriority traffic engineering design for data networks , 1999, Seamless Interconnection for Universal Services. Global Telecommunications Conference. GLOBECOM'99. (Cat. No.99CH37042).

[18]  Albert G. Greenberg,et al.  Fast accurate computation of large-scale IP traffic matrices from link loads , 2003, SIGMETRICS '03.

[19]  Matthew Roughan,et al.  Experience in measuring internet backbone traffic variability: Models metrics, measurements and meaning , 2003 .

[20]  Kenneth L. Calvert,et al.  Modeling Internet topology , 1997, IEEE Commun. Mag..

[21]  Mikkel Thorup,et al.  Internet traffic engineering by optimizing OSPF weights , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[22]  Christophe Diot,et al.  Traffic matrix estimation: existing techniques and new directions , 2002, SIGCOMM 2002.

[23]  J. K. Lenstra,et al.  Local Search in Combinatorial Optimisation. , 1997 .

[24]  John Moy,et al.  OSPF Version 2 , 1998, RFC.

[25]  J. Tinbergen Shaping the World Economy: Suggestions for an International Economic Policy , 1964 .

[26]  Mikkel Thorup,et al.  Optimizing OSPF/IS-IS weights in a changing world , 2002, IEEE J. Sel. Areas Commun..