Matthew Roughan
Mikkel Thorup
ABSTRACT
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.
- A. Feldmann, A. Greenberg, C. Lund, N. Reingold, J. Rexford, and F. True, "Deriving traffic demands for operational IP networks: Methodology and experience," IEEE/ACM Transactions on Networking, vol. 9, no. 3, pp. 265--279, 2001.]] Google Scholar
Digital Library
- A. Feldmann, A. Greenberg, C. Lund, N. Reingold, J. Rexford, and F. True, "Deriving traffic demands for operational IP networks: Methodology and experience," IEEE/ACM Transactions on Networking, pp. 265--279, June 2001. An earlier version appeared in SIGCOMM'00.]] Google ScholarDigital Library
- M. Roughan, A. Greenberg, C. Kalmanek, M. Rumsewicz, J. Yates, and Y. Zhang, "Experience in measuring backbone traffic variability: Models, metrics, measurements and meaning (extended abstract)," in Internet Measurement Workshop, 2002.]] Google ScholarDigital Library
- Y. Zhang, M. Roughan, N. Duffield, and A. Greenberg, "Fast accurate computation of large-scale IP traffic matrices from link loads." in Proc. ACM SIGMETRICS, June 2003.]] Google ScholarDigital Library
- A. Medina, N. Taft, K. Salamatian, S. Bhattacharyya, and C. Diot, "Traffic matrix estimation: Existing techniques and new directions," in Proc. ACM SIGCOMM, (Pittsburgh, USA), August 2002.]] Google ScholarDigital Library
- D. Mitra and K.G.Ramakrishnan, "A case study of multiservice, multipriority traffic engineering design for data networks," in Proc. IEEE GLOBECOM, pp. 1077--1083, 1999.]]Google ScholarCross Ref
- B. Fortz and M. Thorup, "Internet traffic engineering by optimizing OSPF weights," in Proc. IEEE INFOCOM, pp. 519--528, 2000.]]Google ScholarCross Ref
- K. Ramakrishnan and M. Rodriguez, "Optimal routing in shortest-path data networks," Lucent Bell Labs Technical Journal, vol. 6, no. 1, 2001.]]Google Scholar
- F. Lin and J. Wang, "Minimax open shortest path first routing algorithms in networks supporting the SMDS services," in Proc. IEEE International Conference on Communications (ICC), vol. 2, pp. 666--670, 1993.]]Google ScholarCross Ref
- M. Ericsson, M. Resende, and P. Pardalos, "A genetic algorithm for the weight setting problem in OSPF routing," J. Combinatorial Optimization, vol. 6, no. 3, pp. 299--333, 2002.]]Google ScholarCross Ref
- L. S. Buriol, M. G. C. Resende, C. C. Ribeiro, and M. Thorup, "A memetic algorithms for OSPF routing," in Proc. 6th INFORMS Telecom, pp. 187--188, 2002.]]Google Scholar
- B. Fortz and M. Thorup, "Optimizing OSPF/IS-IS weights in a changing world," IEEE Journal on Selected Areas in Communications (Special Issue on Recent Advances on Fundamentals of Network Management), vol. 20, no. 4, pp. 756--767, 2002.]]Google ScholarDigital Library
- R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows: Theory, Algorithms, and Applications. Upper Saddle River, New Jersey: Prentice Hall, 1993.]] Google ScholarDigital Library
- E. C. Rosen, A. Viswanathan, and R. Callon, "Multiprotocol label switching architecture." Network Working Group, Request for Comments, http://search.ietf.org/rfc/rfc3031.txt, 2001.]] Google ScholarDigital Library
- J. T. Moy, "OSPF version 2." Network Working Group, Request for Comments: 2328, http://search.ietf.org/rfc/rfc2328.txt, April 1998.]]Google Scholar
- R. Callon, "Use of OSI IS-IS for routing in TCP/IP and dual environments." Network Working Group, Request for Comments: 1195, http://search.ietf.org/rfc/rfc1195.txt, December 1990.]] Google ScholarDigital Library
- Cisco, "Configuring OSPF," 2001. Documentation at http://www.cisco.com/univercd/cc/td/doc/product/software/ios121/121cgcr/ip_c/ipcprt2/1cdospf.htm.]]Google Scholar
- E. H. L. Aarts and J. K. Lenstra, eds., Local Search in Combinatorial Optimization. Discrete Mathematics and Optimization, Chichester, England: Wiley-Interscience, 1997.]] Google ScholarDigital Library
- J. Kowalski and B. Warfield, "Modeling traffic demand between nodes in a telecommunications network," in ATNAC'95, 1995.]]Google Scholar
- J. Tinbergen, "Shaping the world economy: Suggestions for an international economic policy." The Twentieth Century Fund, 1962.]]Google Scholar
- P. Poyhonen, "A tentative model for the volume of trade between countries," Weltwirtschaftliches Archive, vol. 90, pp. 93--100, 1963.]]Google Scholar
- A. Dwivedi and R. Wagner, "Traffic model for USA long-distance optimal network," in Proc. Optical Fiber Communication Conference (OFC), pp. 156--158, 2000.]]Google Scholar
- A. Feldmann, A. Greenberg, C. Lund, N. Reingold, and J. Rexford, "Netscope: Traffic engineering for IP networks," IEEE Network Magazine, special issue on Internet traffic engineering, pp. 11--19, March/April 2000.]]Google Scholar
- H. Racke, "Minimizing congestion in general networks," in Proc. 43rd IEEE Symp. Foundations of Computer Science, 2002., pp. 43--52.]] Google ScholarDigital Library
- D. Applegate and E. Cohen, "Making Intra-Domain Routing Robust to Changing and Uncertain Traffic Demands: Understanding Fundamental Tradeoffs," in Proc. ACM SIGCOMM, 2003.]] Google ScholarDigital Library
- N. Spring, R. Mahajan, and D. Wetherall, "Measuring ISP Topologies with Rocketfuel," in Proc. ACM SIGCOMM, 2002.]] Google ScholarDigital Library
- K. Calvert, M. Doar, and E. W. Zegura, "Modeling internet topology," IEEE Communications Magazine, vol. 35, no. 6, pp. 160--163, June 1997.]]Google ScholarDigital Library
- P. L. Toint. Transportation modeling and operations research: A fruitful connection. In M. Labbe, G. Laporte, K. Tanczos, and P. L. Toint, editors, Operations Research and Decision Aid Methodologies in Traffic and Transportation Management, volume 166 of NATO ASI series: Ser. F, Computer and systems sciences, pages 1--27. Springer, 1998.]]Google Scholar
Index Terms
- Traffic engineering with estimated traffic matrices
Recommendations
An information-theoretic approach to traffic matrix estimation
SIGCOMM '03: Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communicationsTraffic matrices are required inputs for many IP network management tasks: for instance, capacity planning, traffic engineering and network reliability analysis. However, it is difficult to measure these matrices directly, and so there has been recent ...
Performance of estimated traffic matrices in traffic engineering
SIGMETRICS '03: Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systemsWe consider the performance of estimated traffic matrices in traffic engineering. More precisely, we first optimize the routing in an IP backbone to minimize congestion with the estimated traffic matrix. We then test the performance of the resulting ...
Performance of estimated traffic matrices in traffic engineering
We consider the performance of estimated traffic matrices in traffic engineering. More precisely, we first optimize the routing in an IP backbone to minimize congestion with the estimated traffic matrix. We then test the performance of the resulting ...
Comments