Mesh Networks

IMSH: an iterative heuristic for SRLG diverse routing in WDM mesh networks
Survivable routing of a connection involves computation of a pair of diverse routes such that at most one route fails when failures …
Cite DOI URL
A graph model for dynamic waveband switching in WDM mesh networks
The problem of waveband switching (WBS) in a wavelength-division multiplexing (WDM) mesh network with dynamic traffic requests is …
Cite DOI URL
Constrained dynamic traffic grooming in WDM mesh networks with link bundled auxiliary graph model
This paper addresses the two-layer routing problem in wavelength division multiplexed (WDM) optical mesh networks subject to resource …
Cite DOI URL
Survivable traffic grooming with differentiated end-to-end availability guarantees in WDM mesh networks
Traffic grooming is critical in WDM optical metropolitan area networks (MANs), where low-rate connections are packed onto high-rate …
Cite DOI URL