We propose a Mixed Sharing Auxiliary Graph (MSAG) for dynamic traffic grooming in heterogeneous WDM mesh
networks. Based on MSAG model, a novel heuristic named BLSW-ILMS (Backup LSP Shared Working Lightpath with
Inter-layer Mixed Sharing) is proposed. Simulation results show that the proposed algorithm can efficiently decrease the
blocking probability.
In this paper, we propose a novel multi-modular optimal capacity algorithm for SDH (Synchronous Digital Hierarchy) mesh networks. Our objective is to minimize total capital cost of the SDH mesh networks with modularity. First, the optimization problem is formulated as an integer linear programming (ILP) model. Then considering the time complexity of ILP formulation for large-scale networks, a fast heuristic algorithm named Multi-Modular Optimal Capacity (MMOC) is proposed. Several network models, which serve as test cases, are provided and the numerical results show our heuristic algorithm has low time complexity and good performance (in terms of network cost) near to the ILP results.
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.