Abstract
The performance and reliability of the Internet depend, in large part, on the operation of the underlying routing protocols. Today’s IP routing protocols compute paths based on the network topology and configuration parameters, without regard to the current traffic load on the routers and links. The responsibility for adapting the paths to the prevailing traffic falls to the network operators and management systems. This chapter discusses the modeling and computational challenges of optimizing the tunable parameters, starting with conventional intradomain routing protocols that compute shortest paths as the sum of configurable link weights. Then, we consider the problem of optimizing the interdomain routing policies that control the flow of traffic from one network to another. Optimization based on local search has proven quite effective in grappling with the complexity of the routing protocols and the diversity of the performance objectives, and tools based on local search are in wide use in today’s large IP networks.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Bibliography
E.H.L. Aarts and J.K. Lenstra. Local Search in Combinatorial Optimization. Wiley-Interscience, 1997.
C. Alaettinoglu, V. Jacobson, and H. Yu. Towards milli-second IGP convergence. Expired Internet Draft, draft-alaettinoglu-isis-convergence-00.txt, 2000. http://www.packetdesign.com/Documents/convergence.pdf
D. Applegate and E. Cohen. Making intra-domain routing robust to changing and uncertain traffic demands: Understanding fundamental tradeoffs. In Proc. ACM SIGCOMM, August 2003.
O. Bonaventure, S. Uhlig, and B. Quoitin. The Case for More Versatile BGP Route Reflectors. Internet Draft draft-bonaventure-bgp-route-refiectors-00.txt, July 2004.
L. S. Buriol, M. G. C. Resende, C. C. Ribeiro, and M. Thorup. A memetic algorithm for OSPF routing. In Proc. INFORMS Telecom, pages 187–188, 2002.
R. Callon. Use of OSI IS-IS for Routing in TCP/IP and Dual Environments. Request For Comments 1195, IETF, December 1990.
Cariden MATE Framework, 2005. http://www.cariden.com/products/.
S. Chen and K. Nahrstedt. An overview of quality of service routing for next-generation high-speed networks: Problems and solutions. IEEE Network Magazine, pages 64–79, November/December 1998.
D. D. Clark. The design philosophy of the DARPA Internet protocols. In Proc. ACM SIGCOMM, pages 106–114, August 1988.
E. Crawley, R. Nair, B. Rajagopalan, and H. Sandick. A framework for QoS-based routing in the Internet. Request For Comments 2386, IETF, August 1998.
M. Ericsson, M.G.C. Resende, and P.M. Pardalos. A genetic algorithm for the weight setting problem in OSPF routing. J. Combinatorial Optimization, 6(3):299–333, 2002.
W. Fang and L. Peterson. Inter-AS traffic patterns and their implications. In Proc. IEEE Global Internet, December 1999.
A. Farrel, J.-Ph. Vasseur, and J. Ash. Path computation element (PCE) architecture. Internet Draft draft-ietf-pce-architecture-00.txt, March 2005.
N. Feamster, H. Balakrishnan, J. Rexford, A. Shaikh, and J. van der Merwe. The case for separating routing from routers. In Proc. ACM SIGCOMM Workshop on Future Directions in Network Architecture, August 2004a.
N. Feamster, J. Borkenhagen, and J. Rexford. Guidelines for interdomain traffic engineering. ACM SIGCOMM Computer Communication Review, 33(5), October 2003.
N. Feamster, J. Winick, and J. Rexford. A model of BGP routing for network engineering. In Proc. ACM SIGMETRICS, June 2004b.
A. Feldmann, A. Greenberg, C. Lund, N. Reingold, and J. Rexford. NetScope: Traffic engineering for IP networks. IEEE Network Magazine, pages 11–19, March 2000.
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 Trans. Networking, 9(3), June 2001.
J. Fong, A. Gilbert, S. Kannan, and M. Strauss. Better alternatives to OSPF routing. In Proc. Workshop on Approximation and Randomized Algorithms in Communication Networks, 2001.
B. Fortz, J. Rexford, and M. Thorup. Traffic engineering with traditional IP routing protocols. IEEE Communication Magazine, October 2002.
B. Fortz and M. Thorup. Internet traffic engineering by optimizing OSPF weights. In Proc. IEEE INFOCOM, March 2000.
B. Fortz and M. Thorup. Optimizing OSPF/IS-IS weights in a changing world. IEEE Journal on Selected Areas in Communications, 20(4):756–767, May 2002.
B. Fortz and M. Thorup. Robust optimization of OSPF/IS-IS weights. In Proc. International Network Optimization Conference, pages 225–230, October 2003.
B. Fortz and M. Thorup. Increasing Internet capacity using local search. Computational Optimization and Applications, 29(1): 13–48, 2004.
L. Gao, T G. Griffin, and J. Rexford. Inherently safe backup routing with BGP. In Proc. IEEE INFOCOM, April 2001.
L. Gao and J. Rexford. Stable Internet routing without global coordination. IEEE/ACM Trans. Networking, 9(6):681–692, December 2001.
G. Huston. Interconnection, peering, and settlements. In Proc. INET, June 1999.
A. Juttner, A. Szentesi, J. Harmatos, M. Pioro, and P. Gajowniczek. On solvability of an OSPF routing problem. In Proc. Nordic Teletraffic Seminar, 2000.
A. Khanna and J. Zinky. The revised ARPANET routing metric. In Proc. ACM SIGCOMM, pages 45–56, September 1989.
B. M. Leiner, V. G. Cerf, D. D. Clark, R. E. Kahn, L. Kleinrock, D. C. Lynch, J. Postel, L. G. Roberts, and S. S. Wolff. The Past and Future History of the Internet. Communications of the ACM, 40(2): 102–108, February 1997.
D. H. Lorenz, A. Orda, D. Raz, and Y. Shavitt. How good can IP routing be? Technical Report 2001-17, DIMACS, May 2001.
R. Mahajan, D. Wetherall, and T. Anderson. Negotiation-based routing between neighboring ISPs. In Proc. USENIX Symposium on Networked Systems Design and Implementation, May 2005.
A. Medina, N. Taft, K. Salamatian, S. Bhattacharyya, and C. Diot. Traffic matrix estimation: Existing techniques compared and new directions. In Proc. ACM SIGCOMM, August 2002.
J. Moy. OSPF Version 2. Request For Comments 2328, IETF, April 1998.
A. Nucci, B. Schroeder, S. Bhattacharyya, N. Taft, and C. Diot. IGP link weight assignment for transient link failures. In Proc. International Teletraffic Congress, August 2003.
OpNetSP Guru, 2005. http://www.opnet.com/products/spguru/home.html.
M. Pioro, A. Szentesi, J. Harmatos, A. Juttner, P. Gajowniczek, and S. Kozdrowski. On OSPF related network optimisation problems. In Proc. IFIP ATM IP, July 2000.
B. Quoitin, S. Uhlig, C. Pelsser, L. Swinnen, and O. Bonaventure. Interdomain traffic engineering with BGP. IEEE Communication Magazine, May 2004.
J. Rexford, J. Wang, Z. Xiao, and Y. Zhang. BGP routing stability of popular destinations. In Proc. Internet Measurement Workshop, 2002.
A. Sridharan, S. B. Moon, and C. Diot. On the correlation between route dynamics and routing loops. In Proc. Internet Measurement Conference, October 2003.
W. Richard Stevens. TCP/IP Illustrated, Volume 1: The Protocols. Addison-Wesley, January 1994. ISBN 0201633469.
R. Teixeira, A. Shaikh, T Griffin, and J. Rexford. Dynamics of hot-potato routing in IP networks. In Proc. ACM SIGMETRICS, June 2004a.
R. Teixeira, A. Shaikh, T Griffin, and G. Voelker. Network sensitivity to hot-potato disruptions. In Proc. ACM SIGCOMM, September 2004b.
Z. Wang, Y. Wang, and L. Zhang. Internet traffic engineering without full mesh overlaying. In Proc. IEEE INFOCOM, April 2001.
J. Winick, S. Jamin, and J. Rexford. Traffic engineering between neighboring domains. http://www.cs.princeton.edu/~jrex/papers/interAS.pdf, July 2002.
T. Ye and S. Kalyanaraman. A recursive random search algorithm for large-scale network parameter configuration. In Proc. ACM SIGMETRICS, June 2003.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer Science+Business Media, Inc.
About this chapter
Cite this chapter
Rexford, J. (2006). Route Optimization in IP Networks. In: Resende, M.G.C., Pardalos, P.M. (eds) Handbook of Optimization in Telecommunications. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-30165-5_24
Download citation
DOI: https://doi.org/10.1007/978-0-387-30165-5_24
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-30662-9
Online ISBN: 978-0-387-30165-5
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)