Dynamic traffic grooming in optical mesh networks is one of the most important and practical problems for designing WDM networks. Most of previous work solves it by applying the Dijsktra's algorithm on an auxiliary graph. Although those algorithms can give very good performance since they have a global view of the whole network, they are very time-consuming and thus cannot be applied in large networks. Therefore, we propose a heuristic algorithm to reduce the required computations by minimizing the size of the graph. We compare our algorithm with existing algorithms by extensive simulations. The results demonstrate that our algorithm can significantly reduce the computational complexity and outperform existing algorithms by large margins since it can easily avoid resource-inefficient lightpaths.
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.