Abstract
Feature Issue on
Next-Generation WDM Network Design and Routing (WDMN). Single
shortest-path routing is known to perform poorly for Internet traffic engineering
(TE) where the typical optimization objective is to minimize the maximum link load.
Splitting traffic uniformly over equal-cost multiple shortest paths in open shortest
path first and intermediate system-intermediate system protocols does not always
minimize the maximum link load when multiple paths are not carefully selected for
the global traffic demand matrix. However, a TE-aware shortest path among all the
equal-cost multiple shortest paths between each ingress-egress pair can be selected
such that the maximum link load is significantly reduced. IP routers can use the
globally optimal TE-aware shortest path without any change to existing routing
protocols and without any serious configuration overhead. While calculating TE-aware
shortest paths, the destination-based forwarding constraint at a node should be
satisfied, because an IP router will forward a packet to the next hop toward the
destination by looking up the destination prefix. We present a mathematical problem
formulation for finding a set of TE-aware shortest paths for the given network as an
integer linear program, and we propose a simple heuristic for solving large
instances of the problem. Then we explore the usage of our proposed algorithm for
the integrated TE method in IP-over-WDM networks. The proposed algorithm is
evaluated through simulations in IP networks as well as in IP-over-WDM
networks.
© 2003 Optical Society of America
PDF Article
More Like This
Cited By
You do not have subscription access to this journal. Cited by links are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.
Contact your librarian or system administrator
or
Login to access Optica Member Subscription