SIAM Journal on Computing
Efficient algorithms for routing dependable connections in WDM optical networks
IEEE/ACM Transactions on Networking (TON)
Survivable Networks: Algorithms for Diverse Routing
Survivable Networks: Algorithms for Diverse Routing
Optical WDM Networks (Optical Networks)
Optical WDM Networks (Optical Networks)
Survivable virtual concatenation for data over SONET/SDH in optical transport networks
IEEE/ACM Transactions on Networking (TON)
Optimal path selection for minimizing the differential delay in ethernet-over-SONET
Computer Networks: The International Journal of Computer and Telecommunications Networking
Reliable multipath provisioning for high-capacity backbone mesh networks
IEEE/ACM Transactions on Networking (TON)
Generic framing procedure (GFP): the catalyst for efficient data over transport
IEEE Communications Magazine
New transport services for next-generation SONET/SDH systems
IEEE Communications Magazine
Hybrid transport solutions for TDM/data networking services
IEEE Communications Magazine
DoS-resilient virtual networks through multipath embedding and opportunistic recovery
Proceedings of the 28th Annual ACM Symposium on Applied Computing
| Hi-index | 0.00 |
Survivability is a critical concern in modern telecom mesh networks because the failure of a network element may cause tremendous data and revenue loss in such networks using high-capacity optical fibers employing wavelength-division multiplexing (WDM). Multipath provisioning is a key feature of next-generation SONET/SDH networks (which can be used on top of optical WDM), and they can support virtual concatenation (VCAT); thus, multipath provisioning can significantly outperform single-path provisioning in resource efficiency, service resilience, and flexibility. However, in multipath provisioning, differential delay is an important constraint that should be considered. We investigate survivability of service paths based on differential-delay constraint (DDC) and multipath provisioning together in telecom backbone mesh networks. We propose the Shared Protection of the Largest Individual Traversed link (SPLIT) method for survivable multipath provisioning and present a DDC-based algorithm for multipath routing subject to DDC. We also compare the DDC-based algorithm with the K shortest link-disjoint paths (KDP) algorithm, using SPLIT, under dynamic service requests. We find that exploiting link-disjoint paths is very efficient for survivable multipath provisioning, and our algorithm is resource-efficient, has low signaling overhead, and has fast fault recovery for survivable multipath provisioning with DDC. For a 5-ms DDC, our algorithm can decrease the bandwidth blocking ratio (BBR) significantly in typical U.S. backbone networks.