Based on the layered-graph, this paper proposed an integrated routing algorithm named CIR (i.e., Cost-based Integrated
Routing) for IP/GMPLS over WDM networks. Assuming a peer model in GMPLS-Based optical networks, we take into
account the network topology and resource usage information on both IP and WDM layers. Focusing on the problems of
bottleneck and bandwidth fragment, we combine a cost function of lightpath in our algorithm as the main implement to
solve them. The optimized routing scheme is determined by the minimum cost value. In the simulation, we compare CIR
with two representative routing algorithms (i.e., HIRA [2] and MinLP [3]) in IP over WDM networks in terms of
blocking probability (BP) and wavelength utilization. The result shows that CIR can optimize the network resource
utilization to accept more connection requests and reduce traffic BP efficiently.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.