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.


Original document

The different versions of the original document can be found in:

http://dx.doi.org/10.1007/978-0-387-30165-5_24
https://dblp.uni-trier.de/db/books/collections/RP2006.html#Rexford06,
https://academic.microsoft.com/#/detail/1678619878
Back to Top

Document information

Published on 01/01/2008

Volume 2008, 2008
DOI: 10.1007/978-0-387-30165-5_24
Licence: CC BY-NC-SA license

Document Score

0

Views 2
Recommendations 0

Share this document

claim authorship

Are you one of the authors of this document?